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.
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 136 pp. Englisch. Seller Inventory # 9783838392974
Quantity: 2 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 136. Seller Inventory # 26128828945
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 136 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam. Seller Inventory # 131758542
Quantity: 4 available
Seller: moluna, Greven, Germany
Condition: New. Seller Inventory # 5419527
Quantity: Over 20 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 136. Seller Inventory # 18128828955
Quantity: 4 available
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 136 pp. Englisch. Seller Inventory # 9783838392974
Quantity: 1 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Seller Inventory # 9783838392974
Quantity: 1 available
Seller: preigu, Osnabrück, Germany
Taschenbuch. Condition: Neu. Routing Algorithms In Survivable Telecommunication Networks | PhD Thesis of Budapest University of Technology and Economics | János Tapolcai | Taschenbuch | 136 S. | Englisch | 2010 | LAP LAMBERT Academic Publishing | EAN 9783838392974 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Seller Inventory # 107412702
Quantity: 5 available