Deterministic packet marking for max-min flow control

This letter proposes a deterministic packet marking scheme that estimates the maximum link price on a communication path. The proposed scheme is simple and W-compatible because it uses two-bit Explicit Congestion Notification (ECN) field and IP identification (IPid) field in the standard IP header for the estimation. Through simulations using real IP packet traces, we show that our scheme indeed works as designed with small estimation errors, and thus enables existing max-min flow control algorithms to serve their purpose without the need of separate out-of-band control packets to carry link prices.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2005-09
Language
ENG
Keywords

CONGESTION CONTROL

Citation

IEEE COMMUNICATIONS LETTERS, v.9, no.9, pp.856 - 858

ISSN
1089-7798
DOI
10.1109/LCOMM.2005.09017
URI
http://hdl.handle.net/10203/421
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
000231919200030.pdf(176.23 kB)Download
  • Hit : 481
  • Download : 212
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 3 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0