Presentation 2005-01-19
Packet scheduling algorithm for Rate-based Multi-path TCP (R-M/TCP)
Toru OSUGA, Kultida ROJVIBOONCHAI, Hitoshi AIDA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We have proposed Rate-based Multi-path Transmission Control Protocol (R-M/TCP) as a reliable transport protocol to tackle with the well-known long-fat-pipe problem, loss recovery algorithm, and burst traffic in TCP. R-M/TCP performs congestion control in a rate-based and loss-avoidance manner. It originally transmits data packets in a round-robin manner through multiple paths. In this paper, instead of using the round-robin manner, we propose a packet scheduling algorithm for R-M/TCP. Our algorithm accounts for the time-varying bandwidth and delay of each path so as to minimize number of packets arriving in out-of-order at the receiver. Simulation results show effectiveness of our algorithm.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Packet scheduling / Rate Control / Multipath / TCP
Paper # MoMuC2004-103,IA2004-34
Date of Issue

Conference Information
Committee IA
Conference Date 2005/1/12(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Internet Architecture(IA)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Packet scheduling algorithm for Rate-based Multi-path TCP (R-M/TCP)
Sub Title (in English)
Keyword(1) Packet scheduling
Keyword(2) Rate Control
Keyword(3) Multipath
Keyword(4) TCP
1st Author's Name Toru OSUGA
1st Author's Affiliation School of Engineering, The University of Tokyo()
2nd Author's Name Kultida ROJVIBOONCHAI
2nd Author's Affiliation Graduate School of Frontier Sciences, The University of Tokyo
3rd Author's Name Hitoshi AIDA
3rd Author's Affiliation Graduate School of Frontier Sciences, The University of Tokyo
Date 2005-01-19
Paper # MoMuC2004-103,IA2004-34
Volume (vol) vol.104
Number (no) 554
Page pp.pp.-
#Pages 6
Date of Issue