Routing Algorithms In Survivable Telecommunication Networks

Author: János Tapolcai
Edition:
Binding: Paperback
ISBN: 3838392973

Routing Algorithms In Survivable Telecommunication Networks: PhD Thesis of Budapest University of Technology and Economics

The aim of the dissertation is to present effective routing algorithms in survivable mesh communication networks that meet several Quality-of-Service requirements. Get Routing Algorithms In Survivable Telecommunication Networks computer books for free.
The thesis first investigates shared path protection (SPP) in mesh telecommunication networks. Two novel heuristic algorithms are proposed for SPP based on problem decomposition and linear algebra. Shared Segment Protection (SSP) is the second topic investigated. SSP is formulated as an integer linear program, which can be used to derive the optimal solution for small problem instances. Finally, the thesis presents possible shared protection implementations for networks with distributed control planes. A new algebraic approach is proposed to measure the performance Check Routing Algorithms In Survivable Telecommunication Networks our best computer books for 2013. All books are available in pdf format and downloadable from rapidshare, 4shared, and mediafire.

Routing Algorithms In Survivable Telecommunication Networks Free

The thesis first investigates shared path protection (SPP) in mesh telecommunication networks. Two novel heuristic algorithms are proposed for SPP based on problem decomposition and linear algebra. Shared Segment Protection (SSP) is the second topic investigated. SSP is formulated as an integer linear program, which can be used to derive the optimal solution for small problem instances A new algebraic approach is proposed to measure the performance

Related Computer Books