Articles liés à Routing Algorithms In Survivable Telecommunication...

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

Tapolcai, János

 
9783838392974: Routing Algorithms In Survivable Telecommunication Networks: PhD Thesis of Budapest University of Technology and Economics
Couverture souple
ISBN 10 : 3838392973 ISBN 13 : 9783838392974
Editeur : LAP LAMBERT Academic Publishing, 2010

Synopsis

The aim of the dissertation is to present effective routing algorithms in survivable mesh communication networks that meet several Quality-of-Service requirements. 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 of different distributed architectures. All the algorithms and solutions are designed for the switches of the future survivable mesh telecommunication networks considering QoS requirements. Most of the simulation tools and heuristic algorithms used in the dissertation are part of the lemon- routing package and available on-line. The obtained results are supported by 8 journal papers and 18 conference presentations.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

The aim of the dissertation is to present effective routing algorithms in survivable mesh communication networks that meet several Quality-of-Service requirements. 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 of different distributed architectures. All the algorithms and solutions are designed for the switches of the future survivable mesh telecommunication networks considering QoS requirements. Most of the simulation tools and heuristic algorithms used in the dissertation are part of the lemon- routing package and available on-line. The obtained results are supported by 8 journal papers and 18 conference presentations.

Biographie de l'auteur

János Tapolcai received his M.Sc. ('00 in Technical Informatics), and Ph.D. ('05 in Computer Science) degrees in Technical Informatics from Budapest University of Technology and Economics (BME), Budapest, Hungary. Currently he is an Associate Professor at the Department of Telecommunications and Media Informatics at BME.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
LAP LAMBERT Academic Publishing
Date d'édition
2010
Langue
anglais
ISBN 10 
3838392973
ISBN 13 
9783838392974
Reliure
Broché
Nombre de pages
136
Coordonnées du fabricant
non disponible
Personne responsable
KreGa Onlinehandel GmbH
4950000000000
info@krega-onlinehandel.de

Birkenweg 31
Brakel
33034
Allemagne