id:"swepub:oai:lup.lub.lu.se:6a38e147-5ccf-4344-84ab-b199c77331ac"
Search: id:"swepub:oai:lup.lub.lu.se:6a38e147-5ccf-4344-84ab-b199c77331ac" > Optimization of OSP...
- 1 of 1
- Previous record
- Next record
- To hitlist
- Bley, A (author)
Optimization of OSPF routing in IP networks
- Article/chapterEnglish2009
Publisher, publication year, extent ...
- 2009-11-09
- Berlin, Heidelberg :Springer Berlin Heidelberg,2009
Numbers
- LIBRIS-ID:oai:lup.lub.lu.se:6a38e147-5ccf-4344-84ab-b199c77331ac
- https://lup.lub.lu.se/record/1360525URI
- https://doi.org/10.1007/978-3-642-02250-0_8DOI
Supplementary language notes
- Language:English
- Summary in:English
Part of subdatabase
- SwePubSwePub
Classification
Notes
- The Internet is a huge world-wide packet switching network comprised of more than 13,000 distinct subnetworks, referred to as Autonomous Systems (ASs) . They all rely on the Internet Protocol (IP) for transport of packets across the network. And most of them use shortest path routing protocols , such as OSPF or IS-IS, to control the routing of IP packets within an AS. The idea of the routing is extremely simple — every packet is forwarded on IP links along the shortest route between its source and destination nodes of the AS. The AS network administrator can manage the routing of packets in the AS by supplying the so-called administrative weights of IP links, which specify the link lengths that are used by the routing protocols for their shortest path computations. The main advantage of the shortest path routing policy is its simplicity, allowing for little administrative overhead. From the network engineering perspective, however, shortest path routing can pose problems in achieving satisfactory traffic handling efficiency. As all routing paths depend on the same routing metric , it is not possible to configure the routing paths for the communication demands between different pairs of nodes explicitly or individually; the routing can be controlled only indirectly and only as a whole by modifying the routing metric. Thus, one of the main tasks when planning such networks is to find administrative link weights that induce a globally efficient traffic routing configuration of an AS. It turns out that this task leads to very difficult mathematical optimization problems. In this chapter, we discuss and describe exact integer programming models and solution approaches as well as practically efficient smart heuristics for such shortest path routing problems .
Subject headings and genre
- TEKNIK OCH TEKNOLOGIER Elektroteknik och elektronik hsv//swe
- ENGINEERING AND TECHNOLOGY Electrical Engineering, Electronic Engineering, Information Engineering hsv//eng
- OSPF
- the Internet
- telecommunication networks
- shortest path routing
- ECMP
- integer linear programming
- heuristics
Added entries (persons, corporate bodies, meetings, titles ...)
- Fortz, B (author)
- Gourdin, E (author)
- Holmberg, K (author)
- Klopfenstein, O (author)
- Pioro, MichalLund University,Lunds universitet,Institutionen för elektro- och informationsteknik,Institutioner vid LTH,Lunds Tekniska Högskola,Department of Electrical and Information Technology,Departments at LTH,Faculty of Engineering, LTH(Swepub:lu)tts-mpi (author)
- Tomaszewski, A (author)
- Ümit, H (author)
- Koster, A (editor)
- Muñoz, X (editor)
- Institutionen för elektro- och informationsteknikInstitutioner vid LTH (creator_code:org_t)
Related titles
- In:Graphs and algorithms in communication networks – studies in broadband, optical, wireless, and Ad Hoc networksBerlin, Heidelberg : Springer Berlin Heidelberg, s. 199-2409783642022494
Internet link
Find in a library
- Graphs and algorithms in communication networks – studies in broadband, optical,... (Search for host publication in LIBRIS)
To the university's database
- 1 of 1
- Previous record
- Next record
- To hitlist
Find more in SwePub
- By the author/editor
- Bley, A
- Fortz, B
- Gourdin, E
- Holmberg, K
- Klopfenstein, O
- Pioro, Michal
- show more...
- Tomaszewski, A
- Ümit, H
- Koster, A
- Muñoz, X
- show less...
- About the subject
-
- ENGINEERING AND TECHNOLOGY
- ENGINEERING AND ...
- and Electrical Engin ...
- Articles in the publication
- Graphs and algor ...
- By the university
- Lund University
Search outside SwePub
- Extend your search to:
- Google Book Search
- Google Scholar
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
- Copyright © LIBRIS - National Library Systems
- LIBRIS.kb.se
