Congestion Control Based On Network Protocol
Journal: International Journal of Research in Information Technology (IJRIT) (Vol.1, No. 3)Publication Date: 2013-03-30
Authors : Swathi G.P Iswarya R Priya.M;
Page : 18-24
Keywords : Congestion Free Router; end-end statement; Congestion Crash;
Abstract
The Internet’s excellent scalability and result in part from the end-to-end nature of Internet congestion control technique. End-to-end congestion control algorithms alone yare ineffective to forbid the congestion crash and inequity created by applications that are insusceptible to network congestion. To handle these troubles, we aim and looking to a novel congestion-avoidance mechanism called Congestion Free Router (CFR). CFR means the exchange of feedback between routers at the borders of a network in order to observe and limit insusceptible traffic flows before they enter the network, thereby forbidding congestion within the network. The primal philosophy behind the Internet is conveyed by the scalability statement no protocol, mechanism, or service should be brought in into the Internet if it does not scale well. A key inference to the scalability statement is the end-to-end statement to preserves scalability; algorithmic complication should be forced to the border of the network whenever possible.
Other Latest Articles
- Implementation of RC5 Symmetric Key Encryption Algorithm for Secure Communication
- Comparison of Computer Intelligence with Respect to Human Being ? A Mathematical Approach
- DELAY-TOLERANT WIRELESS NETWORK PROTOCOL WITH LQ-ARQ MECHANISM
- MORPHOLOGICAL MARKERS FOR IDENTIFICATION OF Populus deltoides CLONES IN NURSERY
- EFFECT OF AgNO3 AND 8-HQC ON VASE LIFE OF CUT ROSES
Last modified: 2013-04-01 14:30:54