Routing policies in named data networking

DiBenedetto, Steven; Papadopoulos, Christos; Massey, Daniel

doi:10.1145/2018584.2018595

Cited by 51 publications

(26 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[15]). Having hundreds of millions of routers implementing routing policies naturally raises scalability concerns; the proposals on content-centric networking with routers implementing policies per content [17] will only aggravate the problem.…”

Section: Related Workmentioning

confidence: 99%

On the Scalability of Routing With Policies

Gulyás

Rétvári

Heszberger

et al. 2015

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-Today's ever-growing networks call for routing schemes with sound theoretical scalability guarantees. In this context, a routing scheme is scalable if the amount of memory needed to implement it grows significantly slower than the network size. Unfortunately, theoretical scalability characterizations only exist for shortest path routing, but for general policy routing that current and future networks increasingly rely on, very little understanding is available. In this paper, we attempt to fill this gap. We define a general framework for policy routing, and we study the theoretical scaling properties of three fundamental policy models within this framework. Our most important contributions are the finding that, contrary to shortest path routing, there exist policies that inherently scale well, and a separation between the class of policies that admit compact routing tables and those that do not. Finally, we ask to what extent memory size can be decreased by allowing paths to contain a certain bounded number of policy violations and, surprisingly, we conclude that most unscalable policies remain unscalable under the relaxed model as well.

show abstract

Section: Related Workmentioning

confidence: 99%

On the Scalability of Routing With Policies

Gulyás

Rétvári

Heszberger

et al. 2015

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…This policy was also adopted in several studies (e.g. [6], [9]), and it mainly aims to minimize the network traffic that crosses other domains because the transit cost is commonly charged according to the traffic volume [19]. In the following, we describe how the CC implements the aforementioned two decisions accordingly:…”

Section: A Caching-related Decisionsmentioning

confidence: 99%

CoMon: An architecture for coordinated caching and cache-aware routing in CCN

Salah

Strufe

2015

2015 12th Annual IEEE Consumer Communications and Networking Conference (CCNC)

View full text Add to dashboard Cite

The autonomous cache management in ContentCentric Networking (CCN) results in suboptimal caching decisions and implies cache-ignorant routing. Cache coordination and similar improvements hence have been the subject of several recent studies. The proposed solutions, however, are either impractical due to their massive coordination overhead, or of limited benefit since they cannot realize perfect coordination.We present CoMon, an architecture for network-wide coordinated caching. CoMon realizes an affordable, yet highly effective, coordination by assigning monitoring and cache-aware (re)routing tasks to only a few nodes, through which the majority of traffic is expected or enforced to pass. CoMon, by design, maximizes the diversity of cached contents and reduces cache replacements. In addition, our simulation study using ISP topologies, shows that CoMon under several scenarios, when coordinates through a small ratio of the nodes, reduces the server hit ratio (i.e. the ratio of requests consumed by the origin content providers) of both CCN and notable related work, remarkably.

show abstract

“…One obvious origin of non-aggregatable prefixes is the Internet backbone routing table advertised in CCNcapable BGP [10], because many contents are published under provider-independent prefixes. According to a rough estimate, a full routing table of BGP includes 620 million prefixes, which is the number of web server hostnames as of December 2012 [11].…”

Section: Problems Of Non-aggregatable Prefixesmentioning

confidence: 99%

Efficient Lookup Scheme for Non-aggregatable Name Prefixes and Its Evaluation

Fukushima

Tagami

Hasegawa

2013

IEICE Trans. Commun.

View full text Add to dashboard Cite

SUMMARYContent-Centric Networking (CCN) employs a hierarchical but location independent content naming scheme. While such a location independent naming brings various benefits including efficient content delivery, mobility, and multihoming, location independent name prefixes are hard to aggregate. This poses a serious scaling issue on the efficiency of looking up content names in a huge Forwarding Information Base (FIB) by longest prefix matching, which requires seeking the longest matching prefix through all candidate prefix lengths. We propose a new scheme for efficiently looking up non-aggregatable name prefixes in a large FIB. The proposed scheme is based on the observation that the bottleneck of FIB lookup is the random accesses to the high-latency off-chip DRAM for prefix seeking and this can be reduced by exploiting the information on the longest matching prefix length in the previous hop. Our evaluation results show that the proposed scheme significantly improves FIB lookup latency with a reasonable traffic parameters observed in today's Internet.

show abstract

Routing policies in named data networking

Cited by 51 publications

References 11 publications

On the Scalability of Routing With Policies

On the Scalability of Routing With Policies

CoMon: An architecture for coordinated caching and cache-aware routing in CCN

Efficient Lookup Scheme for Non-aggregatable Name Prefixes and Its Evaluation

Contact Info

Product

Resources

About