Spatial-temporal routing for supporting end-to-end hard deadlines in multi-hop networks

Xin Liu, Lei Ying

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

We consider the problem of routing packets with end-to-end hard deadlines in communication networks. The problem is challenging due to the complex spatial-temporal correlation among flows with different deadlines. To tackle this challenging problem, we introduce the concepts of virtual links/routes to incorporate end-to-end deadline constraints into routing and propose a novel virtual queue architecture to guide the spatial-temporal routing which specifies where and when a packet should be routed. The proposed policy can support any periodic constant traffic within the network throughput region. Our simulations further show that the policy outperforms traditional policies such as backpressure and earliest-deadline-first (EDF) for general traffic flows.

Original languageEnglish (US)
Title of host publication2016 50th Annual Conference on Information Systems and Sciences, CISS 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages262-267
Number of pages6
ISBN (Electronic)9781467394574
DOIs
StatePublished - Apr 26 2016
Event50th Annual Conference on Information Systems and Sciences, CISS 2016 - Princeton, United States
Duration: Mar 16 2016Mar 18 2016

Other

Other50th Annual Conference on Information Systems and Sciences, CISS 2016
CountryUnited States
CityPrinceton
Period3/16/163/18/16

Fingerprint

Telecommunication networks
Throughput

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Liu, X., & Ying, L. (2016). Spatial-temporal routing for supporting end-to-end hard deadlines in multi-hop networks. In 2016 50th Annual Conference on Information Systems and Sciences, CISS 2016 (pp. 262-267). [7460512] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CISS.2016.7460512

Spatial-temporal routing for supporting end-to-end hard deadlines in multi-hop networks. / Liu, Xin; Ying, Lei.

2016 50th Annual Conference on Information Systems and Sciences, CISS 2016. Institute of Electrical and Electronics Engineers Inc., 2016. p. 262-267 7460512.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Liu, X & Ying, L 2016, Spatial-temporal routing for supporting end-to-end hard deadlines in multi-hop networks. in 2016 50th Annual Conference on Information Systems and Sciences, CISS 2016., 7460512, Institute of Electrical and Electronics Engineers Inc., pp. 262-267, 50th Annual Conference on Information Systems and Sciences, CISS 2016, Princeton, United States, 3/16/16. https://doi.org/10.1109/CISS.2016.7460512
Liu X, Ying L. Spatial-temporal routing for supporting end-to-end hard deadlines in multi-hop networks. In 2016 50th Annual Conference on Information Systems and Sciences, CISS 2016. Institute of Electrical and Electronics Engineers Inc. 2016. p. 262-267. 7460512 https://doi.org/10.1109/CISS.2016.7460512
Liu, Xin ; Ying, Lei. / Spatial-temporal routing for supporting end-to-end hard deadlines in multi-hop networks. 2016 50th Annual Conference on Information Systems and Sciences, CISS 2016. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 262-267
@inproceedings{9d1d57bf0d1f4ce6a73a65f16b11cfc6,
title = "Spatial-temporal routing for supporting end-to-end hard deadlines in multi-hop networks",
abstract = "We consider the problem of routing packets with end-to-end hard deadlines in communication networks. The problem is challenging due to the complex spatial-temporal correlation among flows with different deadlines. To tackle this challenging problem, we introduce the concepts of virtual links/routes to incorporate end-to-end deadline constraints into routing and propose a novel virtual queue architecture to guide the spatial-temporal routing which specifies where and when a packet should be routed. The proposed policy can support any periodic constant traffic within the network throughput region. Our simulations further show that the policy outperforms traditional policies such as backpressure and earliest-deadline-first (EDF) for general traffic flows.",
author = "Xin Liu and Lei Ying",
year = "2016",
month = "4",
day = "26",
doi = "10.1109/CISS.2016.7460512",
language = "English (US)",
pages = "262--267",
booktitle = "2016 50th Annual Conference on Information Systems and Sciences, CISS 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - Spatial-temporal routing for supporting end-to-end hard deadlines in multi-hop networks

AU - Liu, Xin

AU - Ying, Lei

PY - 2016/4/26

Y1 - 2016/4/26

N2 - We consider the problem of routing packets with end-to-end hard deadlines in communication networks. The problem is challenging due to the complex spatial-temporal correlation among flows with different deadlines. To tackle this challenging problem, we introduce the concepts of virtual links/routes to incorporate end-to-end deadline constraints into routing and propose a novel virtual queue architecture to guide the spatial-temporal routing which specifies where and when a packet should be routed. The proposed policy can support any periodic constant traffic within the network throughput region. Our simulations further show that the policy outperforms traditional policies such as backpressure and earliest-deadline-first (EDF) for general traffic flows.

AB - We consider the problem of routing packets with end-to-end hard deadlines in communication networks. The problem is challenging due to the complex spatial-temporal correlation among flows with different deadlines. To tackle this challenging problem, we introduce the concepts of virtual links/routes to incorporate end-to-end deadline constraints into routing and propose a novel virtual queue architecture to guide the spatial-temporal routing which specifies where and when a packet should be routed. The proposed policy can support any periodic constant traffic within the network throughput region. Our simulations further show that the policy outperforms traditional policies such as backpressure and earliest-deadline-first (EDF) for general traffic flows.

UR - http://www.scopus.com/inward/record.url?scp=84992418328&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84992418328&partnerID=8YFLogxK

U2 - 10.1109/CISS.2016.7460512

DO - 10.1109/CISS.2016.7460512

M3 - Conference contribution

SP - 262

EP - 267

BT - 2016 50th Annual Conference on Information Systems and Sciences, CISS 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -