Network routing : algorithms, protocols, and architectures

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 dep...

Full description

Saved in:
Bibliographic Details
Main Authors: Medhi, Deepankar, Ramasamy, Karthikeyan
Format: eBook Book
Language:English
Published: San Francisco Morgan Kaufmann Publishers is an imprint of Elsevier 2007
Elsevier Science & Technology
Morgan Kaufmann
Edition:1
Series:The Morgan Kaufmann series in networking
Subjects:
ISBN:0120885883, 9780120885886
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract 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 learn about 1) the evolution of network routing, 2) the role of IP and E.164 addressing in routing, 3) the impact on router and switching architectures and their design, 4) deployment of network routing protocols, 5) the role of traffic engineering in routing, and 6) lessons learned from implementation and operational experience. This book explores the strengths and weaknesses that should be considered during deployment of future routing schemes as well as actual implementation of these schemes. It allows the reader to understand how different routing strategies work and are employed and the connection between them. This is accomplished in part by the authors' use of numerous real-world examples to bring the material alive. . Bridges the gap between theory and practice in network routing, including the fine points of implementation and operational experience . Routing in a multitude of technologies discussed in practical detail, including, IP/MPLS, PSTN, and optical networking . Routing protocols such as OSPF, IS-IS, BGP presented in detail . A detailed coverage of various router and switch architectures . A comprehensive discussion about algorithms on IP-lookup and packet classification . Accessible to a wide audience due to its vendor-neutral approach . CD-ROM with bonus chapters on advanced topics
AbstractList 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 learn about 1) the evolution of network routing, 2) the role of IP and E.164 addressing in routing, 3) the impact on router and switching architectures and their design, 4) deployment of network routing protocols, 5) the role of traffic engineering in routing, and 6) lessons learned from implementation and operational experience. This book explores the strengths and weaknesses that should be considered during deployment of future routing schemes as well as actual implementation of these schemes. It allows the reader to understand how different routing strategies work and are employed and the connection between them. This is accomplished in part by the authors' use of numerous real-world examples to bring the material alive. . Bridges the gap between theory and practice in network routing, including the fine points of implementation and operational experience . Routing in a multitude of technologies discussed in practical detail, including, IP/MPLS, PSTN, and optical networking . Routing protocols such as OSPF, IS-IS, BGP presented in detail . A detailed coverage of various router and switch architectures . A comprehensive discussion about algorithms on IP-lookup and packet classification . Accessible to a wide audience due to its vendor-neutral approach . CD-ROM with bonus chapters on advanced topics
This first book to cover the theory and practice of networking routing schemes over different networks!.
Author Medhi, Deepankar
Ramasamy, Karthikeyan
Author_xml – sequence: 1
  fullname: Medhi, Deepankar
– sequence: 2
  fullname: Ramasamy, Karthikeyan
BackLink https://cir.nii.ac.jp/crid/1130282270524220416$$DView record in CiNii
BookMark eNpFkE1LAzEQhiNasa39D3sQQXDtJJuv7c0Wv6DoRbwu2XTarl03mqT27xut4mVmXnhmGJ4BOepch4RkFK4oUDmelkrnQBloLbTO5VgAQJHLAzIA0MAVL5U6TOEPKXpkwAAkMK0AjkmfSiYUcJAnZBTCa1oHBiWnsk8mjxh3zm8y77ax6VbZJDPtyvkmrt_CZfbuXXTWtWk03SIz3q6biDZuPYZT0luaNuDotw_Jy-3N8-w-nz_dPcyu57lRXFHIqbVGYGk1WGk1rbVcCqylZbgQ3C5rxALRsoWVYGSttRQcBa2FLqkohDbFkFzsD5uwwV1YuzaG6rPF2rlNqJKdfw2JPd-z6fOPLYZY_WAWu-hNW91MZ6ykkvMEnu3Brmkq23xXSoukjDEFgnHGIAkqvgAl2msu
ContentType eBook
Book
DBID RYH
DEWEY 004.6
DOI 10.1016/B978-012088588-6/50003-6
DatabaseName CiNii Complete
DatabaseTitleList

DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISBN 0080474977
9780080474977
Edition 1
ExternalDocumentID 9780080474977
EBC291644
BA82784030
GroupedDBID -KG
-VQ
-VX
089
20A
38.
A4I
A4J
AAAAS
AABBV
AAGAK
AALRI
AAORS
AAVWF
AAXUO
AAYWO
AAZNM
ABARN
ABGKT
ABGWT
ABIAV
ABIKZ
ABLXK
ABMAC
ABMRC
ABQPQ
ABQQC
ACHHS
ACLGV
ACXMD
ADCEY
ADVEM
ADXSK
AERYV
AEZAQ
AFOJC
AGAMA
AHPGB
AHWGJ
AIDBI
AIXPE
AJFER
AKHYG
ALMA_UNASSIGNED_HOLDINGS
ASVZH
AVWMD
AZZ
BBABE
CETPU
CZZ
DUGUG
EBSCA
ECOWB
GCSUU
GEOUK
HF4
HGY
INM
IQF
IVR
JWC
JXC
MYL
PQQKQ
RYH
SDK
SRW
UO7
XI1
AADAM
AJLYV
IVK
ID FETCH-LOGICAL-a74710-1cca5e9c80c6c81b86f5eb6c2ed54cfbee3eec2dc60a6b88654e51b58915358a3
ISBN 0120885883
9780120885886
ISICitedReferencesCount 127
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=(Sirsi) u800844&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Thu Feb 27 10:10:16 EST 2025
Wed Dec 10 10:00:05 EST 2025
Thu Jun 26 23:45:09 EDT 2025
IsPeerReviewed false
IsScholarly false
LCCN 2006028700
LCCallNum_Ident TK5105.5.M425 2007
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-a74710-1cca5e9c80c6c81b86f5eb6c2ed54cfbee3eec2dc60a6b88654e51b58915358a3
Notes Includes bibliographical references (p. [724]-767) and index
OCLC 162570406
PQID EBC291644
PageCount 957
ParticipantIDs askewsholts_vlebooks_9780080474977
proquest_ebookcentral_EBC291644
nii_cinii_1130282270524220416
PublicationCentury 2000
PublicationDate c2007
2007
2010-07-19
PublicationDateYYYYMMDD 2007-01-01
2010-07-19
PublicationDate_xml – year: 2007
  text: c2007
