8 research outputs found
RED behavior with different packet sizes
We consider the adaptation of random early detection (RED) as a buffer
management algorithm for TCP traffic in Internet gateways where different
maximum transfer units (MTUs) are used. We studied the two RED variants
described in [4] and point out a weakness in both. The first variant where drop
probability is independent from the packet size discriminates connections with
smaller MTUs. The second variant results in a very high packet loss ratio
(PLR), and as a consequence low goodput, for connections with higher MTUs. We
show that fairness in terms of loss and goodput can be supplied through an
appropriate setting of the RED algorithm.Comment: 13 pages, submitted to IEEE symposium on computer communications
(ISCC2000
Improvements to Core Stateless Fair Queueing
Core Stateless Fair Queueing (CSFQ) is a scalable mechanism to provide per-flow fairness in highspeed networks in that it does not need to maintain per-flow state in the core routers. This is possible because the state for each flow is encoded as special labels inside each packet. In this paper, we propose and evaluate by simulations two improvements to CSFQ. First, we show that CSFQ does not provide a fair service when some links are not congested. Our first improvement solves this issue. Second, we propose an algorithm to allow CSFQ to provide a service with a minimum guaranteed bandwidth and evaluate its performance with TCP traffic
Controlling the redistribution of BGP routes
This document proposes the redistribution extended community. This new extended community allows a router to influence how a specific route should be redistributed towards a specified set of eBGP speakers. Several types of redistribution communities are proposed. The first type may be used to indicate that a specific route should not be announced over a specified set of eBGP sessions. The second type may be used to indicate that the attached route should only be announced with the NO_EXPORT community over the specified set of eBGP sessions and the third type may be used to indicate that the attached route should be prepended n times when announced over a specified set of eBGP sessions