2010
DOI: 10.1007/978-3-642-11476-2_20
View full text |Buy / Rent full text
|
Sign up to set email alerts
|

Abstract: Efficient algorithms for computing routing tables should take advantage of the particular properties arising in large scale networks. Two of them are of particular interest: low (logarithmic) diameter and high clustering coefficient. High clustering coefficient implies the existence of few large induced cycles. Considering this fact, we propose here a routing scheme that computes short routes in the class of kchordal graphs, i.e., graphs with no induced cycles of length more than k. In the class of k-chordal g… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 24 publications
(22 reference statements)
0
2
0
Order By: Relevance
“…Proposition 12. [31] For any k ≤ 2, G k is proper 3-thin, but in every interval representation of it, if I j is the interval corresponding to v j , it holds Proof. Consider the ordering a 1 , .…”
Section: Thus Pthin(clawmentioning
confidence: 99%
“…Several models can be easly developed and integrated with their own metric model for performance measurement. The provided set of models includes BGP, the Routing Information Protocol (RIP), and compact routing schemes such as NSR [4] and AGMNT [1].…”
Section: State Of the Artmentioning
confidence: 99%