GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference 2009
DOI: 10.1109/glocom.2009.5426099
|View full text |Cite
|
Sign up to set email alerts
|

Scalable Multi-Region Routing at Inter-Domain Level

Abstract: DTIA (DynamicTopological Information Architecture), an inter-domain routing architecture, assumed the existence of "regions of domains" to offer a scalable solution for the Internet. The way regions can be connected and how traffic flow amongst them is not a trivial aspect and can jeopardize the solution proposed for intra-region traffic. This paper covers the inter-region case showing that it can be performed by using a smaller set of valid paths than for the intra-region case in the source region, but still … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2011
2011
2014
2014

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 13 publications
0
3
0
Order By: Relevance
“…This solution might not scale at the inter-domain level and an alternative is to consider that the map is in a centralized location and is distributed to the nodes. In [22] [23] [17] we describe a possible architecture that could serve as base to implement the routing algorithm described in this work. If we consider implementing the iteration with the BellmanFord algorithm, then a vectoring protocol can be developed to implement the model and the network graph can be found in a distributed manner.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…This solution might not scale at the inter-domain level and an alternative is to consider that the map is in a centralized location and is distributed to the nodes. In [22] [23] [17] we describe a possible architecture that could serve as base to implement the routing algorithm described in this work. If we consider implementing the iteration with the BellmanFord algorithm, then a vectoring protocol can be developed to implement the model and the network graph can be found in a distributed manner.…”
Section: Methodsmentioning
confidence: 99%
“…All concerns analysed at the beginning of the paper are covered: multihoming is exploited in the creation/definition of multiple paths; multiple paths provide a base for better failure handling; scalability is dealt by creating an algebraic model that is amenable to the definition of regions to partition the network [17]; and policies are related with link/path weights and how they are calculated and ranked. Our model comprises the common policies and some other interesting relations not being disruptive in relation to the current business model in the Internet.…”
Section: Routing Algorithmmentioning
confidence: 99%
“…DTIA [3] proposes to use regional routing to improve the scalability of inter-domain routing. Different from DTIA, RMI presents a new method to deal with the inter-region routing in which a route is composed of different portions.…”
Section: Related Workmentioning
confidence: 99%