Cooperative Congestion Control in NDN

Named Data Networking (NDN), an Information-Centric Network (ICN) architecture, is based on caching, multipath and multi-producers retrieving. These properties provide new opportunities for a single user to increase its Quality of Experience (QoE). However, handling multiple flows, each of them havi...

Full description

Saved in:
Bibliographic Details
Main Authors: Thibaud, Adrien, Fasson, Julien, Arnal, Fabrice, Sallantin, Renaud, Dubois, Emmanuel, Chaput, Emmanuel
Format: Conference Proceeding
Language:English
Subjects:
Congestion Control
ICN
IP networks
Iterative closest point algorithm
Max-min fairness
Microsoft Windows
Multipath flows
NDN
Optimization
Peer-to-peer computing
QoE
Quality of experience
Throughput
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 6
container_issue
container_start_page 1
container_title
container_volume
creator Thibaud, Adrien
Fasson, Julien
Arnal, Fabrice
Sallantin, Renaud
Dubois, Emmanuel
Chaput, Emmanuel
description Named Data Networking (NDN), an Information-Centric Network (ICN) architecture, is based on caching, multipath and multi-producers retrieving. These properties provide new opportunities for a single user to increase its Quality of Experience (QoE). However, handling multiple flows, each of them having its own multiple paths, is more complex. To tackle this challenge, we highlight three main principles a solution should include. Nodes should cooperate, supervise their output queues and, eventually, wisely manage the multipath capacities of NDN. These three elements are the core of our proposition: Cooperative Congestion Control (CCC). More than a solution, CCC is proposed as a framework where each principle could be implemented in multiple ways. The ultimate objective is to fairly distribute the flows on the network and maximize QoE of users. We choose basic algorithms in order to evaluate the overall framework. We evaluate our solution with simulations and compare their results with a theoretical model.
doi_str_mv 10.1109/ICC40277.2020.9149034
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_9149034</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9149034</ieee_id><sourcerecordid>9149034</sourcerecordid><originalsourceid>FETCH-LOGICAL-h284t-f343afa039dab51293543496836980695bfceb1de4dd82f394a094f1b62f285e3</originalsourceid><addsrcrecordid>eNotj81Kw0AURkdBsK0-gQjZuEy8d-5MMncp41-htJu6LhNzR0dqpiRB8O1V7Oo7q3P4lLpGqBCBb5feG9BNU2nQUDEaBjInao6NdmjBsT5VM2RyJTpH52o-jh8AVjPhTN34nA8yhCl9SeFz_ybjlHL_h9OQ90Xqi_X9-kKdxbAf5fK4C_Xy-LD1z-Vq87T0d6vyXTszlZEMhRiAuAutxd-CNWS4dlSzg5ptG1-lxU5M1zkdiU0ANhHbWkftrNBCXf17k4jsDkP6DMP37niJfgD8bz7E</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Cooperative Congestion Control in NDN</title><source>IEEE Xplore All Conference Series</source><creator>Thibaud, Adrien ; Fasson, Julien ; Arnal, Fabrice ; Sallantin, Renaud ; Dubois, Emmanuel ; Chaput, Emmanuel</creator><creatorcontrib>Thibaud, Adrien ; Fasson, Julien ; Arnal, Fabrice ; Sallantin, Renaud ; Dubois, Emmanuel ; Chaput, Emmanuel</creatorcontrib><description>Named Data Networking (NDN), an Information-Centric Network (ICN) architecture, is based on caching, multipath and multi-producers retrieving. These properties provide new opportunities for a single user to increase its Quality of Experience (QoE). However, handling multiple flows, each of them having its own multiple paths, is more complex. To tackle this challenge, we highlight three main principles a solution should include. Nodes should cooperate, supervise their output queues and, eventually, wisely manage the multipath capacities of NDN. These three elements are the core of our proposition: Cooperative Congestion Control (CCC). More than a solution, CCC is proposed as a framework where each principle could be implemented in multiple ways. The ultimate objective is to fairly distribute the flows on the network and maximize QoE of users. We choose basic algorithms in order to evaluate the overall framework. We evaluate our solution with simulations and compare their results with a theoretical model.</description><identifier>EISSN: 1938-1883</identifier><identifier>EISBN: 1728150892</identifier><identifier>EISBN: 9781728150895</identifier><identifier>DOI: 10.1109/ICC40277.2020.9149034</identifier><language>eng</language><publisher>IEEE</publisher><subject>Congestion Control ; ICN ; IP networks ; Iterative closest point algorithm ; Max-min fairness ; Microsoft Windows ; Multipath flows ; NDN ; Optimization ; Peer-to-peer computing ; QoE ; Quality of experience ; Throughput</subject><ispartof>ICC 2020 - 2020 IEEE International Conference on Communications (ICC), 2020, p.1-6</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9149034$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,23930,23931,25140,27925,54555,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9149034$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Thibaud, Adrien</creatorcontrib><creatorcontrib>Fasson, Julien</creatorcontrib><creatorcontrib>Arnal, Fabrice</creatorcontrib><creatorcontrib>Sallantin, Renaud</creatorcontrib><creatorcontrib>Dubois, Emmanuel</creatorcontrib><creatorcontrib>Chaput, Emmanuel</creatorcontrib><title>Cooperative Congestion Control in NDN</title><title>ICC 2020 - 2020 IEEE International Conference on Communications (ICC)</title><addtitle>ICC</addtitle><description>Named Data Networking (NDN), an Information-Centric Network (ICN) architecture, is based on caching, multipath and multi-producers retrieving. These properties provide new opportunities for a single user to increase its Quality of Experience (QoE). However, handling multiple flows, each of them having its own multiple paths, is more complex. To tackle this challenge, we highlight three main principles a solution should include. Nodes should cooperate, supervise their output queues and, eventually, wisely manage the multipath capacities of NDN. These three elements are the core of our proposition: Cooperative Congestion Control (CCC). More than a solution, CCC is proposed as a framework where each principle could be implemented in multiple ways. The ultimate objective is to fairly distribute the flows on the network and maximize QoE of users. We choose basic algorithms in order to evaluate the overall framework. We evaluate our solution with simulations and compare their results with a theoretical model.</description><subject>Congestion Control</subject><subject>ICN</subject><subject>IP networks</subject><subject>Iterative closest point algorithm</subject><subject>Max-min fairness</subject><subject>Microsoft Windows</subject><subject>Multipath flows</subject><subject>NDN</subject><subject>Optimization</subject><subject>Peer-to-peer computing</subject><subject>QoE</subject><subject>Quality of experience</subject><subject>Throughput</subject><issn>1938-1883</issn><isbn>1728150892</isbn><isbn>9781728150895</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2020</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotj81Kw0AURkdBsK0-gQjZuEy8d-5MMncp41-htJu6LhNzR0dqpiRB8O1V7Oo7q3P4lLpGqBCBb5feG9BNU2nQUDEaBjInao6NdmjBsT5VM2RyJTpH52o-jh8AVjPhTN34nA8yhCl9SeFz_ybjlHL_h9OQ90Xqi_X9-kKdxbAf5fK4C_Xy-LD1z-Vq87T0d6vyXTszlZEMhRiAuAutxd-CNWS4dlSzg5ptG1-lxU5M1zkdiU0ANhHbWkftrNBCXf17k4jsDkP6DMP37niJfgD8bz7E</recordid><startdate>202006</startdate><enddate>202006</enddate><creator>Thibaud, Adrien</creator><creator>Fasson, Julien</creator><creator>Arnal, Fabrice</creator><creator>Sallantin, Renaud</creator><creator>Dubois, Emmanuel</creator><creator>Chaput, Emmanuel</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>202006</creationdate><title>Cooperative Congestion Control in NDN</title><author>Thibaud, Adrien ; Fasson, Julien ; Arnal, Fabrice ; Sallantin, Renaud ; Dubois, Emmanuel ; Chaput, Emmanuel</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-h284t-f343afa039dab51293543496836980695bfceb1de4dd82f394a094f1b62f285e3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Congestion Control</topic><topic>ICN</topic><topic>IP networks</topic><topic>Iterative closest point algorithm</topic><topic>Max-min fairness</topic><topic>Microsoft Windows</topic><topic>Multipath flows</topic><topic>NDN</topic><topic>Optimization</topic><topic>Peer-to-peer computing</topic><topic>QoE</topic><topic>Quality of experience</topic><topic>Throughput</topic><toplevel>online_resources</toplevel><creatorcontrib>Thibaud, Adrien</creatorcontrib><creatorcontrib>Fasson, Julien</creatorcontrib><creatorcontrib>Arnal, Fabrice</creatorcontrib><creatorcontrib>Sallantin, Renaud</creatorcontrib><creatorcontrib>Dubois, Emmanuel</creatorcontrib><creatorcontrib>Chaput, Emmanuel</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library Online</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Thibaud, Adrien</au><au>Fasson, Julien</au><au>Arnal, Fabrice</au><au>Sallantin, Renaud</au><au>Dubois, Emmanuel</au><au>Chaput, Emmanuel</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Cooperative Congestion Control in NDN</atitle><btitle>ICC 2020 - 2020 IEEE International Conference on Communications (ICC)</btitle><stitle>ICC</stitle><date>2020-06</date><risdate>2020</risdate><spage>1</spage><epage>6</epage><pages>1-6</pages><eissn>1938-1883</eissn><eisbn>1728150892</eisbn><eisbn>9781728150895</eisbn><abstract>Named Data Networking (NDN), an Information-Centric Network (ICN) architecture, is based on caching, multipath and multi-producers retrieving. These properties provide new opportunities for a single user to increase its Quality of Experience (QoE). However, handling multiple flows, each of them having its own multiple paths, is more complex. To tackle this challenge, we highlight three main principles a solution should include. Nodes should cooperate, supervise their output queues and, eventually, wisely manage the multipath capacities of NDN. These three elements are the core of our proposition: Cooperative Congestion Control (CCC). More than a solution, CCC is proposed as a framework where each principle could be implemented in multiple ways. The ultimate objective is to fairly distribute the flows on the network and maximize QoE of users. We choose basic algorithms in order to evaluate the overall framework. We evaluate our solution with simulations and compare their results with a theoretical model.</abstract><pub>IEEE</pub><doi>10.1109/ICC40277.2020.9149034</doi><tpages>6</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier EISSN: 1938-1883
ispartof ICC 2020 - 2020 IEEE International Conference on Communications (ICC), 2020, p.1-6
issn 1938-1883
language eng
recordid cdi_ieee_primary_9149034
source IEEE Xplore All Conference Series
subjects Congestion Control
ICN
IP networks
Iterative closest point algorithm
Max-min fairness
Microsoft Windows
Multipath flows
NDN
Optimization
Peer-to-peer computing
QoE
Quality of experience
Throughput
title Cooperative Congestion Control in NDN
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T14%3A54%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Cooperative%20Congestion%20Control%20in%20NDN&rft.btitle=ICC%202020%20-%202020%20IEEE%20International%20Conference%20on%20Communications%20(ICC)&rft.au=Thibaud,%20Adrien&rft.date=2020-06&rft.spage=1&rft.epage=6&rft.pages=1-6&rft.eissn=1938-1883&rft_id=info:doi/10.1109/ICC40277.2020.9149034&rft.eisbn=1728150892&rft.eisbn_list=9781728150895&rft_dat=%3Cieee_CHZPO%3E9149034%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-h284t-f343afa039dab51293543496836980695bfceb1de4dd82f394a094f1b62f285e3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=9149034&rfr_iscdi=true