Network routing : algorithms, protocols, and architectures / Deepankar Medhi, Karthikeyan Ramasamy.

Format:

Book

Author/Creator:

Medhi, Deepankar.

Contributor:

Ramasamy, Karthikeyan, 1967-

Series:

Morgan Kaufmann series in networking.

The Morgan Kaufmann series in networking

Language:

English

Subjects (All):

Computer networks.

Routers (Computer networks).

Computer network architectures.

Physical Description:

1 online resource (957 p.)

Edition:

1st edition

Place of Publication:

Amsterdam ; Boston : Elsevier/Morgan Kaufmann Publishers, c2007.

Language Note:

English

System Details:

text file

Summary:

Network routing can be broadly categorized into Internet routing, PSTN routing, and telecommunication transport network routing. This book systematically considers these routing paradigms, as well as their interoperability. The authors discuss how algorithms, protocols, analysis, and operational deployment impact these approaches. A unique feature of the book is consideration of both macro-state and micro-state in routing; that is, how routing is accomplished at the level of networks and how routers or switches are designed to enable efficient routing.In reading this book, one will lea

Contents:

Front cover; Network Routing: Algorithms, Protocols, and Architectures; Copyright page; Contents; Foreword; Preface; About the Authors; Part I: Network Routing: Basics and Foundations; Chapter 1. Networking and Network Routing: An Introduction; 1.1 Addressing and Internet Service: An Overview; 1.2 Network Routing: An Overview; 1.3 IP Addressing; 1.4 On Architectures; 1.5 Service Architecture; 1.6 Protocol Stack Architecture; 1.7 Router Architecture; 1.8 Network Topology Architecture; 1.9 Network Management Architecture; 1.10 Public Switched Telephone Network; 1.11 Communication Technologies

1.12 Standards Committees1.13 Last Two Bits; 1.14 Summary; Further Lookup; Exercises; Chapter 2. Routing Algorithms: Shortest Path and Widest Path; 2.1 Background; 2.2 Bellman-Ford Algorithm and the Distance Vector Approach; 2.3 Dijkstra's Algorithm; 2.4 Comparison of the Bellman-Ford Algorithm and Dijkstra's Algorithm; 2.5 Shortest Path Computation with Candidate Path Caching; 2.6 Widest Path Computation with Candidate Path Caching; 2.7 Widest Path Algorithm; 2.8 k-Shortest Paths Algorithm; 2.9 Summary; Further Lookup; Exercises; Chapter 3. Routing Protocols: Framework and Principles

3.1 Routing Protocol, Routing Algorithm, and Routing Table3.2 Routing Information Representation and Protocol Messages; 3.3 Distance Vector Routing Protocol; 3.4 Link State Routing Protocol; 3.5 Path Vector Routing Protocol; 3.6 Link Cost; 3.7 Summary; Further Lookup; Exercises; Chapter 4. Network Flow Modeling; 4.1 Terminologies; 4.2 Single-Commodity Network Flow; 4.3 Multicommodity Network Flow: Three-Node Example; 4.4 Multicommodity Network Flow Problem: General Formulation; 4.5 Multicommodity Network Flow Problem: Nonsplittable Flow; 4.6 Summary; Further Lookup; Exercises

Part II: Routing in IP NetworksChapter 5. IP Routing and Distance Vector Protocol Family; 5.1 Routers, Networks, and Routing Information: Some Basics; 5.2 Static Routes; 5.3 Routing Information Protocol, Version 1 (RIPv1); 5.4 Routing Information Protocol, Version 2 (RIPv2); 5.5 Interior Gateway Routing Protocol (IGRP); 5.6 Enhanced Interior Gateway Routing Protocol (EIGRP); 5.7 Route Redistribution; 5.8 Summary; Further Lookup; Exercises; Chapter 6. OSPF and Integrated IS-IS; 6.1 From a Protocol Family to an Instance of a Protocol; 6.2 OSPF: Protocol Features; 6.3 OSPF Packet Format

6.4 Examples of Router LSAs and Network LSAs6.5 Integrated IS-IS; 6.6 Similarities and Differences Between IS-IS and OSPF; 6.7 Summary; Further Lookup; Exercises; Chapter 7. IP Traffic Engineering; 7.1 Traffic, Stochasticity, Delay, and Utilization; 7.2 Applications' View; 7.3 Traffic Engineering: An Architectural Framework; 7.4 Traffic Engineering: A Four-Node Illustration; 7.5 Link Weight Determination Problem: Preliminary Discussion; 7.6 Duality of the MCNF Problem; 7.7 Illustration of Link Weight Determination Through Duality; 7.8 Link Weight Determination: Large Networks; 7.9 Summary

Further Lookup

Notes:

Description based upon print version of record.

Includes bibliographical references (p. [724]-767) and index.

ISBN:

1-281-00354-9

9786611003548

0-08-047497-7

OCLC:

162570406