WIDE Paper-List in 2009





              Multipath Congestion Control for Shared Bottleneck
                    wide-paper-micchie-pfldnet2009-00.txt









                     WIDE Project: http://www.wide.ad.jp/
                  If you have any comments on this document,
                       please contact to ad@wide.ad.jp.

Title: Multipath Congestion Control for Shared Bottleneck
Authors: Michio Honda(micchie@sfc.wide.ad.jp),
         Yoshifumi Nishida(nishida@sfc.wide.ad.jp),
	 Lars Eggert,
	 Pasi Sarolahti,
	 Hideyuki Tokuda
Date: 2009-05-21

%  - Refereed Conferences and Workshops
@inproceedings{micchie:pfldnet09,
	author= {Michio Honda and Yoshifumi Nishida and Lars Eggert and Pasi Sarolahti and Hideyuki Tokuda},
	title= "{Multipath Congestion Control for Shared Bottleneck}",
	booktitle= {Proc. The 7th International Workshop on Protocols for Future, Large-Scale and Diverse Network Transports (PFLDNeT)},
	pages= {19--24},
	month= {May},
	year= {2009},
}


# Additional data for readers

%  type =		"workshop"
%  site =		[]
%  wideareaname =	[transport]
%  widewgname =		[]
%  keyword =		[]
%  references =		[]
%  summary_ja =		[] 
%  misc =		[]
%  summary =		[
% Multipath transport protocols, which transmit data over
% multiple distinct paths in an end-to-end connection are introduced.
% However, they have a problem in terms of fairness.
% When the transmissions along several paths share the same
% bottleneck link, the multipath connection receives higher
% throughput than a competing regular TCP flow, because
% it executes congestion control per path with the same algorithm
% as TCP. We investigate a congestion control scheme
% that addresses this problem with the weighted congestion
% control approach. In our scheme, an end-to-end connection
% that uses flows along multiple paths can fairly compete with
% TCP flows at the shared bottleneck. Our scheme also maximizes
% the utilization of different path characteristics, such as
% bandwidth capacity and RTT. Our simulation results show
% that a bundle of multiple flows based on our scheme fairly
% competes with TCP flows at the shared bottleneck.
% ]