Application-aware Congestion Avoidance and Control in Content Centric Networking
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Young-Bae Ko | - |
dc.contributor.author | Adem Osman Mohammeds | - |
dc.date.accessioned | 2018-11-08T08:17:59Z | - |
dc.date.available | 2018-11-08T08:17:59Z | - |
dc.date.issued | 2014-02 | - |
dc.identifier.other | 16420 | - |
dc.identifier.uri | https://dspace.ajou.ac.kr/handle/2018.oak/12559 | - |
dc.description | 학위논문(석사)--아주대학교 일반대학원 :컴퓨터공학과,2014. 2 | - |
dc.description.tableofcontents | I.INTRODUCTION II.RELATED WORK II.A Problem Statement II.B Previous Work III.APPLICATION-AWARE CONGESTION AVOIDANCE AND CONTROL IN CONTENT CENTRIC NETWORKING III.A Overview III.B Proposed Scheme III.B.1 Congestion Avoidance III.B.2 Congestion Control IV.PERFORMANCE EVALUATION IV.A Simulation Environment IV.B Simulation Result IV.B.1 Packet loss IV.B.2 Round trip time IV.B.3 Link Utilization V.CONCLUSION | - |
dc.language.iso | eng | - |
dc.publisher | The Graduate School, Ajou University | - |
dc.rights | 아주대학교 논문은 저작권에 의해 보호받습니다. | - |
dc.title | Application-aware Congestion Avoidance and Control in Content Centric Networking | - |
dc.type | Thesis | - |
dc.contributor.affiliation | 아주대학교 일반대학원 | - |
dc.contributor.department | 일반대학원 컴퓨터공학과 | - |
dc.date.awarded | 2014. 2 | - |
dc.description.degree | Master | - |
dc.identifier.localId | 608286 | - |
dc.identifier.url | http://dcoll.ajou.ac.kr:9080/dcollection/jsp/common/DcLoOrgPer.jsp?sItemId=000000016420 | - |
dc.description.alternativeAbstract | In this thesis, we addressed the problem of congestion in content centric networking. Even though the original CCN has some features that regulate flow of traffic using Interest packet aggregation, which protects CCN nodes from Interest flooding attack, it still lacks sophisticated congestion avoidance or control tools. Our work mitigates congestion in two stages. It first monitors the traffic flow level in the network. When intermediate routing nodes of a network detect increasing level of packets and delay of packets, they try to shift traffic load to other alternative and less congested paths. But if congestion occurs despite the monitoring and usage of alternative paths to reduce its probability of happening, the node that is directly affected tackles the congestion problem by taking action on selected flows with less sensitivity to delay and with lower requirement for quality of service. The proposed scheme was implemented using OPNET simulator. It was compared with clean slate CCN and a flow-aware traffic control scheme. The results show that our proposed scheme performs better in terms of Packet loss, RTT and link load. | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.