Adaptive interest adjustment in CCN flow control

Byun, Dojun; Lee, Byoung-Joon; Park, Yongseok

doi:10.1109/glocom.2014.7037081

Cited by 5 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Neural network algorithms are also proposed to control congestion explicitly. 41,42 Byun et al 43 proposed an adaptive Interest management scheme that is achieved by maintaining a balance in Interest forwarding according the link capacity. Only some specific numbers of Interests are forwarded, which can easily be accommodated in capacity without triggering congestion.…”

Section: Literature Reviewmentioning

confidence: 99%

Fuzzy Logic‐based Efficient Interest Forwarding (FLEIF) in Named Data Networking

Qureshi

Shah

Hasan

et al. 2019

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Content centric or Named Data Networking (NDN) is expected to replace IP‐based communication in the future Internet architecture. Here, connections are established based on data instead of host addresses. This flexibility helps in decreasing the end‐to‐end delay, as the requested data may be available in any intermediate router's cache. In NDN, a small Interest packet sent on a link results in large sized incoming Data packets on the same link. Therefore, sending multiple Interest packets on a single outgoing face may cause congestion on the returning path. Hence, regulation of Interest packets based on link characteristics is important to avoid congestion. In this paper, an intelligent mechanism based on Neuro‐Fuzzy Logic is proposed for calculating outgoing link prices of each intermediate node. The class of each outgoing link on a router is determined for Interest forwarding in order to avoid congestion. Comparison results show that the proposed method effectively improves throughput by decreasing packet loss ratio.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Fuzzy Logic‐based Efficient Interest Forwarding (FLEIF) in Named Data Networking

Qureshi

Shah

Hasan

et al. 2019

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…To achieve these goals, we formulate a game theory-based optimization framework for the congestion control problem in NDN environment with the constraints imposed on both Interests and data traffic in both uplink and downlink directions. The rationale for considering the interdependence between Interests and contents is that both Interests and contents contribute to congestion [2,20]. By decomposing the Lagrange function of the primal problem, we get the explicit expression of the dual problem.…”

Section: Introductionmentioning

confidence: 99%

A Game Theoretic Framework for Congestion Control in Named Data Networking

Yao

Yin

Tan

et al. 2017

ITC

View full text Add to dashboard Cite

As an essential building block of the Named Data Networking (NDN) architecture, congestion mechanism has been the focus of much attention. The unique features of NDN architecture bring forward distinct requirements for congestion control from its Internet Protocol (IP) counterpart. In this paper, we present a game theoretic framework for flow rate control in NDN based on the concept of Nash bargaining solution from cooperative game theory, and propose a distributed flow-aware hop-by-hop congestion control mechanism on a solid analytical basis. In addition, we developed a possible implementation in the ndnSIM simulator and performed extensive simulations and performance evaluations to study the behavior of our scheme. We have seen that the proposed congestion control mechanism performs as designed, and significantly enhances the network performance.

show abstract

“…Like TCP flow control and the sliding window, several flow control mechanisms have been recently proposed for improving the content forwarding performance in CCN [24,25]. For example, requesters can send several Interest packets without waiting corresponding segments or a publisher can transmit several segments when he/she receives an Interest packet.…”

Section: Consideration Of Transmission Flowmentioning

confidence: 99%

TLDA: An Efficient Two-Layered Data Authentication Mechanism for Content-Centric Networking

Seo

Youn

2018

Security and Communication Networks

View full text Add to dashboard Cite

Content-Centric Networking (CCN) is a new networking paradigm for the future Internet, which shifts the communication paradigm from host-centric to data-centric. In CCN, contents are routed by their unique names and they are stored in network nodes by units of segment during transmission for future usage. Since contents are stored in network nodes in a distributed manner, security is built into CCN data packets by embedding a public key signature to enable any content requesters to verify authenticity and integrity of contents. However, the use of public key signatures for authenticating CCN data packets incurs significant overhead regarding computation and communication, which limits universal utilization of CCN. Furthermore, this can lead to a new kind of DDoS attacks. Even though CCN adopts an aggregate signature method based on Merkle Hash Tree (MHT) in its reference implementation, it still incurs large amount of overhead. This paper presents TLDA, an efficient Two-Layered Data Authentication mechanism, which can considerably reduce overhead of computation and communication for authenticating data segments in CCN. For efficiency of computation and communication, TLDA newly introduces the concept of authentication Meta part consisting of data segments' hash values. To a great extent TLDA not only reduces the computation and communication overhead compared with CCN's basic authentication method, but also provides robustness against transmission loss and out-of-order transmission.We have implemented TLDA and demonstrated that it provides 74.3% improved throughput and 36.557% reduced communication overhead compared to those of the original CCNx library developed by PARC when transmitting a 128Mbyte content in units of 1Kbyte segment with RSA-2048 and SHA-256 as its signature algorithm and hash algorithm, respectively.

show abstract

Adaptive interest adjustment in CCN flow control

Cited by 5 publications

References 8 publications

Fuzzy Logic‐based Efficient Interest Forwarding (FLEIF) in Named Data Networking

Fuzzy Logic‐based Efficient Interest Forwarding (FLEIF) in Named Data Networking

A Game Theoretic Framework for Congestion Control in Named Data Networking

TLDA: An Efficient Two-Layered Data Authentication Mechanism for Content-Centric Networking

Contact Info

Product

Resources

About