A Unified Framework for Multipath Routing for Unicast and Multicast Traffic

Guven, Tuna; La, Richard J.; Shayman, Mark A.; Bhattacharjee, Bobby

doi:10.1109/tnet.2007.909686

Cited by 9 publications

(4 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Also, [18] uses LT 1 codes to reduce cache pollution which improves network performance. Moreover, [19] considers the effect of coding on the multiple multicast problem. Interested reader can also see [20] which is a good review on the role of network coding for multimedia delivery.…”

Section: Related Workmentioning

confidence: 99%

Coded Load Balancing in Cache Networks

Siavoshani

Parvaresh

Pourmiri

et al. 2020

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

We consider a cache network consisting of storage-enabled servers forming a distributed content delivery scenario. Each incoming content request, arriving uniformly at random to these servers, will be redirected to one or more responsible servers for that request. While assigning each request to its nearest available replica seems to be a reasonable solution, specifically in terms of communication cost, it will result in overloaded servers. Thus, alternatively, we investigate a coded scheme which will address this problem. In this scheme, coded chunks of original files are stored in servers based on the files popularity distribution, which we consider to be Zipf. Then, upon each request arrival, by delivering enough coded chunks to the request origin, the request can be decoded.Specifically, we show that if n requests are assigned to n servers based on the proposed coded scheme, the maximum load of servers will be Θ(1), while in the nearest replica strategy the maximum load is Θ(log n). More surprisingly, this coded scheme will have the same communication cost performance as the nearest replica strategy, asymptotically. Finally, our numerical results show that the coded scheme surpasses the uncoded one even in non-asymptotic regimes.

show abstract

Section: Related Workmentioning

confidence: 99%

Coded Load Balancing in Cache Networks

Siavoshani

Parvaresh

Pourmiri

et al. 2020

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…(ii) In [2], multipath diversity is improved in the intermediate networks on the internet protocol (IP) layer, while some modification has to be imposed on network infrastructures, e.g., router. Alternatively, overlay relays are adopted to redirect network traffic to multiple overlay paths as in [4][5][6][7][8]. In this paper, we mainly consider relevant two issues of generating multiple relay-based paths on overlay networks, namely (1) the topology match between overlay and underlay networks, and (2) generating multiple paths with high path diversity.…”

Section: Introductionmentioning

confidence: 99%

A Multi-Dimension Spatial Method for Topology Awareness and Multipath Generating

Guan¹,

Lei²,

Zhang³

et al. 2019

Symmetry

View full text Add to dashboard Cite

Multipath diversity significantly impacts multipath transmission quality. Enough multipath diversity would minimize the negative influence brought by an individual path, thus improving tolerance capability of network congestion and failure. However, multipath diversity is hard to guarantee on overlay networks because of inaccurate awareness of underlay network and multipath generating methods considering little about underlay diversity. In this paper, we design a multi-dimension spatial method for topology awareness and multipath generating. Analyzing that the complicated underlay networks with multiple autonomous systems reduce the accuracy of network positioning for topology awareness, we decompose the underlay networks into multiple dimensions, namely intra and inter autonomous system dimensions. We generate independent views for each autonomous system and merge views by embedding exchange points. Then, we design some spatial mechanisms to evaluate link diversity and to constrain multipath generating. Based on the multi-dimensional view, multipath generating is conducted in inter and intra autonomous system phases. Experiments demonstrate that the proposed method improves topology awareness accuracy and guarantees multipath diversity better and the transmission quality is improved.

show abstract

“…Therefore, by following this approach, link capacities are not regarded as hard constraints, as in the usual formulations of routing problems (Refs. [9][10][11][12][13][14][15] just to mention a few).…”

Section: Introduction: a Future Internet Consistent Approach To Netwomentioning

confidence: 99%

“…For example, Refs. and demonstrate the advantages of multi‐path routing with respect to single‐path routing in terms of network performance; considers the multi‐path routing problem under bandwidth and delay constraints; formulates the multi‐path routing problem as an utility maximization problem with bandwidth constraints; extends the multi‐path routing to multicast flows; and deal with the multi‐path routing as a max‐min optimization problem. As already explained, our approach to the routing task proposes the following innovations: (i) it provides a portfolio of control strategies (ii) it operates without any QoS constraints, because the admission controller is assumed to be in charge of them, and (iii) it performs a topological and logical network partitioning to improve the quality of the solution and to reduce the complexity of the optimization task.…”

Section: Introduction: a Future Internet Consistent Approach To Netwomentioning

confidence: 99%

Network decomposition and multi‐path routing optimal control

Bruni

Priscoli

Koch

et al. 2012

Trans. Emerging Tel. Tech.

View full text Add to dashboard Cite

In this work we face the Routing problem defined as an optimal control problem, with control variables representing the percentages of each flow routed along the available paths (multi‐path routing), and a set of cost functions corresponding to the two different objectives of traffic balancing and bottleneck load minimization. A key issue considered in this paper is the possibility of splitting the given network in sub‐networks, each one controlled by a separate subset of variables. This of course designs a decomposition of the original control problem in a set of easier‐to‐be‐dealt‐with lower dimensional problems. Some simulation results validate the procedure. Copyright © 2012 John Wiley & Sons, Ltd.

show abstract

A Unified Framework for Multipath Routing for Unicast and Multicast Traffic

Cited by 9 publications

References 30 publications

Coded Load Balancing in Cache Networks

Coded Load Balancing in Cache Networks

A Multi-Dimension Spatial Method for Topology Awareness and Multipath Generating

Network decomposition and multi‐path routing optimal control

Contact Info

Product

Resources

About