Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
Tham khảo tài liệu 'networking theory and fundamentals - lecture 11', công nghệ thông tin, quản trị mạng phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả | TCOM 501 Networking Theory Fundamentals Lecture 11 April 16 2003 Prof. Yannis A. Korilis 1 Topics Routing in Data Network Graph Representation of a Network Undirected Graphs Spanning Trees and Minimum Weight Spanning Trees Directed Graphs Shortest-Path Algorithms Bellman-Ford Dijkstra Floyd-Warshall Distributed Asynchronous Bellman-Ford Algorithm Introduction to Routing What is routing The creation of state information in the network to enable efficient delivery of packets to their intended destination Two main components Information acquisition Topology addresses Information usage Computing good paths to all destinations Questions Where is B How to reach B How to best reach B How to best distribute all traffic not only A to B