On time dependent routing algorithms for open marketplaces of path services with support for in-advance path reservation

Open marketplaces of path services are the next step towards realizing “routing-as-a-service.” Such marketplaces will enable users to select from a set of path services offered by multiple competing network providers so as to construct customized end-to-end paths for their applications. This is anal...

Full description

Saved in:
Bibliographic Details
Published in:Computer networks (Amsterdam, Netherlands : 1999) Netherlands : 1999), 2018-06, Vol.138, p.201-212
Main Authors: Bhat, Shireesh, Rouskas, George N., Katib, Iyad
Format: Article
Language:English
Subjects:
Algorithms
Computer networks
Routing
Stitching
Time dependence
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Open marketplaces of path services are the next step towards realizing “routing-as-a-service.” Such marketplaces will enable users to select from a set of path services offered by multiple competing network providers so as to construct customized end-to-end paths for their applications. This is analogous to online travel marketplaces that allow users to explore travel options and book their travel. We review the requirements for path planners to assist users in stitching together available path services which are time sensitive. We define the problem of finding multi-criteria time-constrained paths in this context, and present algorithms to construct these paths and also provide support for in-advance path reservation.
ISSN:1389-1286
1872-7069
DOI:10.1016/j.comnet.2018.04.006