Overlay network scheduling design
Author | Bai, H. |
Author | Shaban, K. |
Author | Khodeir, M. |
Author | Gu, F. |
Author | Crichigno, J. |
Author | Khan, S. |
Author | Ghani, N. |
Available date | 2021-09-01T10:03:35Z |
Publication Date | 2016 |
Publication Name | Computer Communications |
Resource | Scopus |
Abstract | Advance reservation services are being used by a range of applications to schedule connection bandwidth resources at future time intervals. To date many different algorithms have been developed to support various point-to-point reservation models. However, with expanding data distribution needs there is a need to schedule more complex service types to provide connectivity between multiple sites/locations. In particular, these offerings can help improve network resource utilization and help expand carrier service portfolios. Along these lines, this paper presents a novel, scalable optimization solution to schedule (virtual) overlay networks with fixed end-point nodes. An improved re-routing heuristic scheme is also proposed and analyzed for comparison purposes. 2016 Elsevier B.V. All rights reserved. |
Sponsor | This work was made possible by the NPRP 5-137-2-045 Grant from the Qatar National Research Fund (a member of Qatar Foundation). The statements made herein are solely the responsibility of the authors. |
Language | en |
Publisher | Elsevier B.V. |
Subject | Overlay networks Reservation systems Scheduling algorithms Telecommunication networks Advance reservation Bandwidth resource Data distribution Heuristic schemes Network resource utilization Network scheduling Optimization solution Traffic scheduling Complex networks |
Type | Article |
Pagination | 28-38 |
Volume Number | 82 |
Check access options
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |
This item appears in the following Collection(s)
-
Computer Science & Engineering [2402 items ]