Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Experiences with a high-speed network adaptor: a software perspective
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Dynamics of TCP traffic over ATM networks
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Link-sharing and resource management models for packet networks
IEEE/ACM Transactions on Networking (TON)
Packet reordering is not pathological network behavior
IEEE/ACM Transactions on Networking (TON)
Self-stabilization by local checking and correction
Self-stabilization by local checking and correction
Striping within the network subsystem
IEEE Network: The Magazine of Global Internetworking
Generalized Load Sharing for Packet-Switching Networks I: Theory and Packet-Based Algorithm
IEEE Transactions on Parallel and Distributed Systems
Fair link striping with FIFO delivery on heterogeneous channels
Computer Communications
Journal of Network and Computer Applications
Uncompressed high definition visual sharing system towards interactive networked collaboration
Proceedings of the First International Conference on Immersive Telecommunications
Bonded deficit round robin scheduling for multi-channel networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Traffic splitting in a network: split traffic models and applications
Computer Communications
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Link-striping algorithms are often used to overcome transmission bottlenecks in computer networks. Traditional striping algorithms suffer from two major disadvantages. They provide inadequate load sharing in the presence of variable-length packets, and may result in non-FIFO delivery of data. We describe a new family of link-striping algorithms that solves both problems. Our scheme applies to any layer that can provide multiple FIFO channels. We deal with variable-sized packets by showing how fair-queuing algorithms can be transformed into load-sharing algorithms. Our transformation results in practical load-sharing protocols, and shows a theoretical connection between two seemingly different problems. The same transformation can be applied to obtain load-sharing protocols for links with different capacities. We deal with the FIFO requirement for two separate cases. If a sequence number can be added to each packet, we show how to speed up packet processing by letting the receiver simulate the sender algorithm. If no header can be added, we show how to provide quasi FIFO delivery. Quasi FIFO is FIFO except during occasional periods of loss of synchronization. We argue that quasi FIFO is adequate for most applications. We also describe a simple technique for speedy restoration of synchronization in the event of loss. We develop an architectural framework for transparently embedding our protocol at the network level by striping IP packets across multiple physical interfaces. The resulting stripe protocol has been implemented within the NetBSD kernel. Our measurements and simulations show that the protocol offers scalable throughput even when striping is done over dissimilar links, and that the protocol synchronized quickly after packet loss. Measurements show performance improvements over conventional round-robin striping schemes and striping schemes that do not resequence packets. Some aspects of our solution have been implemented in Cisco's router operating system (IOS 11.3) in the context of Multilink PPP striping.