An approach to path-splitting in multipath networks

Krishnan, R.; Silvester, J.A.

doi:10.1109/icc.1993.397509

Cited by 5 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We will have little to say about these functions in this paper. Examples of objectives include: increasing end-to-end path capacity (bandwidth) [15], providing &OS guarantees E221 , or reducing service blocking probabilities…”

Section: Multipath Routing and Forwardingmentioning

confidence: 99%

An efficient multipath forwarding method

Chen

Druschel²,

Subramanian³

Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Compu

View full text Add to dashboard Cite

We motivate and formally define dynamic multipath routing and present the problem of packet forwarding in the multipath routing context. We demonstrate that for multipath sets that are suffis matched, forwarding can be efficiently implemented with (1) a per packet overhead of a small, fixed-length path identifier, and (2) router space overhead linear in K , the number of alternate paths between a source and a destination. We derive multipath forwarding schemes for suffix matched path sets computed by both de-centralized (link-state) and distributed (distance-vector) routing algorithms. We also prove that (1) distributed multipath routing algorithms compute suffix matched multipath sets, and (2) for the criterion of ranked k-shortest paths, de-centralized routing algorithms also yield suffix matched multipath sets.

show abstract

Section: Multipath Routing and Forwardingmentioning

confidence: 99%

An efficient multipath forwarding method

Chen

Druschel²,

Subramanian³

Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Compu

View full text Add to dashboard Cite

show abstract

“…Adaptive routing schemes [19], [20] have been proposed to spread packets dynamically over multiple paths according to the network load. These procedures require parameters to determine the load distribution.…”

Section: Introductionmentioning

confidence: 99%

Flow assignment and packet scheduling for multipath networks

Leung¹,

Li²

Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042)

View full text Add to dashboard Cite

Abstract:In this paper, we propose a framework to study how to route packets efficiently in multipath communication networks. Two traffic congestion control techniques, namely, flow assignment and packet scheduling, have been investigated. The flow assignment mechanism defines an optimal splitting of data traffic on multiple disjoint paths. The resequencing delay and the usage of the resequencing buffer can be reduced significantly by properly scheduling the sending order of all packets, say, according to their expected arrival times at the destination. To illustrate our model, and without loss of generality, Gaussian distributed end-toend path delays are used. Our analytical results show that the techniques are very effective in reducing the average end-to-end path delay, the average packet resequencing delay, and the average resequencing buffer occupancy for various path configurations. These promising results can form a basis for designing future adaptive multipath protocols.

show abstract

Rate-based path selection for shortest path bridging in access networks

Nakayama

2014

2014 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

An approach to path-splitting in multipath networks

Cited by 5 publications

References 6 publications

An efficient multipath forwarding method

An efficient multipath forwarding method

Flow assignment and packet scheduling for multipath networks

Rate-based path selection for shortest path bridging in access networks

Contact Info

Product

Resources

About