Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
A conservation-law-based modular fluid-flow model for network congestion modeling
KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.ORCID-id: 0000-0002-3704-1338
2012 (engelsk)Inngår i: 2012 Proceedings - IEEE INFOCOM, IEEE Computer Society, 2012, s. 2050-2058Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

A modular fluid-flow model for network congestion analysis and control is proposed. The model is derived from an information conservation law stating that the information is either in transit, lost or received. Mathematical models of network elements such as queues, users, and transmission channels, and network description variables, including sending/ acknowledgement rates and delays, are inferred from this law and obtained by applying this principle locally. The modularity of the devised model makes it sufficiently generic to describe any network topology, and appealing for building simulators. Previous models in the literature are often not capable of capturing the transient behavior of the network precisely, making the resulting analysis inaccurate in practice. Those models can be recovered from exact reduction or approximation of this new model. An important aspect of this particular modeling approach is the introduction of new tight building blocks that implement mechanisms ignored by the existing ones, notably at the queue and user levels. Comparisons with packet-level simulations corroborate the proposed model.

sted, utgiver, år, opplag, sider
IEEE Computer Society, 2012. s. 2050-2058
Serie
IEEE Infocom. Proceedings, ISSN 0743-166X
Emneord [en]
Congestion control modeling, Fluid-flow models, Queueing model, Self-clocking
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-58500DOI: 10.1109/INFCOM.2012.6195586ISI: 000309279502014Scopus ID: 2-s2.0-84861581389ISBN: 978-146730775-8 (tryckt)OAI: oai:DiVA.org:kth-58500DiVA, id: diva2:473185
Konferanse
IEEE Conference on Computer Communications, INFOCOM 2012;Orlando, FL;25 March 2012 through 30 March 2012
Forskningsfinansiär
ICT - The Next Generation
Merknad

QC 20120803

Tilgjengelig fra: 2012-01-05 Laget: 2012-01-05 Sist oppdatert: 2013-09-16bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Karlsson, Gunnar

Søk i DiVA

Av forfatter/redaktør
Briat, CorentinYavuz, Emre A.Karlsson, Gunnar
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 293 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf