Adaptive flow control via Interest Aggregation in CCN by Dojun Byun, Byoung-joon, Myeong-Wuk Jang Samsung Electronics, Advanced Institute of Technology.

Slides:



Advertisements
Similar presentations
Quality-of-Service Routing in IP Networks Donna Ghosh, Venkatesh Sarangan, and Raj Acharya IEEE TRANSACTIONS ON MULTIMEDIA JUNE 2001.
Advertisements

Directed Diffusion for Wireless Sensor Networking
Shi Bai, Weiyi Zhang, Guoliang Xue, Jian Tang, and Chonggang Wang University of Minnesota, AT&T Lab, Arizona State University, Syracuse University, NEC.
VSMC MIMO: A Spectral Efficient Scheme for Cooperative Relay in Cognitive Radio Networks 1.
Chabot College Chapter 2 Review Questions Semester IIIELEC Semester III ELEC
Congestion Control Reasons: - too many packets in the network and not enough buffer space S = rate at which packets are generated R = rate at which receivers.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Ranveer Chandra , Kenneth P. Birman Department of Computer Science
Suphakit Awiphan, Takeshi Muto, Yu Wang, Zhou Su, Jiro Katto
Prentice HallHigh Performance TCP/IP Networking, Hassan-Jain Chapter 10 TCP/IP Performance over Asymmetric Networks.
EEC-484/584 Computer Networks Lecture 12 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
Leveraging IP for Sensor Network Deployment Simon Duquennoy, Niklas Wirstrom, Nicolas Tsiftes, Adam Dunkels Swedish Institute of Computer Science Presenter.
EEC-484/584 Computer Networks Lecture 14 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
EEC-484/584 Computer Networks Lecture 12 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
EEC-484/584 Computer Networks Lecture 14 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
Chapter 19 Binding Protocol Addresses (ARP) Chapter 20 IP Datagrams and Datagram Forwarding.
Error Checking continued. Network Layers in Action Each layer in the OSI Model will add header information that pertains to that specific protocol. On.
Gursharan Singh Tatla Transport Layer 16-May
CS-590F - Jitesh R. Nair BREADCRUMB FORWARDING SERVICE A synthesis of PGM and EXPRESS to improve and simplify global IP multicast Authors: Koichi Yano,
CS 218 F 2003 Nov 3 lecture:  Streaming video/audio  Adaptive encoding (eg, layered encoding)  TCP friendliness References: r J. Padhye, V.Firoiu, D.
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
Proxy-assisted Content Sharing Using Content Centric Networking (CCN) for Resource-limited Mobile Consumer Devices Jihoon Lee, Dae Youb Kim IEEE Transactions.
CS An Overlay Routing Scheme For Moving Large Files Su Zhang Kai Xu.
EAIT, February 2006 A Pragmatic Approach towards the Improvement of Performance of Ad Hoc Routing ProtocolsOptimizations To Multipath Routing Protocols.
1 IP Forwarding Relates to Lab 3. Covers the principles of end-to-end datagram delivery in IP networks.
© 2002, Cisco Systems, Inc. All rights reserved..
Higashino Lab. Maximizing User Gain in Multi-flow Multicast Streaming on Overlay Networks Y.Nakamura, H.Yamaguchi and T.Higashino Graduate School of Information.
An Efficient Approach for Content Delivery in Overlay Networks Mohammad Malli Chadi Barakat, Walid Dabbous Planete Project To appear in proceedings of.
Recitation 8 Wireless Networks. Virtual carrier sensing First exchange control frames before transmitting data – Sender issues “Request to Send” (RTS),
Mazumdar Ne X tworking’03 June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN N ETWORKING 1 Non-convex.
Interest NACK Junxiao Shi, Introduction Interest NACK, aka "negative acknowledgement", is sent from upstream to downstream to inform that.
Switching breaks up large collision domains into smaller ones Collision domain is a network segment with two or more devices sharing the same Introduction.
Copyright: S.Krishnamurthy, UCR Power Controlled Medium Access Control in Wireless Networks – The story continues.
Dynamic Source Routing in ad hoc wireless networks Alexander Stojanovic IST Lisabon 1.
Authors: Haowei Yuan, Tian Song, and Patrick Crowley Publisher: ICCCN 2012 Presenter: Chai-Yi Chu Date: 2013/05/22 1.
Review of the literature : DMND:Collecting Data from Mobiles Using Named Data Takashima Daiki Park Lab, Waseda University, Japan 1/15.
COP 4930 Computer Network Projects Summer C 2004 Prof. Roy B. Levow Lecture 3.
Running large scale experimentation on Content-Centric Networking via the Grid’5000 platform Massimo GALLO (Bell Labs, Alcatel - Lucent) Joint work with:
Fault-Tolerant Papers Broadband Network & Mobile Communication Lab Course: Computer Fault-Tolerant Speaker: 邱朝螢 Date: 2004/4/20.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 4 Switching Concepts.
Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols ► Acts as denial of service by disrupting the flow of data between a source and.
Pending Interest Table Sizing in Named Data Networking Luca Muscariello Orange Labs Networks / IRT SystemX G. Carofiglio (Cisco), M. Gallo, D. Perino (Bell.
Authors: Haowei Yuan and Patrick Crowley Publisher: 2013 Proceedings IEEE INFOCOM Presenter: Chia-Yi Chu Date: 2013/08/14 1.
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
SRL: A Bidirectional Abstraction for Unidirectional Ad Hoc Networks. Venugopalan Ramasubramanian Ranveer Chandra Daniel Mosse.
An Adaptive Energy-Efficient and Low- Latency MAC for Data Gathering in Wireless Sensor Networks Gang Lu, Bhaskar Krishnamachari, and Cauligi S. Raghavendra.
Deadline-based Resource Management for Information- Centric Networks Somaya Arianfar, Pasi Sarolahti, Jörg Ott Aalto University, Department of Communications.
Toward a Packet Duplication Control for Opportunistic Routing in WSNs Georgios Z. Papadopoulos, Julien Beaudaux, Antoine Gallais, Periklis Chatzimisios,
On Reducing Mesh Delay for Peer- to-Peer Live Streaming Dongni Ren, Y.-T. Hillman Li, S.-H. Gary Chan Department of Computer Science and Engineering The.
An SSCOP-based Link Layer Protocol for Wireless LANs Haoli Wang and Aravind Velayutham IEEE Global Telecommunications Conference 1-5 December, 2003 San.
Cooperative Mobile Live Streaming Considering Neighbor Reception SPEAKER: BO-YU HUANG ADVISOR: DR. HO-TING WU 2015/10/15 1.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
Video Streaming Transmission Over Multi-channel Multi-path Wireless Mesh Networks Speaker : 吳靖緯 MA0G WiCOM '08. 4th International.
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
Mitigating Congestion in Wireless Sensor Networks Bret Hull, Kyle Jamieson, Hari Balakrishnan MIT Computer Science and Artificial Intelligence Laborartory.
Advanced Science and Technology Letters Vol.54 (Networking and Communication 2014), pp Efficient Duplicate.
2005/12/14 1 Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross-Layer Information Awareness Xin Yu Department of Computer Science.
TCP/IP1 Address Resolution Protocol Internet uses IP address to recognize a computer. But IP address needs to be translated to physical address (NIC).
KAIS T Location-Aided Flooding: An Energy-Efficient Data Dissemination Protocol for Wireless Sensor Networks Harshavardhan Sabbineni and Krishnendu Chakrabarty.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Cooperative Caching in Wireless P2P Networks: Design, Implementation And Evaluation.
In defense of random access
Forwarding and Routing IP Packets
CIS 321 Data Communications & Networking
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
ECE 544 Protocol Design Project 2016
Maximizing MAC Throughputs by Dynamic RTS-CTS Threshold
Hitoshi Asaeda (NICT) Xun Shao (KIT)
Error Checking continued
Presentation transcript:

Adaptive flow control via Interest Aggregation in CCN by Dojun Byun, Byoung-joon, Myeong-Wuk Jang Samsung Electronics, Advanced Institute of Technology IEEE ICC2013-Next-Generation Networking Symposium TUN Tun Oo, Nakazato Lab GITS, Waseda University

Outline Introduction to CCND processing CCNx Pipeline-based flow control A problem with current mechanism Purposed protocol extension Experiment results Conclusion 1/16/ Adaptive flow control via Interest Aggregation in CCN

Interest and Data Message Processing flow in CCND Content Store PIT FIB 1 2a b 3a 3b Interest Data 1.Interest arrives at an CCN node 2. Check CS, if Data exit, it responds to the Interest message else, check its PIT 3.If there is a similar Interest, suppress the newly Interest else, checks its FIB 4.When it found longest prefix matching in FIB, the Interest is finally forwarded to next hop 5.When Data arrives at the CCND, check PIT to obtain the requested Interest entry 6.If one entry is found, send the Data message back 1/16/ Adaptive flow control via Interest Aggregation in CCN

pipeline-based flow control one-to-one Interest/Data Exchange Pipelining Interest message to improve under-utilization 1/16/20144 Adaptive flow control via Interest Aggregation in CCN

Congested uplink in asymmetric link In the asymmetric link such as cellular network – Uplink usage will become heavier in social network – Uplink are probable to be congested Congested uplink cause the slower request rate – Result in under-utilization of Data transmission link 1/16/ Adaptive flow control via Interest Aggregation in CCN

Proposed enhancement solution – Objective: To deliver multiple Data message requests with only one Interest message – Proposal Embedding range of segments being requested in the Interest packet header Modifying CCND to check its cache using range field Populating PIT entries with segments range that are not in cache Forwarding Interest that are not in the cache and not forwarded yet Content sender responds as specified by the range field 1/16/ Adaptive flow control via Interest Aggregation in CCN

Interest Header Extension Single range field – Range is specified by start segment and end segment Multiple range field Multiple range field are used to request selectively Single rangeMultiple Range 1/16/ Adaptive flow control via Interest Aggregation in CCN

Extension of CCND processing 1/16/ Adaptive flow control via Interest Aggregation in CCN Self-generate Interest message as the range Content Store processing and PIT processing are same as original CCND Interest with range is forwarded to FIB but not to Internally generated Interest Satisfied Interest are excluded from the range For resulting discontinuous range, multiple ranges can be used

Flow Control Scheme Delayed Interest Count (N): – Subsequent Interest messages are sent only after a certain number of Data messages N received N can be set adaptively accordingly to the network congestion status Current paper N is set to – Subsequent Interest will be transmitted after N Data is received – Max window size Maximum number of segment the range field can specify 1/16/ Adaptive flow control via Interest Aggregation in CCN

An Example for Interest Seg(1~10) Data (1) Data (3)Data (4)Data (5)Data (6)Data (7)Data (8)Data (9) Data (10)Data (11)Data (12)Data (13) Data (2) Interest Seg=11~13Interest Seg=14~16Interest Seg=17~19Interest Seg=20~23 Node 1Node 3 Max window size =10 1/16/ Adaptive flow control via Interest Aggregation in CCN

Experimental Test-bed Configuration 1/16/ Adaptive flow control via Interest Aggregation in CCN 11

Experimental results Inefficient use of uplink negatively affect the downlink throughput Decreased uplink bandwidth triggers congestion in the uplink and causing delayed Data delivery Fig. Pipeline-based vs. proposed flow control in download speed Fig. Performance improvement ratio in throughput over pipeline-based flow control 1/16/2014 Adaptive flow control via Interest Aggregation in CCN 12

Experimental result No. of Interest messages transmitted to receive a 10 MB file Fig. Pipeline-based vs. proposed flow control in bandwidth usage efficiency 1/16/ Adaptive flow control via Interest Aggregation in CCN

Conclusion Authors proposed a solution for a problem of down link under-utilization while uplink is severely congested Extension of Interest header and experiment were implemented in CCNx Adaptive optimization for controlling the number of Interest per window is left for further study 1/16/ Adaptive flow control via Interest Aggregation in CCN

Thanks you!