510104C Internet Routing Design
Teaching Scheme Examination Scheme
Lectures: 3 Hrs/week Theory: 100 Marks
Total Credits : 03
1 Networking and Network Routing: An Introduction
Addressing and Internet Service: An Overview, Network Routing, IP Addressing,
Service Architecture, Protocol Stack Architecture, Router Architecture, Network
Topology, Architecture, Network Management Architecture, Public Switched Telephone
Network
2 Routing Algorithms:
Shortest Path and Widest Path: Bellman–Ford Algorithm and the Distance Vector
Approach, Dijkstra’s Algorithm, Widest Path Algorithm, Dijkstra-Based Approach,
Bellman–Ford-Based Approach, k-Shortest Paths Algorithm.
OSPF and Integrated IS-IS : OSPF: Protocol Features, OSPF Packet Format, Integrated
IS-IS, Key Features, comparison
BGP : Features ,Operations, Configuration Initialization, phases, Message Format.
IP Routing and Distance Vector Protocol Family :RIPv1 and RIPv2
3 Routing Protocols: Framework and Principles
Routing Protocol, Routing Algorithm, and Routing Table, Routing Information
Representation and Protocol Messages, Distance Vector Routing Protocol, Link State
Routing Protocol, Path Vector Routing, Protocol, Link Cost.
4. Internet Routing and Router Architectures
Architectural View of the Internet, Allocation of IP Prefixes and AS Number, Policy-
Based Routing, Point of Presence, Traffic Engineering Implications, Internet Routing
Instability.
Router Architectures: Functions, Types, Elements of a Router, Packet Flow, Packet
Processing: Fast Path versus Slow Path, Router Architectures
5. Analysis of Network Algorithms
Network Bottleneck, Network Algorithmics, Strawman solutions, Thinking
Algorithmically, Refining the Algorithm, Cleaning up, Characteristics of Network
Algorithms.
IP Address Lookup Algorithms : Impact, Address Aggregation, Longest Prefix Matching,
Naïve Algorithms, Binary , Multibit and Compressing Multibit Tries, Search by Length
Algorithms, Search by Value Approaches, Hardware Algorithms, Comparing Different
Approaches
IP Packet Filtering and Classification : Classification, Classification Algorithms, Naïve
Solutions, Two-Dimensional Solutions, Approaches for d Dimensions,
6. Quality of Service Routing
QoS Attributes, Adapting Routing: A Basic Framework. Update Frequency, Information
Inaccuracy, and Impact on Routing, Dynamic Call Routing in the PSTN, Heterogeneous
Service, Single-Link Case, A General Framework for Source-Based QoS Routing with
Path Caching , Routing Protocols for QoS Routing, QOSPF: Extension to OSPF for QoS
Routing, ATM PNNI.
7. Routing and Traffic Engineering
Traffic Engineering of IP/MPLS Networks, VPN Traffic Engineering, Problem
Illustration: Layer 3 VPN, LSP Path Determination: Constrained Shortest Path Approach,
LSP Path Determination: Network Flow Modeling Approach, Layer 2 VPN Traffic
Engineering, Observations and General Modeling Framework, Routing/Traffic
Engineering for Voice Over MPLS.
REFERENCES:
1. Network Routing: Algorithms, Protocols, and Architectures Deepankar Medhi
and Karthikeyan Ramasamy (Morgan Kaufmann Series in Networking)
2. Network Algorithmics: An Interdisciplinary Approach to Designing Fast
Networked Devices George Varghese (Morgan Kaufmann Series in
Networking)
Reference http://www.unipune.ernet.in/stud_info/Syllabi/Syllabus_2008.html
|
No responses found. Be the first to respond...
|