Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Are MIRCC and Rate-based Congestion Control in ICN READY for Variable Link Capacity?
RISE SICS.
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science. (DIStributed Systems and Communications Research Group (DISCO))
RISE SICS.
Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science. Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science. (Distributed Systems and Communications Research Group (DISCO))ORCID iD: 0000-0003-4147-9487
Show others and affiliations
2017 (English)In: The 13th Swedish National Computer Networking Workshop (SNCNW 2017), Halmstad University, May 29.30., 2017Conference paper, Published paper (Other academic)
Abstract [en]

Information-centric networking (ICN) has been introduced as a potential future networking architecture. ICN promises an architecture that makes information independent from lo- cation, application, storage, and transportation. Still, it is not without challenges. Notably, there are several outstanding issues regarding congestion control: Since ICN is more or less oblivious to the location of information, it opens up for a single application flow to have several sources, something which blurs the notion of transport flows, and makes it very difficult to employ traditional end-to-end congestion control schemes in these networks. Instead, ICN networks often make use of hop-by-hop congestion control schemes. How- ever, these schemes are also tainted with problems, e.g., several of the proposed ICN congestion controls assume fixed link capacities that are known beforehand. Since this seldom is the case, this paper evaluates the consequences in terms of latency, throughput, and link usage, variable link capacities have on a hop-by-hop congestion control scheme, such as the one employed by the Multipath-aware ICN Rate-based Congestion Control (MIRCC). The evaluation was carried out in the OMNeT++ simulator, and demonstrates how seemingly small variations in link capacity significantly deterio- rate both latency and throughput, and often result in inefficient network link usage. 

Place, publisher, year, edition, pages
2017.
Keyword [en]
ICN, congestion control, hop-by-hop, MIRCC, link capacity
National Category
Telecommunications
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kau:diva-48539OAI: oai:DiVA.org:kau-48539DiVA: diva2:1094465
Conference
The 13th Swedish National Computer Networking Workshop (SNCNW 2017)
Projects
Research Environment for Advancing Low Latency Internet (READY)
Funder
Knowledge Foundation
Available from: 2017-05-10 Created: 2017-05-10 Last updated: 2017-08-08

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Hurtig, PerGrinnemo, Karl-JohanBrunstrom, Anna
By organisation
Department of Mathematics and Computer ScienceDepartment of Computer Science
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

Total: 186 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf