Corpus ID: 212448947

Load-Balancing Multipath Switching System with Flow Slice

@inproceedings{Poojitha2013LoadBalancingMS,
  title={Load-Balancing Multipath Switching System with Flow Slice},
  author={P. Poojitha and G. Suhasini},
  year={2013}
}
Load balancing plays a pivotal role in core routers as they need to handle multiple requests at a time. To achieve load balancing Multipath Switching Systems (MPS) are widely used. One of the challenging issues in building MPS is to ensure load balancing across multiple paths besides keeping the order of intraflow packets intact. The existing solutions are packet – based and they have drawbacks as they cannot scale and cause delay. Hashing algorithms that are based on flow-size also could not… Expand
1 Citations

Figures and Tables from this paper

A Practical Large-Capacity Three-Stage Buffered Clos-Network Switch Architecture
TLDR
It is found that TSBCS/BS can be mapped to a “fat” combined input-crosspoint queued (CICQ) switch and can achieve 100 percent throughput under any admissible traffic if a stable CICQ scheduling algorithm is used. Expand

References

SHOWING 1-10 OF 21 REFERENCES
Load-Balancing Multipath Switching System with Flow Slice
TLDR
A novel scheme, namely, Flow Slice (FS) that cuts off each flow into flow slices at every intraflow interval larger than a slicing threshold and balances the load on a finer granularity achieves comparative load-balancing performance to the optimal one. Expand
Sequence-preserving adaptive load balancers
  • W. Shi, L. Kencl
  • Computer Science
  • 2006 Symposium on Architecture For Networking And Communications Systems
  • 2006
TLDR
A novel hybrid scheme is demonstrated that combines best of the flow-based and burst-based load balancing techniques and excels in both of the key metrics of flow remapping and packet reordering. Expand
Load balancing for parallel forwarding
TLDR
It is proved that under certain Zipf-like flow-size distributions, hashing alone is not able to balance workload, and a new metric is introduced to quantify the effects of adaptive load balancing on overall forwarding performance. Expand
Harnessing TCP ’ s Burstiness with Flowlet Switching
TLDR
It is shown that the burstiness of TCP can be harnessed to make TCP more robust to packet reordering caused by route change, and flowlet switching is shown to be an ideal technique for load balancing traffic across multiple paths as it has the accuracy of packet switching, combined with the robustness of flow switching to packets reordering. Expand
Evaluation of open-loop sequence control schemes for multi-path switches
  • D. Khotimsky, S. Krishnan
  • Computer Science
  • 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333)
  • 2002
TLDR
This work analyzes the performance of the sequence controller of a generic multi-path switch, and compares the behavior of three practical open-loop sequence control schemes using packet-level simulations to choose an appropriate protocol under the assumed traffic conditions. Expand
Load balanced Birkhoff-von Neumann switches, part II: multi-stage buffering
The main objective of this sequel is to solve the out-of-sequence problem that occurs in the load balanced Birkhoff-von Neumann switch with one-stage buffering. We do this by adding a load-balancingExpand
Adaptive Load Sharing for Network Processors
TLDR
A novel scheme for processing packets in a router is presented that provides load sharing among multiple network processors distributed within the router and achieves significant improvements in processor utilization. Expand
Performance of hashing-based schemes for Internet load balancing
  • Zhiruo Cao, Z. Wang, E. Zegura
  • Computer Science
  • Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
  • 2000
TLDR
This first comprehensive study of hashing-based load balancing schemes for distributing traffic over multiple links while preserving the order of packets within a flow finds that hashing using a 16-bit CRC over the five-tuple gives excellent load balancing performance. Expand
Maintaining packet order in two-stage switches
  • I. Keslassy, N. McKeown
  • Computer Science
  • Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies
  • 2002
TLDR
This paper presents an algorithm called full frames first (FFF), that prevents mis-sequencing while maintaining the performance benefits (in terms of throughput and delay) of the basic two-stage switch. Expand
Providing guaranteed rate services in the load balanced Birkhoff-von Neumann switches
TLDR
This paper proposes two schemes for the load balanced Birkhoff-von Neumann switches to provide guaranteed rate services and shows that if the incoming traffic satisfies certain rate assumptions, then the end-to-end delay for every packet is bounded by the sum of its targeted departure time and a constant that only depends on the number of flows and the size of the switch. Expand
...
1
2
3
...