Telecommunication networks: protocols, modeling and analysis
Telecommunication networks: protocols, modeling and analysis
Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation
QoS routing in networks with inaccurate information: theory and algorithms
IEEE/ACM Transactions on Networking (TON)
QoS swarm state dependent routing for irregular traffic in telecommunication networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A Scalable QoS-based inter-domain routing scheme in a high speed wide area network
Computer Communications
The effect of network hierarchy structure on performance of ATM PNNI hierarchical routing
Computer Communications
| Hi-index | 0.00 |
Routing a message in a network is efficient (in terms of weight of the path used to carry the message) when nodes know the full topology of the network. This may not be the case in large networks since a network may be composed of smaller autonomous pieces by design or by requirements on performance, with each piece having less than complete information about other pieces. We present a trade-off between the amount of topology information exchanged among these pieces and the efficiency of routing in the network. The large network that we study is a collection of networks connected by boundary nodes. Each boundary node knows the topology of its network and the connectivity of networks to each other. The question addressed here is how much topology information about each network should be distributed to other networks in order to achieve reasonably efficient routing.