PublicationDecade 2000
2010
PublicationPlace San Francisco
PublicationPlace_xml – name: San Francisco
– name: San Diego
PublicationSeriesTitle The Morgan Kaufmann series in networking
PublicationYear 2007
2010
Publisher Morgan Kaufmann Publishers is an imprint of Elsevier
Elsevier Science & Technology
Morgan Kaufmann
Publisher_xml – name: Morgan Kaufmann Publishers is an imprint of Elsevier
– name: Elsevier Science & Technology
– name: Morgan Kaufmann
SSID ssj0000209416
ssib002887755
ssib011269642
Score 2.2746127
Snippet This first book to cover the theory and practice of networking routing schemes over different networks!.
Network routing can be broadly categorized into Internet routing, PSTN routing, and telecommunication transport network routing. This book systematically...
SourceID askewsholts
proquest
nii
SourceType Aggregation Database
Publisher
SubjectTerms Computer network architectures
Computer networks
Routers (Computer networks)
TableOfContents 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 Committees -- 1.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 Table -- 3.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
13.1 Global Telephone Addressing -- 13.2 Setting Up a Basic Telephone Call and Its Steps -- 13.3 Digit Analysis versus Translation -- 13.4 Routing Decision for a Dialed Call -- 13.5 Call Routing: Single National Provider Environment -- 13.6 Call Routing: Multiple Long-Distance Provider Case -- 13.7 Multiple-Provider Environment: Multiple Local Exchange Carriers -- 13.8 Routing Decision at an Intermediate TDM Switch -- 13.9 Number Portability -- 13.10 Nongeographic or Toll-Free Number Portability -- 13.11 Fixed/Mobile Number Portability -- 13.12 Multiple-Provider Environment with Local Number Portability -- 13.13 Summary -- Further Lookup -- Exercises -- Part IV: Router Architectures -- Chapter 14. Router Architectures -- 14.1 Functions of a Router -- 14.2 Types of Routers -- 14.3 Elements of a Router -- 14.4 Packet Flow -- 14.5 Packet Processing: Fast Path versus Slow Path -- 14.6 Router Architectures -- 14.7 Summary -- Further Lookup -- Exercises -- Chapter 15. IP Address Lookup Algorithms -- 15.1 Impact of Addressing on Lookup -- 15.2 Longest Prefix Matching -- 15.3 Naive Algorithms -- 15.4 Binary Tries -- 15.5 Multibit Tries -- 15.6 Compressing Multibit Tries -- 15.7 Search by Length Algorithms -- 15.8 Search by Value Approaches -- 15.9 Hardware Algorithms -- 15.10 Comparing Different Approaches -- 15.11 Summary -- Further Lookup -- Exercises -- Chapter 16. IP Packet Filtering and Classification -- 16.1 Importance of Packet Classification -- 16.2 Packet Classification Problem -- 16.3 Packet Classification Algorithms -- 16.4 Naive Solutions -- 16.5 Two-Dimensional Solutions -- 16.6 Approaches for d Dimensions -- 16.7 Extending Two-Dimensional Solutions -- 16.8 Divide and Conquer Approaches -- 16.9 Tuple Space Approaches -- 16.10 Decision Tree Approaches -- 16.11 Hardware-Based Solutions -- 16.12 Lessons Learned -- 16.13 Summary -- Further Lookup
Exercises -- Part V: Toward Next Generation Routing -- Chapter 17. Quality of Service Routing -- 17.1 Background -- 17.2 QoS Attributes -- 17.3 Adapting Shortest Path and Widest Path Routing: A Basic Framework -- 17.4 Update Frequency, Information Inaccuracy, and Impact on Routing -- 17.5 Lessons from Dynamic Call Routing in the Telephone Network -- 17.6 Heterogeneous Service, Single-Link Case -- 17.7 A General Framework for Source-Based QoS Routing with Path Caching -- 17.8 Routing Protocols for QoS Routing -- 17.9 Summary -- Further Lookup -- Exercises -- Chapter 18. MPLS and GMPLS -- 18.1 Background -- 18.2 Traffic Engineering Extension to Routing Protocols -- 18.3 Multiprotocol Label Switching -- 18.4 Generalized MPLS -- 18.5 MPLS Virtual Private Networks -- 18.6 Summary -- Further Lookup -- Exercises -- Chapter 19. Routing and Traffic Engineering with MPLS -- 19.1 Traffic Engineering of IP/MPLS Networks -- 19.2 VPN Traffic Engineering -- 19.3 Routing/Traffic Engineering for Voice Over MPLS -- 19.4 Summary -- Further Lookup -- Exercises -- Chapter 20. VoIP Routing: Interoperability Through IP and PSTN -- 20.1 Background -- 20.2 PSTN Call Routing Using the Internet -- 20.3 PSTN Call Routing: Managed IP Approach -- 20.4 IP-PSTN Interworking for VoIP -- 20.5 IP Multimedia Subsystem -- 20.6 Multiple Heterogeneous Providers Environment -- 20.7 All-IP Environment of VoIP Services -- 20.8 Addressing Revisited -- 20.9 Summary -- Further Lookup -- Exercises -- Appendix A: Notations, Conventions, and Symbols -- A.1 On Notations and Conventions -- A.2 Symbols -- Appendix B: Miscellaneous Topics -- B.1 Functions: Logarithm and Modulo -- B.2 Fixed-Point Equation -- B.3 Computational Complexity -- B.4 Equivalence Classes -- B.5 Using CPLEX -- B.6 Exponential Weighted Moving Average -- B.7 Nonlinear Regression Fit
Exercises -- Part II: Routing in IP Networks -- Chapter 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 LSAs -- 6.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 -- Exercises -- Chapter 8. BGP -- 8.1 BGP: A Brief Overview -- 8.2 BGP: Basic Terminology -- 8.3 BGP Operations -- 8.4 BGP Configuration Initialization -- 8.5 Two Faces of BGP: External BGP and Internal BGP -- 8.6 Path Attributes -- 8.7 BGP Decision Process -- 8.8 Internal BGP Scalability -- 8.9 Route Flap Dampening -- 8.10 BGP Additional Features -- 8.11 Finite State Machine of a BGP Connection -- 8.12 Protocol Message Format -- 8.13 Summary -- Further Lookup -- Exercises -- Chapter 9. Internet Routing Architectures -- 9.1 Internet Routing Evolution
B.8 Computing Probability of Path Blocking or Loss
9.2 Addressing and Routing: Illustrations -- 9.3 Current Architectural View of the Internet -- 9.4 Allocation of IP Prefixes and AS Number -- 9.5 Policy-Based Routing -- 9.6 Point of Presence -- 9.7 Traffic Engineering Implications -- 9.8 Internet Routing Instability -- 9.9 Summary -- Further Lookup -- Exercises -- Part III: Routing in the PSTN -- Chapter 10. Hierarchical and Dynamic Call Routing in the Telephone Network -- 10.1 Hierarchical Routing -- 10.2 The Road to Dynamic Routing -- 10.3 Dynamic Nonhierarchical Routing -- 10.4 Dynamically Controlled Routing -- 10.5 Dynamic Alternate Routing -- 10.6 Real-Time Network Routing -- 10.7 Classification of Dynamic Call Routing Schemes -- 10.8 Maximum Allowable Residual Capacity Routing -- 10.9 Dynamic Routing and Its Relation to Other Routing -- 10.10 Summary -- Further Lookup -- Exercises -- Chapter 11. Traffic Engineering in the Voice Telephone Network -- 11.1 Why Traffic Engineering? -- 11.2 Traffic Load and Blocking -- 11.3 Grade-of-Service and Trunk Occupancy -- 11.4 Centi-Call Seconds and Determining Offered Load -- 11.5 Economic CCS Method -- 11.6 Network Controls for Traffic Engineering -- 11.7 State-Dependent Call Routing -- 11.8 Analysis of Dynamic Routing -- 11.9 Summary -- Further Lookup -- Exercises -- Chapter 12. SS7: Signaling Network for Telephony -- 12.1 Why SS7? -- 12.2 SS7 Network Topology -- 12.3 Routing in the SS7 Network -- 12.4 Point Codes: Addressing in SS7 -- 12.5 Point Code Usage -- 12.6 SS7 Protocol Stack -- 12.7 SS7 Network Management -- 12.8 ISUP and Call Processing -- 12.9 ISUP Messages and Trunk Management -- 12.10 ISUP Messages and Dynamic Call Routing -- 12.11 Transaction Services -- 12.12 SS7 Link Traffic Engineering -- 12.13 Summary -- Further Lookup -- Exercises -- Chapter 13. Public Switched Telephone Network: Architecture and Routing
Title Network routing : algorithms, protocols, and architectures
URI https://cir.nii.ac.jp/crid/1130282270524220416
https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=291644
https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9780080474977&uid=none
WOSCitedRecordID wos(Sirsi) u800844&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Nb9MwFLdY4UBP40sUNogQNxaRDztxdqNTAQk2EBpot8hxXmi0NUVNO43_np9dJ-u6A-LAxWrcxGn9s_2-32PstaYsUHGZ-Ry8vc9Fxn1JQelTVMUiIUqr0AYKf05PTuTZWfbVFYZsbTmBtGnk1VX2679CjT6AbUJn_wHuflB04DNARwvY0W5xxP1ll4HJenS_WcxX1pfZxjFf_JxD_J-uFSomKcMcyLedz-amGaFnro-pnK7Dzwm0qjlXvf_uNzVTrZr9dlFky2mNI8Atr05zkG5pDo5t3Sjcvqpmqmk2_PBNLXV8U8-MbtE6JHThLzekTxN3K6WQ61zWt87itVpgbFP4dnf6psvUYIj9rQTYlqSO30ljCMXBs8N20gTC9N0Pky_fP_VaMzC3GVhImxvJDRm7NEr9j3H-WsaLb_vlb92rh2yo2nNQEVCYZQu2oqnrW8TYchinu2xgok4esDvUPGTDjSyRj9ihA9ZzwHqH3jWsB14P6oEHSL0bkD5mP95PTo8--q7kha-MdiDwQ-woQZmWgU40RAqZVIKKREdUCq6rgigm0lGpk0AlBf6t4CTCwtSGFLGQKn7CBs28oafMw-4sLQ-mMoIUXxRREZZhhF0rjfU4GLFXG5OQX15Y83ybm8mEHMFTDtlgxPYxN7muTRsaKzc4yjQQ4OyiAEiM2Mtu1nL7vPMpzifjowiiB-fP_jLCc3b_enHuscFysaJ9dk9fLut28cItgD-cfUtc
linkProvider ProQuest Ebooks
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Network+routing+%3A+algorithms%2C+protocols%2C+and+architectures&rft.au=Medhi%2C+Deepankar&rft.au=Ramasamy%2C+Karthikeyan&rft.date=2007-01-01&rft.pub=Morgan+Kaufmann+Publishers+is+an+imprint+of+Elsevier&rft.isbn=9780120885886&rft_id=info:doi/10.1016%2FB978-012088588-6%2F50003-6&rft.externalDocID=BA82784030
thumbnail_m http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97800804%2F9780080474977.jpg