Using multiple independent networks (also known as rails) is an emerging technique to overcome bandwidth limitations and enhance fault-tolerance of current high-performance clusters. This report presents the limitations and performance of static rail-allocation approaches, where each rail is pre-assigned a direction for communication. An analytical lower bound on the number of networks required...

It is known that a data network may not be stable at the connection level under some unfair bandwidth allocation policies, even when the normal offered load condition is satisfied, i.e., the average traffic load at each link is less than its capacity. In this paper, we show that, under the normal offered load condition, a data network is stable when the bandwidth of the network is allocated so ...

Class-based service differentiation is provided in DiffServ networks. However, this differentiation will be disordered under dynamic traffic loads due to the fixed weighted scheduling. An adaptive weighted scheduling scheme is proposed in this paper to achieve fair bandwidth allocation among different service classes. In this scheme, the number of active flows and the subscribed bandwidth are e...

We consider differentiated bandwidth allocation for short-range wireless personal communication systems: Bluetooth. Since bandwidth requirements may vary among applications/services, and/or it may change over time, it is important to decide how to allocate limited resources to various service classes to meet their service requirements. We propose a simple and eff icient bandwidth allocation mec...

| We propose a bu®er management mechanism, called V-WFQ (Virtual Weighted Fair Queueing), for achieving approximately fair bandwidth allocation with a small hardware amount in high-speed networks. The basic process for allocating bandwidth fairly uses selective packet dropping to compare the measured input rate of the °ow with an estimated fair bandwidth share. Though V-WFQ is a hardwaree±cient...

In this paper we introduce a new scheduling system with decoupled delay bound and bandwidth allocation guarantees. It is based on an existing efficient fair scheduler, Frame-based Fair Queueing (FFQ)[1], and therefore inherits the fairness, simplicity and efficiency of that policy. We combine a slightly modified version of an FFQ scheduler with the link sharing concept using rate estimator modu...

Recently, efficient network resource management and qualityof-service (QoS) guarantee become more and more important for multimedia applications and services, especially when considering network delays. In this paper, an optimal bandwidth allocation scheme that achieves maximal utilization of the client buffer and minimal allocation of bandwidth for each client is introduced. The proposed schem...

We propose STRIDE, a new Internet architecture that provides strong DDoS defense mechanisms for both public services and private end-to-end communication. This new architecture presents several novel concepts including long-term static paths, bandwidth allocation through a top-down topology discovery protocol, dynamic bandwidth allocation via network capabilities, and differentiated packet prio...

In this paper variable rate control strategies for real-time VBR stream service over IEEE 802.16 broadband networks are investigated. This is done in the context of real-time streaming using variable bit rate technology. A data rate control mechanism is derived for the case where the downlink channel provides real time polling bandwidth allocation service and remains traffic rate parameter cons...