The problem of providing a fair allocation between responsible flows (such as TCP) and non-responsible (such as UDP) is investigated. A core stateless fair queuing algorithm with high throughput is presented. In the algorithm, the same packet loss strategies that are based on the calculated probability p are used to all of the flows without distinction. And it does not make into account the sensitivity of TCP. So this paper proposes a new algorithm VCSFQ do the different packet loss strategy. The algorithm can protect TCP flows against UDP flows and improves the fairness of bandwidth allocation. The algorithm performs better than CSFQ for getting high throughput. Simulation shows that it is effective and efficient
A router in today’s Internet has to satisfy two important properties in order to efficiently provide...
[[abstract]]In this article, the problem of providing a fair bandwidth allocation to the flows shari...
[[abstract]]We propose an adaptive bandwidth allocation algorithm for reservation protocols to suppo...
Abstract: The Core Stateless Fair Queuing (CSFQ) is a distributed approach of Fair Queuing (FQ). The...
Many core-stateless mechanisms have been proposed to resolve the scalability problem in the core rou...
Router mechanisms designed to achieve fair bandwidth allocations, like Fair Queueing, have many desi...
[[abstract]]Queue management, bandwidth share, and congestion control are very important to both rob...
The algorithm presented in this thesis is designed to provide all flows sharing an output link of a...
Stability of the Internet today depends largely on cooperation between end hosts that employ TCP (Tr...
Abstract — The problem of achieving fairness in the allocation of the bandwidth resource on a link s...
The problem of fair bandwidth sharing among adaptive (TCP) and non-adaptive(i.e. CBR-UDP) flows at a...
Abstract. Several fair queueing mechanisms based on stateless core (SCORE)/dynamic packet state (DPS...
The heavily loaded flows usually occupy more bandwidth than that of the lightly loaded flows under c...
Providing fairness among users with different levels of ag-gressiveness and different levels of resp...
Assuring guaranteed services and providing fair bandwidth sharing are much sought characteristics in...
A router in today’s Internet has to satisfy two important properties in order to efficiently provide...
[[abstract]]In this article, the problem of providing a fair bandwidth allocation to the flows shari...
[[abstract]]We propose an adaptive bandwidth allocation algorithm for reservation protocols to suppo...
Abstract: The Core Stateless Fair Queuing (CSFQ) is a distributed approach of Fair Queuing (FQ). The...
Many core-stateless mechanisms have been proposed to resolve the scalability problem in the core rou...
Router mechanisms designed to achieve fair bandwidth allocations, like Fair Queueing, have many desi...
[[abstract]]Queue management, bandwidth share, and congestion control are very important to both rob...
The algorithm presented in this thesis is designed to provide all flows sharing an output link of a...
Stability of the Internet today depends largely on cooperation between end hosts that employ TCP (Tr...
Abstract — The problem of achieving fairness in the allocation of the bandwidth resource on a link s...
The problem of fair bandwidth sharing among adaptive (TCP) and non-adaptive(i.e. CBR-UDP) flows at a...
Abstract. Several fair queueing mechanisms based on stateless core (SCORE)/dynamic packet state (DPS...
The heavily loaded flows usually occupy more bandwidth than that of the lightly loaded flows under c...
Providing fairness among users with different levels of ag-gressiveness and different levels of resp...
Assuring guaranteed services and providing fair bandwidth sharing are much sought characteristics in...
A router in today’s Internet has to satisfy two important properties in order to efficiently provide...
[[abstract]]In this article, the problem of providing a fair bandwidth allocation to the flows shari...
[[abstract]]We propose an adaptive bandwidth allocation algorithm for reservation protocols to suppo...