Welcome

Loading...

Del curso dictado por University of Colorado System

Packet Switching Networks and Algorithms

26 calificaciones

Explore Related Videos

At Coursera, you will find the best lectures in the world. Here are some of our personalized recommendations for you

University of Colorado System

Packet Switching Networks and Algorithms

26 calificaciones

Curso 3 de 4 en SpecializationComputer Communications

In this course, we deal with the general issues regarding packet switching networks. We discuss packet networks from two perspectives. One perspective involves external view of the network, and is concerned with services that the network provides to the transport layer that operates above it at the end systems. The second perspective is concerned with the internal operation of a network, including approaches directing information across the network, addressing and routing procedures, as well as congestion control inside the network.

De la lección

Frame Switching and Packet Switching

This module introduces LAN bridges and data link layer switching, and then focuses on packet switching at the network layer. It discusses datagram, one basic packet switching approaches.

Conoce a los instructores

Xiaobo Zhou
Professor, Interim Dean
College of Engineering and Applied Sciences

Our third course in this specialization is on packet-switching networks and

associated algorithms.

In this course,

we deal with the general issues regarding packet-switching networks.

We started this course by elaborating on the two perspectives on networks,

and we discussed the functions of the network layer.

Next we introduce the two basic approaches to operating at a packet-switching

network, and we use IP and ATM as examples of this approach.

We further introduced the basic approach for

selecting routes across the network, and examined how routing

tables in a network steal packets from the source to the destination.

We continue our discussion of routing,

focusing on two shortest path routing algorithms, the Bellman-Ford algorithm for

distance vector routing and Dijkstra algorithm for link-state routing.

We also studied the applications in Internet routing protocols, RIP and OSPF.

Furthermore, we discussed packet level traffic management

operating in a short time scale.

This type of traffic management is mainly concerned with packet and

packet scheduling to provide a differentiated treatment for

packets belonging to different quality of service classes.

Finally, we continue with traffic management at the flow level.

Common approaches including machine control and congestion control.

We have four primary learning objectives.

After taking this class, the student will elaborate two basic approaches to

operating a packet-switching network, datagrams, and the virtual circuits.

The student will apply two shortest-path routing algorithms,

the Bellman-Ford algorithm, and Dijskstra algorithm,

to produce the shortest path tree in a given network topology.

The student will discuss traffic management at the packet level and

at the flow level, and perform traffic policing and

shaping by token bucket and leaky bucket.

The student will summarize the functions of the network layer, and

explain the applications of the shortest

path routing algorithms in the Internet routing protocols.

Explora nuestro catálogo

Inscríbete de manera gratuita y obtén recomendaciones personalizadas, actualizaciones y ofertas.

Coursera brinda acceso universal a la mejor educación del mundo, al asociarse con las mejores universidades y organizaciones, para ofrecer cursos en línea.

© 2019 Coursera Inc. Todos los derechos reservados.

Descargar en la App Store

Consíguelo en Google Play