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
Explicit and Implicit Loss Notification for Error-prone Links
Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science. Karlstad University, Faculty of Economic Sciences, Communication and IT, Centre for HumanIT.ORCID iD: 0000-0003-3461-7079
2003 (English)Conference paper, Published paper (Refereed)
Abstract [en]

In certain wireless environments the common transport protocol assumption that all packet losses are due to congestion may not hold true. If transport protocols react identically to both congestion and non-congestion related losses, performance will degrade. To avoid this performance problem, transport protocols must be able to differentiate between losses that are due to congestion and losses that are due to wireless link errors. Various loss differentiation techniques exist, some based on the sender side and some on the receiver side. If the loss differentiation is performed at the receiver, loss notification is needed to inform the sender of the loss cause. The sender use the loss notification information to adapt its retransmission and congestion avoidance behavior. The work in this paper examines the effectiveness of two different notification schemes that are to be used in conjunction with receiver based loss differentiation. The first scheme uses a TCP option to explicitly convey the a loss counter and the sequence number of the last corrupted packet. The second scheme uses the generation of additional dup-acks as a way to implicitly influence the retransmission and congestion behavior of the sender. The advantage of the second scheme is that it requires no changes at the sender side TCP implementation. However, since the second scheme can not change the basic loss behavior of halving the congestion window of TCP, its performance is reduced in relation to the first scheme. This paper provides a description of the design of these two loss notification schemes. Additionally, an experimental evaluation is presented, based on a FreeBSD kernel implementation of the two notification schemes in conjunction with checksum based loss differentiation

Place, publisher, year, edition, pages
2003.
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kau:diva-19146OAI: oai:DiVA.org:kau-19146DiVA, id: diva2:592789
Conference
Promote IT 2003, Visby, May 5-7, 2003
Available from: 2013-01-21 Created: 2013-01-21 Last updated: 2018-08-14

Open Access in DiVA

No full text in DiVA

Authority records BETA

Garcia, Johan

Search in DiVA

By author/editor
Garcia, Johan
By organisation
Department of Computer ScienceCentre for HumanIT
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 42 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