A distributed algorithm for inter-domain resources provisioning

Weisser, Marc-Antoine; Tomasik, Joanna

doi:10.1109/ngi.2006.1678217

Cited by 1 publication

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Packets are divided into classes and the priority traffic, packets of the most privileged class, is treated with priority. In [1] we proposed an algorithm founded on the flow-based paradigm which finds multi-constraint paths in an inter-domain network. In this paper we focus on the second approach.…”

Section: Introductionmentioning

confidence: 99%

Congestion Avoiding Mechanism Based on Inter-domain Hierarchy

Weisser

Tomasik

Barth

2008

NETWORKING 2008 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 99%