Open Access Open Access  Restricted Access Subscription or Fee Access

A New Approach for Internet Congestion Avoidance and Traffic Splitting

M. Azath, Dr. R. S. D. Wahida banu

Abstract


In this paper we propose a bursty traffic splitting algorithm splits the traffic flows over multiple parallel paths, based on a split vector. In this algorithm, instead of switching packets or flows, it switches packet bursts. Since the packet bursts are smaller in size, the algorithm splits the traffic dynamically and accurately. At the same time, the condition forced on their latency difference, ensures that no packets are reordered. To achieve fair bandwidth allocations, load balancing is attained in the system since the high-rate aggressive traffic flows are splitted along multiple parallel paths. The proposed switching technique is executed in the edge and core routers. We will show by simulations that our adaptive packet scheduler performs better than the standard fair-queuing techniques.

Keywords


Load Balancing, Splitting, Bursty Traffic, Aggressive Flows, Scheduler, RED

Full Text:

PDF

References


Ion Stoica, Scott Shenker, Hui Zhang, "Core-Stateless Fair Queueing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks", SIGCOMM’98.

S. Floyd and V. Jacobson, “Random early detection gateways for congestion avoidance,” IEEE/ACM Transactions on Networking, August 1993.

S. Kunniyur and R. Srikant, “End-to-end congestion control: utility functions, random losses and ECN marks,” in Proceedings of INFOCOM, Tel Aviv, Israel, March 2000. Also to appear in IEEE/ACM Transactions on Networking, 2003.

S. Kunniyur and R. Srikant, “A time-scale decomposition approach to adaptive ECN marking,” IEEE Transactions on Automatic Control, June 2002.

T. J. Ott, T. V. Lakshman, and L. H. Wong, “SRED: Stabilized RED,” in Proceedings of INFOCOM, New York, NY, March 1999.

W. Feng, D. Kandlur, D. Saha, and K. Shin, “Blue: A new class of active queue management schemes,” April 1999, Technical Report, CSE-TR-387-99, U. Michigan.

S. Athuraliya, D. E. Lapsley, and S. H. Low, “Random early marking for Internet congestion control,” in Proceedings of Globecom, 1999.

R.J. Gibbens and F.P. Kelly, “Distributed connection acceptance control for a connectionless network,” in Proc. of the 16th Intl. Teletraffic Congress, Edinburgh, Scotland, June 1999.

Enhanced Fair-Queuing Mechanism For Congestion-Avoidance Algorithms.

Http://En.Wikipedia.Org/Wiki .

Srikanth Kandula, Dina Katabi, Shantanu Sinha, Arthur Berger”Dynamic Load Balancing Without Packet Reordering” Acm Sig comm Computer Communication Review, Volume 37, Issue 2 (April 2007).

S. Ramabhadran and J. Pasquale, "Stratified Round Robin: A Low Complexity Packet Scheduler with Bandwidth Fairness and Bounded Delay," Proc. Acm Communications Architectures and Protocols Conf. (Sigcomm), Karlsruhe, Germany, Pp. 239-249, Aug. 2003

Core-Stateless Fair Queuing

Bienkowski, Marcin; Korzeniowski, Miroslaw; Meyer Auf Der Heide, Friedhelm: Dynamic Load Balancing In Distributed Hash Tables, In: Proc. Of The 4th Annual International Workshop On Peer-To-Peer Systems (Iptps), 2005, S. 217-225

Shi, W. Macgregor, M.H. Gburzynski, P. “Load Balancing For Parallel Forwarding” Networking, Ieee/Acm Transactions On Publication Date: Aug. 2005.

K. Devine, E. Boman, R. Heaphy, B. Hendrickson, J. Teresco, J. Faik, J. Flaherty, L. Gervasio “New Challenges In Dynamic Load Balancing” Applied Numerical Mathematics, Vol. 52, Issues 2-3, Pp. 133-152, 2005.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.