Share Email Print
cover

Proceedings Paper

AOS: adaptive offset time scheduling for TCP fairness in optical burst-switched network
Author(s): Hongyun Zheng; Yongxiang Zhao; Changjia Chen
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Optical Burst-switched (OBS) is a promising switching technology and expected to support the future Internet backbone with dramatically increasing bandwidth demand. In an OBS network, burst contention causes burst loss due to bufferless nature of OBS core network. This kind of burst loss will interact with the above TCP layer. In this paper, we study the impact of this interaction on TCP fairness. We find significant unfairness among TCP flows that share the OBS core network, i.e. one flow obtains higher throughput while any others with much lower throughputs. The cause is the phenomenon called "the bigger eats the smaller (BES)", in which a TCP flow with higher rate occasionally will "see" less burst contentions and increase its rate further, while a TCP with lower rate will see more burst contentions and decrease its rate continually. Discuss a simple model to explain BES and verify that a continuous sequence of bursts will enhance BES. Then observe that offset time will be a good choice to control TCP fairness by a curve of unfairness control with offset time adjustment. Finally an adaptive offset time scheduling (AOS) algorithm is proposed. AOS assigns burst offset time value adaptive to the rate of TCP flow. The simulation results show that the fairness can be significantly improved by our AOS scheme.

Paper Details

Date Published: 5 December 2005
PDF: 6 pages
Proc. SPIE 6022, Network Architectures, Management, and Applications III, 602232 (5 December 2005); doi: 10.1117/12.635059
Show Author Affiliations
Hongyun Zheng, Beijing Jiaotong Univ. (China)
Yongxiang Zhao, Beijing Jiaotong Univ. (China)
Changjia Chen, Beijing Jiaotong Univ. (China)


Published in SPIE Proceedings Vol. 6022:
Network Architectures, Management, and Applications III
Kwok-wai Cheung; Gee-Kung Chang; Guangcheng Li; Ken-Ichi Sato, Editor(s)

© SPIE. Terms of Use
Back to Top