Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
IEEE/ACM Transactions on Networking (TON)
Deriving traffic demands for operational IP networks: methodology and experience
IEEE/ACM Transactions on Networking (TON)
Pop-level and access-link-level traffic dynamics in a tier-1 POP
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
QoS-IP 2003 Proceedings of the Second International Workshop on Quality of Service in Multiservice IP Networks
Profile-based routing and traffic engineering
Computer Communications
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
Competitive routing of virtual circuits in ATM networks
IEEE Journal on Selected Areas in Communications
Network prefix-level traffic profiling: Characterizing, modeling, and evaluation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Measurement-Based optimization of a 3g core network: a case study
NEW2AN'06 Proceedings of the 6th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking
Journal of Network and Computer Applications
Hi-index | 0.00 |
In this work we consider the problem of routing bandwidth-guaranteed flows with time-variable bandwidth profiles on a MPLS network. We assume that each demand is routed in an explicitly routed LSP, and the amount of bandwidth that must be reserved along the LSP varies during the day according to a piece-wise mask, which is known in advance. The time-of-day bandwidth profiles can be explicitly declared by the VPN customers in the SLA, or alternatively predicted by the ISP based on past measurements. In this framework, we propose a simple on-line algorithm for optimal selection of LSP paths. We also provide an ILP formulation for the associated off-line problem, and adopt it as a reference performance bound for the on-line algorithm. Additionally, we compare the performances of fixed and variable routing in presence of time-variable bandwidth profiles. The results presented here suggest that the a priori knowledge of the per-demand traffic profiles can be exploited to achieve a fixed routing configuration, which can be marginally improved by variable reconfigurations. We relate our findings with a couple of previous works that in different application contexts achieved similar results.