2013
DOI: 10.1016/j.comnet.2013.08.010
|View full text |Cite
|
Sign up to set email alerts
|

Potential based routing as a secondary best-effort routing for Information Centric Networking (ICN)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 21 publications
(8 citation statements)
references
References 15 publications
0
8
0
Order By: Relevance
“…Since forwarding planes can adapt short-term changes, control planes in NDN can be more focused on long-term changes occurring in a network [7]. Therefore, new unconventional but effective routing algorithms can be applied [6,[8][9][10][11][12].…”
Section: Routing In Named Data Networkingmentioning
confidence: 99%
“…Since forwarding planes can adapt short-term changes, control planes in NDN can be more focused on long-term changes occurring in a network [7]. Therefore, new unconventional but effective routing algorithms can be applied [6,[8][9][10][11][12].…”
Section: Routing In Named Data Networkingmentioning
confidence: 99%
“…On the other hand, each ICN node with a copy of data object floods the advertisement message periodically (soft state) within limited area so that it adaptively changes the scope of advertisement depending on its capability or willingness to server user requests, e.g., a high capacity node may create large numbers of potential fields which have large advertisement scope to serve more user requests. The control overhead issue of the PBR in terms of soft and hard state mechanisms is evaluated in our previous work [17].…”
Section: Routingmentioning
confidence: 99%
“…12,13 The CCN architecture 5,[14][15][16][17][18][19] decouples the content from the location and works like a virtual content distributor all over the network. Ant colony-based routing [20][21][22] restricts the Interest Packet dissemination and content distribution, but the overhead and the complexity of the algorithm are high due to the collection of global information. Several proxy-based approaches 23,24 were proposed to provide seamless connectivity toward the content when the end users are mobile and change its location frequently.…”
Section: Related Workmentioning
confidence: 99%