Multi-path routing using intra-flow splitting

Details Multi-path routing using intra-flow splitting Multi-path routing using intra-flow splitting

2005-06-28

2009-12-22

Moe, Aung S (Department: 2416)

Multiplex communications

Data flow congestion prevention or control

Control of data admission to the network

C370S229000, C370S400000, C370S401000

Reexamination Certificate

active

07636309

ABSTRACT:
Multi-path routing techniques using intra-flow splitting are disclosed. For example, a technique for processing traffic flows at a node in a network comprises the following steps/operations. At least one traffic flow is obtained. The at least one traffic flow comprises multiple packets or bytes. The at least one flow is split into at least two sub-flows, wherein each of the at least two sub-flows comprises a portion of the multiple packets or bytes. The packets or bytes of the at least two sub-flows are respectively routed on at least two paths in the network.

REFERENCES:
patent: 5255181 (1993-10-01), Chapman et al.
patent: 6788686 (2004-09-01), Khotimsky et al.
patent: 2002/0024934 (2002-02-01), Galand et al.
patent: 2003/0023750 (2003-01-01), Basturk
patent: 2003/0079013 (2003-04-01), I'Anson
patent: 2003/0081592 (2003-05-01), Krishnarajah et al.
patent: 2005/0132044 (2005-06-01), Guingo et al.
patent: 2005/0163045 (2005-07-01), Randriamasy
patent: 2005/0201285 (2005-09-01), Simonis
patent: 2005/0207443 (2005-09-01), Kawamura et al.
patent: 2005/0208949 (2005-09-01), Chiueh
patent: 2005/0271060 (2005-12-01), Kodialam et al.
patent: 2005/0276220 (2005-12-01), Kokko
patent: 2005/0286487 (2005-12-01), Chitrapu
patent: 2006/0039280 (2006-02-01), Anandakumar et al.
patent: 2006/0050736 (2006-03-01), Segel
patent: 2006/0067331 (2006-03-01), Kodialam et al.
patent: 2006/0140116 (2006-06-01), Alicherry et al.
patent: 2006/0140118 (2006-06-01), Alicherry et al.
patent: 2006/0215689 (2006-09-01), Liu et al.
patent: 2006/0250964 (2006-11-01), Vasseur et al.
patent: 2006/0274718 (2006-12-01), Butenweg et al.
patent: 2007/0002741 (2007-01-01), Vaananen et al.
patent: 2007/0071004 (2007-03-01), Hasegawa et al.
patent: 2007/0147254 (2007-06-01), Larsson et al.
patent: 2008/0031188 (2008-02-01), Magnusson et al.
Cetinkaya et al., Opportunistic Traffic Scheduling Over Multiple Network Paths, Sep. 2004, IEEE, pp. 1928-1937.
J.C.R. Bennett et al., “Packet Reordering is Not Pathological Network Behavior,” IEEE/ACM Transactions on Networking, vol. 7, No. 6, pp. 789-798, Dec. 1999.
A.I. Elwalid et al., “Effective Bandwidth of General Markovian Traffic Sources and Admission Control of High Speed Networks,” IEEE/ACM Transactions on Networking, vol. 1, No. 3, pp. 329-343, Jun. 1993.
R. Guérin et al., “Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks,” IEEE Journal on Selected Areas in Communications, vol. 9, No. 7, pp. 968-981, Sep. 1991.
A. Simonian et al., “Large Deviations Approximation for Fluid Queues Fed by a large Number of On/Off Sources,” IEEE Journal on Selected Areas in Communications, vol. 13, No. 6, pp. 1017-1027, Aug. 1995.
N. Likhanov et al., “Cell Loss Asymptotics in Buffers Fed with a Large Number of Independent Stationary Sources,” IEEE Infocom, pp. 339-346, 1998.
R.G. Addie, “On Weak Convergence of Long-Range-Dependent Traffic Processes,” Journal of Statistical Planning and Inference 80, pp. 155-171, 1999.
H. Nagesh et al., “Netswitch: Load-Balanced Data-Over-Optical Architecture for Mesh Networks,” Bell Labs Technical Report, 17 pages, 2004.
“The Network Simulator—ns-2,” www.isi.edu
snam
s, 2 pages, 1989.
J. Cao et al., “Internet Traffic Tends Toward Poisson and Independent as the Load Increases,” Nonlinear Estimation and Classification, eds., 26 pages, 2002.
F. Kelly, “Notes on Effective Bandwidths,” Stochastic Networks: Theory and Applications, pp. 1-29, 1996.
N. Spring et al., “Measuring ISP Topologies with Rocketfuel,” SIGCOMM, 13 pages, Aug. 2002.
R. Teixeira et al., “Characterizing and Measuring Path Diversity of Internet Topologies,” SIGMETRICS, 2 pages, Jun. 2003.
P. Srisuresh et al, “OSPF-TE: An Experimental Extension to OSPF for Traffic Engineering,” RFC, Network Working Group, pp. 1-45, Dec. 2002.
N.F. Maxemchuk, “Dispersity Routing,” RCA Laboratories, ICC, 4 pages, Jun. 1975.
J. Chen et al., “An Efficient Multipath Forwarding Method,” INFOCOM, pp. 1-9, Mar. 1998.
V. Paxson, “End-to-End Routing Behavior in the Internet,” Proceedings of the ACM SIGCOMM Computer Communication Review, vol. 26, No. 4, , pp. 1-18, Aug. 1996.
E. Gustafsson et al., “A Literature Survey on Traffic Dispersion,” IEEE Network, vol. 11, No. 2, pp. 28-36, Mar./Apr. 1997.
Cisco Systems, Inc., “Cisco Express Forwarding (CEF),” White Paper, pp. 1-4, 1997.
A. Elwalid, “MATE: MPLS Adaptive Traffic Engineering,” INFOCOM, pp. 1-10, Aug. 2003.
V. Paxson, “End-to-End Internet Packet Dynamics,” SIGCOMM, pp. 1-17, Jun. 1997.
R. Ludwig et al., “The Eifel Algorithm: Making TCP Robust Against Spurious Retransmissions,” Computer Communications, vol. 30, No. 1, 7 pages, Jan. 2000.
E. Blanton et al., “On Making TCP More Robust to Packet Reordering,” Computer Communication Review, vol. 32, pp. 1-11, Jan. 2002.
Z. Cao et al., “Performance of Hashing-Based Schemes for Internet Load Balancing,” IEEE INFOCOM, 10 pages, Mar. 2000.
S. Rost et al, “Rate-Aware Splitting of Aggregate Traffic,” Tech. Rep., MIT, pp. 1-12, 2002.
G. Kesidis et al., “Effective Bandwidths for Multiclass Markov Fluids and Other ATM Sources,” IEEE Trans. Networking, vol. 1, No. 4, pp. 424-428, Aug. 1993.
C-S. Chang et al., “Effective Bandwidth in High Speed Digital Networks,” IEEE Journal on Selected Areas in Communications, Nov. 1999.
D.D. Botvich et al., “Large Deviations, the Shape of the Loss Curve, and Economies of Scale in Large Multiplexers,” Queueing Systems, vol. 20, pp. 1-23, Mar. 1995.
C. Courcoubetis et al., “Buffer Overflow Asymptotics for a Buffer Handling Many Traffic Sources,” Journal of Applied Probability, vol. 33, pp. 1-21, 1996.
M. Mandjes et al., “Large Deviations for Small Buffers: An Insensitivity Result,” Queuing Systems, vol. 37, pp. 1-12, 2001.
C. Courcoubetis et al., “Effective Bandwidths for Stationary Sources,” Probability in Engineering and Information Sciences, vol. 9, No. 2, pp. 1-10, 1995.
N.G. Duffield et al., “Large Deviations and Overflow Probability for the Genera Single-Server Queue, with Applications,” Mathematical Proceedings of Cambridge Philosophical Society, pp. 1-19, Jul. 1994.
I. Norros, “A Storage Model with Self-Similar Input,” Queueing Systems, vol. 16, No. 3-4, pp. 1-9, 1994.
A. Erramilli et al., “Experimental Queueing Analysis with Long-Range Dependent Packet Traffic,” IEEE/ACM Transactions on Networking, vol. 4, pp. 1-16, 1996.
A. Erramilli et al., “Performance Impacts of Multi-Scaling in Wide Area TCP/IP Traffic,” Proceedings of IEEE Infocom, 8 pages, 2000.
J. Cao et al., “On the Nonstationarity of Internet Traffic,” ACM SIGMETRICS, vol. 29, No. 1, 11 pages, 2001.
J. Cao et al., “Bandwidth Estimation for Best-Effort Internet Traffic,” Statistical Science, pp. 1-51, 2004.
J. Cao et al., “Internet Traffic Tends Toward Poisson and Independent as the Load Increases,” Nonlinear Estimation and Classification, pp. 1-18, 2002.
W.E. Leland et al., “On the Self-Similar Nature of Ethernet Traffic,” ACM SIGComm, pp. 1-11, Sep. 1993.
M.S. Taqqu et al., “Proof of a Fundamental Result in Self-Similar Traffic Modeling,” Computer Communication Review, vol. 27, pp. 1-19, 1997.
“Passive Measurement and Analysis (PMA),” NLANR PMA, http://pma.nlanr.net, 2 pages, 2005.
G. Appenzeller et al., “Sizing Router Buffers,” SIGCOMM, 12 pages, Aug. 2004.

Affiliated with

Also associated with

Rating

Multi-path routing using intra-flow splitting does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Multi-path routing using intra-flow splitting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multi-path routing using intra-flow splitting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4075734