Novel Cooperative and Fully-Distributed Congestion Control Mechanism for Content Centric Networking
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ndikumana, Anselme | - |
dc.contributor.author | Ullah, Saeed | - |
dc.contributor.author | Thar, Kyi | - |
dc.contributor.author | Tran, Nguyen H. | - |
dc.contributor.author | Park, Bang Ju | - |
dc.contributor.author | Hong, Choong Seon | - |
dc.date.available | 2020-02-27T23:42:01Z | - |
dc.date.created | 2020-02-07 | - |
dc.date.issued | 2017 | - |
dc.identifier.issn | 2169-3536 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/7503 | - |
dc.description.abstract | The router's buffer accommodates transient packets to guarantee that the network's links do not become idle. However, buffer overflow causes packet loss, which is a signal of congestion. In content centric networking (CCN), the interest packet, which is used for requesting content, may be dropped due to such congestion. Each interest packet is assigned a specific lifetime, and when the lifetime expires without obtaining the requested content, the consumer needs to resend the Interest. However, waiting for the expiration of an Interest's lifetime for retransmission is only appropriate for best effort traffic rather than services that are delay sensitive. In order to provide delay-sensitive applications with better quality of service, we propose a congestion control mechanism for CCN, in which, we prevent congestion before it happens through monitoring buffer size. Upon reaching the buffer threshold, the node notifies its downstream node. On receiving the notification, the downstream node adjusts traffic rate by allocating new incoming Interests to other face(s). However, when the downstream node fails to reduce traffic rate, the same procedure continues until the consumer node reduces sending rate. The simulation results show that the proposed mechanism is capable of significant performance improvements, with higher throughput. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.relation.isPartOf | IEEE ACCESS | - |
dc.subject | INFORMATION | - |
dc.subject | PROTOCOL | - |
dc.title | Novel Cooperative and Fully-Distributed Congestion Control Mechanism for Content Centric Networking | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.description.journalClass | 1 | - |
dc.identifier.wosid | 000418881100137 | - |
dc.identifier.doi | 10.1109/ACCESS.2017.2778339 | - |
dc.identifier.bibliographicCitation | IEEE ACCESS, v.5, pp.27691 - 27706 | - |
dc.identifier.scopusid | 2-s2.0-85037651100 | - |
dc.citation.endPage | 27706 | - |
dc.citation.startPage | 27691 | - |
dc.citation.title | IEEE ACCESS | - |
dc.citation.volume | 5 | - |
dc.contributor.affiliatedAuthor | Park, Bang Ju | - |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | Content centric networking (CCN) | - |
dc.subject.keywordAuthor | congestion control mechanism | - |
dc.subject.keywordAuthor | cooperative and memory-efficient token bucket (CMTB) | - |
dc.subject.keywordAuthor | fully-distributed congestion control (FDCC) | - |
dc.subject.keywordAuthor | reduce sending rate (RSR) | - |
dc.subject.keywordPlus | INFORMATION | - |
dc.subject.keywordPlus | PROTOCOL | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
1342, Seongnam-daero, Sujeong-gu, Seongnam-si, Gyeonggi-do, Republic of Korea(13120)031-750-5114
COPYRIGHT 2020 Gachon University All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.