| 1. |
- Bley, A, et al.
(författare)
-
Optimization of OSPF routing in IP networks
- 2009
-
Ingår i: Graphs and algorithms in communication networks – studies in broadband, optical, wireless, and Ad Hoc networks. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 9783642022494 ; , s. 199-240
-
Bokkapitel (refereegranskat)abstract
- 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 .
|
|
| 2. |
- Bosio, Sandro, et al.
(författare)
-
Mathematical optimization models for WLAN planning
- 2009. - 1
-
Ingår i: Graphs and Algorithms in Communication Networks. - Berlin : Springer. - 9783642022494 - 3642022499 ; , s. 454-
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
- Algorithmic discrete mathematics plays a key role in the development of information and communication technologies, and methods that arise in computer science, mathematics and operations research – in particular in algorithms, computational complexity, distributed computing and optimization – are vital to modern services such as mobile telephony, online banking and VoIP. This book examines communication networking from a mathematical viewpoint. The contributing authors took part in the European COST action 293 – a four-year program of multidisciplinary research on this subject. In this book they offer introductory overviews and state-of-the-art assessments of current and future research in the fields of broadband, optical, wireless and ad hoc networks. Particular topics of interest are design, optimization, robustness and energy consumption. The book will be of interest to graduate students, researchers and practitioners in the areas of networking, theoretical computer science, operations research, distributed computing and mathematics.
|
|
| 3. |
- Holmberg, Kaj, 1955-
(författare)
-
Optimization of OSPF Routing in IP Networks
- 2010
-
Ingår i: Graphs and Algorithms in Communication Networks. - : Springer Berlin/Heidelberg. - 9783642022494 - 36 4202 249 9
-
Bokkapitel (refereegranskat)abstract
- Algorithmic discrete mathematics plays a key role in the development of information and communication technologies, and methods that arise in computer science, mathematics and operations research – in particular in algorithms, computational complexity, distributed computing and optimization – are vital to modern services such as mobile telephony, online banking and VoIP. This book examines communication networking from a mathematical viewpoint. The contributing authors took part in the European COST action 293 – a four-year program of multidisciplinary research on this subject. In this book they offer introductory overviews and state-of-the-art assessments of current and future research in the fields of broadband, optical, wireless and ad hoc networks. Particular topics of interest are design, optimization, robustness and energy consumption. The book will be of interest to graduate students, researchers and practitioners in the areas of networking, theoretical computer science, operations research, distributed computing and mathematics.
|
|
| 4. |
- Klinkowski, M, et al.
(författare)
-
Routing optimization in optical burst switching networks: a multi-path routing approach
- 2009
-
Ingår i: Graphs and algorithms in communication networks – studies in broadband, optical, wireless, and Ad Hoc networks. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 9783642022494 ; , s. 163-178
-
Bokkapitel (refereegranskat)abstract
- This chapter concerns routing optimization in optical burst switching (OBS) networks. OBS is a photonic network technology aiming at efficient transport of IP traffic. OBS architectures are in general bufferless and therefore sensitive to burst congestion. An overall burst loss probability (BLP) which adequately represents the congestion state of the entire network is the primary metric of interest in an OBS network. The network congestion can be reduced by using proper routing. We consider multi-path source routing and aim at optimal distribution of traffic over the network. In this context, we study three network loss models, a well-known loss model of an OBS network and two original approximate models. Since the objective function of each model is nonlinear, either linear programming formulations with piecewise linear approximations of this function or nonlinear optimization gradient methods can be used. The presented solution is based on nonlinear optimization; for this purpose we provide the formulas for calculation of partial derivatives. The main goal of this chapter is to show that the use of approximate models allows us to speed up significantly the optimization procedure without losing much accuracy. Moreover we show that our method effectively distributes the traffic over the network, and the overall BLP can be reduced compared with both shortest path routing and alternative routing.
|
|
