A 3/2-Approximation Algorithm for the Mixed Postman Problem
SIAM Journal on Discrete Mathematics
On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
HLP: a next generation inter-domain routing protocol
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Computing the types of the relationships between autonomous systems
IEEE/ACM Transactions on Networking (TON)
Automatic induction of inter-domain hierarchy in randomly generated network topologies
SpringSim '07 Proceedings of the 2007 spring simulaiton multiconference - Volume 1
Inter-domain QoS routing on Diffserv networks: a region-based approach
Computer Communications
Efficient micro-mobility with congestion avoiding in two-nodes mobile IP network architecture
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
Hi-index | 0.00 |
Inter-domain routing is ensured by BGP. BGP messages carry no information concerning quality parameters of routes. Our goal is to provide domains with information regarding the congestion state of other domains without any changes in BGP. A domain, which is aware of congested domains, can choose a bypass instead of a route exhibiting possible QoS problems. We propose a distributed mechanism sending alert messages in order to notify domains about other domains congestion state. Our solution avoids flooding the Internet with signaling messages. It limits the number of alerts by taking advantage of the hierarchical structure of the Internet set by P2C and P2P relationships. Our algorithm is heuristic because it is a solution to an NP-complete and inapproximable problem. We prove these properties using the Steiner problem in directed acyclic graphs. The simulation runs show that our mechanism significantly diminishes the number of unavailable domains and routes compared to those obtained with "pure" BGP routing and with a theoretical centralised mechanism.