An improved hop-by-hop interest shaper for congestion control in named data networking
| Autor: | Natalya Rozhnova, Ashok Narayanan, Yaogong Wang, Injong Rhee, David R. Oran |
|---|---|
| Přispěvatelé: | Institut des Sciences Chimiques de Rennes (ISCR), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Ecole Nationale Supérieure de Chimie de Rennes (ENSCR)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS), Networks and Performance Analysis (NPA), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Laboratory of Information, Network and Communication Sciences (LINCS), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT), University of Maryland [College Park], University of Maryland System, Cisco Systems, CISCO Systems, Inc, Department of Computer Science (NCSU), North Carolina State University [Raleigh] (NC State), University of North Carolina System (UNC)-University of North Carolina System (UNC), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Ecole Nationale Supérieure de Chimie de Rennes (ENSCR)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS), Institut Mines-Télécom [Paris] (IMT)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Pierre et Marie Curie - Paris 6 (UPMC) |
| Jazyk: | angličtina |
| Rok vydání: | 2013 |
| Předmět: |
Optimization problem
Computer Networks and Communications Computer science business.industry Distributed computing ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Congestion control Throughput 020206 networking & telecommunications 02 engineering and technology Content based networking Hop (networking) Network congestion [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI] Information-centric networking Computer Science::Networking and Internet Architecture 0202 electrical engineering electronic engineering information engineering Condensed Matter::Strongly Correlated Electrons 020201 artificial intelligence & image processing business Software Computer network |
| Zdroj: | ACM SIGCOMM Computer Communication Review ACM SIGCOMM ICN workshop ACM SIGCOMM ICN workshop, Aug 2013, Hong Kong, China. pp.55-60, ⟨10.1145/2534169.2491233⟩ ICN |
| DOI: | 10.1145/2534169.2491233⟩ |
| Popis: | Best paper award PDF is publicly available here: http://conferences.sigcomm.org/sigcomm/2013/papers/icn/p55.pdf; International audience; Hop-by-hop interest shaping has been proposed as a viable congestion control mechanism in Named Data Networking (NDN). Interest shaping exploits the strict receiver-driven traffic pattern and the symmetric bidirectional forwarding in NDN to control the returning data rate. In this paper, we point out that both interests and contents contribute to congestion and their interdependence must be considered in any interest shaping algorithm. We first analyze this issue mathematically by formulating it as an optimization problem to obtain the optimal shaping rate. Then a practical interest shaping algorithm is proposed to achieve high link utilization without congestive data loss. We further note that flow differentiation in NDN is complicated and design our scheme independently of traffic flows. We demonstrate our hop-by-hop interest shaper in conjunction with simple Additive- Increase-Multiplicative-Decrease (AIMD) clients using the ns3-based NDN simulator (ndnSIM). Our results show that the proposed shaping algorithm can effectively control congestion and achieve near-optimal throughput. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|