Show simple item record

AuthorBai, H.
AuthorShaban, K.
AuthorKhodeir, M.
AuthorGu, F.
AuthorCrichigno, J.
AuthorKhan, S.
AuthorGhani, N.
Available date2021-09-01T10:03:35Z
Publication Date2016
Publication NameComputer Communications
ResourceScopus
URIhttp://dx.doi.org/10.1016/j.comcom.2016.02.009
URIhttp://hdl.handle.net/10576/22514
AbstractAdvance 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.
SponsorThis 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.
Languageen
PublisherElsevier B.V.
SubjectOverlay 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
TitleOverlay network scheduling design
TypeArticle
Pagination28-38
Volume Number82
dc.accessType Abstract Only


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record