Routing demands with time-varying bandwidth profiles on a MPLS network

Ricciato, Fabio; Monaco, U.

doi:10.1016/j.comnet.2004.07.012

Cited by 8 publications

(2 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…¶ With these assumptions, the problem studied in this paper is very similar to the bandwidth-constrained routing in wired networks, where a demand is accepted if and only if the network can provide the required bandwidth. The problem was studied in the context of LSP routing in MPLS networks, wherein the number of accepted demands (or equivalently, demand acceptance rate) is a widely used measure of the network performance [16][17][18][19][20].…”

Section: Problem Statementmentioning

confidence: 99%

“…If the required bandwidth cannot be guaranteed, the demand is rejected. A higher number of accepted demands implies better resource utilization and higher performance; hence, in the QoS provisioning context, the network performance is usually measured in terms of the acceptance rate of the traffic demands [16][17][18][19][20]. Consequently, to perform the desired comparisons between channel allocation schemes in the context, we need to measure acceptance rates obtained by dynamic and static channel allocation schemes.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On the performance and fairness of dynamic channel allocation in wireless mesh networks

Bakhshi

Khorsandi

2011

Int J Communication

View full text Add to dashboard Cite

SUMMARY Channel assignment in multichannel multiradio wireless mesh networks is a powerful resource management tool to exploit available multiple channels. Channels can be allocated either statically on the basis of long‐term steady state behavior of traffic or dynamically according to actual traffic demands. It is a common belief that dynamic schemes provide better performance; however, these two broad classes of channel allocation schemes have not been compared in detail. In this paper, we quantify the achievable performance gain and fairness improvement through an optimal dynamic channel allocation scheme. We develop optimal algorithms for a dynamic and three static schemes using mixed integer linear programming and compare them in the context of QoS provisioning, where network performance is measured in terms of acceptance rate of QoS sensitive traffic demands. Our extensive simulations show that static schemes should optimize channel allocation for long‐term traffic pattern and maintain max–min fairness to achieve acceptable performances. Although the dynamic and max–min fair static schemes accomplish the same fairness, the dynamic channel allocation outperforms the static scheme about 10% in most cases. In heavily overloaded regimes, especially when network resources are scarce, both have comparable performances, and the max–min fair scheme is preferred because it incurs less overhead. Copyright © 2011 John Wiley & Sons, Ltd.

show abstract

Section: Problem Statementmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

On the performance and fairness of dynamic channel allocation in wireless mesh networks

Bakhshi

Khorsandi

2011

Int J Communication

View full text Add to dashboard Cite

show abstract

A novel approach for the performance bound of QoS-aware data networks under greedy CAC policy

Bakhshi

Khorsandi

2013

Performance Evaluation

View full text Add to dashboard Cite

Resource optimization in realistic mobile backhaul networks

Lessmann¹

2015

2015 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

This paper proposes a resource management system that allows maximizing the traffic which can be served by a given mobile backhaul network. It does so by means of a novel path optimization algorithm that consists of an offline component (based on predicted traffic demand information) and an online component (for excess traffic). As opposed to previous traffic engineering approaches, which usually assume a fluid traffic model, our algorithm explicitly takes flow classification and thus splitting granularity into account. To improve network utilization, we introduce t time slots and allow m traffic matrices, where the number of m depends on the QoS classes to be differentiated. The algorithm is able to compute a highly efficient resource allocation for each QoS class (also taking availability requirements into account) and avoids re-routing of QoSsensitive traffic. We present a novel Genetic Algorithm for solving the offline problem. Evaluation is done using synthetic as well as real mobile backhaul data from European operators.

show abstract

Routing demands with time-varying bandwidth profiles on a MPLS network

Cited by 8 publications

References 15 publications

On the performance and fairness of dynamic channel allocation in wireless mesh networks

On the performance and fairness of dynamic channel allocation in wireless mesh networks

A novel approach for the performance bound of QoS-aware data networks under greedy CAC policy

Resource optimization in realistic mobile backhaul networks

Contact Info

Product

Resources

About