Open Access Open Access  Restricted Access Subscription Access

A Unique Congestion-Avoidance Mechanism for the Internet

Rupali shankar, Prof.Dr.S.Vikas Babu

Abstract


Congestion within the network is developing immensely because of the increase of usage of multimedia software. This result in unresponsive and misbehaving traffic flows. There are few primitive scheduling schemes to govern the congestion within the network, which labored high-quality at surrender-to-give up community, due which they were not able to save you the congestion crumble and unfairness created with the aid of applications which might be unresponsive to community congestion. So together we blanketed those schemes and made upgrades to make a greater bendy answer for constructing congestion manage scheme in community the usage of community border protocol framework. using NBP framework we display the aggregation and connection admission manipulate mechanisms into the NBP framework.The NBP framework offers a proper protocol designs which involves the exchange of feedback among routers on the borders of a community on the manner to find and limit unresponsive visitors flows in advance than they input the network, thereby stopping congestion in the community. The NBP framework is proposed with advanced center-stateless fair queuing (ECSFQ) mechanism, which affords honest bandwidth allocations to competing flows. 


Full Text:

PDF

References


S. Floyd and k. Fall, “selling using cease-to-end Congestion control within the net,” IEEE/ACM Transactions on Networking, August 1999, To appear.

J. Padhye,V. Firoiu, D. Towsley, and J. Kurose, “ModelingTCP Throughput: A SimpleModel and itsEmpirical Validation,” in Proc. of ACM SIGCOMM,September 1998, pp. 303–314.

B. Suter, T.V.Lakshman, D. Stiliadis, and A. Choudhury, “layout considerations for assisting TCP with consistent with-float Queueing,” in Proc. of IEEE Infocom’98, March 1998, pp. 299–305.

B. Braden et al., “recommendations on Queuemanagement andCongestionAvoidance within the internet,” RFC 2309, IETF, April 1998.

A. Demers, S. Keshav, and S. Shenker, “analysis andSimulation of a honest Queueing set of rules,” in Proc. Of ACM SIGCOMM, September 1989, pp.1–12.

A. Parekh and R. Gallager, “A Generalized Processor Sharing method to float control – the unmarried Node Case,” IEEE/ACM Transactions on Networking, vol. 1, no. three, pp. 344–357, June 1993.

I. Stoica, S. Shenker, and H. Zhang, “core-Stateless truthful Queueing: reaching about honest Bandwidth Allocations in excessive speed Networks,” in Proc. of ACM SIGCOMM, September 1998, pp. 118–130.

D. Lin and R. Morris, “Dynamics of Random Early Detection,” in Proc. Of ACM SIGCOMM, September 1997, pp. 127–137.

D. Bertsekas and R. Gallager, information Networks, secondversion, Prentice hall, 1987.


Refbacks

  • There are currently no refbacks.