Routing in a communication network

作者: Jyrki Akkanen

DOI:

关键词:

摘要: This invention relates to routing in a communication network. In particular, the concerns telecommunication and cellular networks. The idea of is preprocess network order accelerate process. preprocessing comprises finding difficult portions, removing trivial portions from topology. As result these phases divided into small subnetworks. After predetermined endpoints single route are added subnetworks for through that, traffic each subnetwork routed separately. Traffic parts between subnetworks, or may need additional routing.

参考文章(10)
Irene Katzela, Malathi Veeraraghavan, Virtual trees routing protocol for an ATM-based mobile network ,(1996)
Pedja Raspopovic, Ranko Scepanovic, Alexander E. Andreev, Elyar E. Gasanov, Method and apparatus for parallel simultaneous global and detail routing ,(1998)
L. Szymanski, O.W.W. Yang, Spanning tree algorithm for spare network capacity canadian conference on electrical and computer engineering. ,vol. 1, pp. 447- 452 ,(2001) , 10.1109/CCECE.2001.933725
W.C. Lee, Spanning tree method for link state aggregation in large communication networks international conference on computer communications. ,vol. 1, pp. 297- 302 ,(1995) , 10.1109/INFCOM.1995.515888
Ling Li, A.K. Somani, Dynamic wavelength routing using congestion and neighborhood information IEEE ACM Transactions on Networking. ,vol. 7, pp. 779- 786 ,(1999) , 10.1109/90.803390
Cornelis Boer, Johannes Cornelis De Kruif, Method for selecting links in networks ,(1994)
Guy Millet, Vincent Gillet, Method for the reconfiguration of a meshed network ,(1994)
Aline Fichou, Claude Galand, Jean-Paul Chobert, Gérard Brun, Guy Boudeile, Method and system for optimizing the end to end path selection in very large packet switching networks ,(1998)