Algorithms and protocols for stateless constrained-based routing

Baoxian Zhang, Marwan M Krunz

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Quality of service (QoS) routing has generally been addressed in the context of reservation-based network services (e.g. ATM, IntServ), which require explicit (out of band) signaling of reservation requests and maintenance of per-flow state information. It has been recognized that the processing of per-flow state information poses scalability problems, especially at core routers. To remedy this situation, in this paper we introduce an approach for stateless QoS routing in IP networks that assumes no support for signaling or reservation from the network. Instead, our approach makes use of the currently unused two bits in the DiffServ (DS) byte of the IP packet header. Simple heuristics are used to identify a low-cost delay-constrained path. These heuristics essentially divide the end-to-end path into at most two 'superedges' that are connected by a 'relay node'. Routers that lie on the same superedge use either the cost metric or the delay metric (but not both) to forward the packet. Standard hop-by-hop forwarding is performed with respect to either metric. Two different approaches are presented for implementing the relay-based forwarding. In the first approach, a probing protocol is used to identify the relay node and the routing metrics of the superedges. Tunneling and packet encapsulation are then used to forward packets from the source node to the relay node and then from the relay node to the destination node. The second approach does not require probing, but instead relies on the time-to-live (TTL) field in the header of the IP packet. Simulations are presented to evaluate the cost performance of the various approaches.

Original languageEnglish (US)
Pages (from-to)1570-1580
Number of pages11
JournalComputer Communications
Volume26
Issue number14
DOIs
StatePublished - Sep 1 2003

Fingerprint

Routers
Quality of service
Costs
Automatic teller machines
Encapsulation
Scalability
Processing

Keywords

  • Delay-constrained path selection
  • QoS routing
  • Stateless routing

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Algorithms and protocols for stateless constrained-based routing. / Zhang, Baoxian; Krunz, Marwan M.

In: Computer Communications, Vol. 26, No. 14, 01.09.2003, p. 1570-1580.

Research output: Contribution to journalArticle

@article{1012a0e8295e4ba38e95a8a40472977d,
title = "Algorithms and protocols for stateless constrained-based routing",
abstract = "Quality of service (QoS) routing has generally been addressed in the context of reservation-based network services (e.g. ATM, IntServ), which require explicit (out of band) signaling of reservation requests and maintenance of per-flow state information. It has been recognized that the processing of per-flow state information poses scalability problems, especially at core routers. To remedy this situation, in this paper we introduce an approach for stateless QoS routing in IP networks that assumes no support for signaling or reservation from the network. Instead, our approach makes use of the currently unused two bits in the DiffServ (DS) byte of the IP packet header. Simple heuristics are used to identify a low-cost delay-constrained path. These heuristics essentially divide the end-to-end path into at most two 'superedges' that are connected by a 'relay node'. Routers that lie on the same superedge use either the cost metric or the delay metric (but not both) to forward the packet. Standard hop-by-hop forwarding is performed with respect to either metric. Two different approaches are presented for implementing the relay-based forwarding. In the first approach, a probing protocol is used to identify the relay node and the routing metrics of the superedges. Tunneling and packet encapsulation are then used to forward packets from the source node to the relay node and then from the relay node to the destination node. The second approach does not require probing, but instead relies on the time-to-live (TTL) field in the header of the IP packet. Simulations are presented to evaluate the cost performance of the various approaches.",
keywords = "Delay-constrained path selection, QoS routing, Stateless routing",
author = "Baoxian Zhang and Krunz, {Marwan M}",
year = "2003",
month = "9",
day = "1",
doi = "10.1016/S0140-3664(02)00262-1",
language = "English (US)",
volume = "26",
pages = "1570--1580",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "14",

}

TY - JOUR

T1 - Algorithms and protocols for stateless constrained-based routing

AU - Zhang, Baoxian

AU - Krunz, Marwan M

PY - 2003/9/1

Y1 - 2003/9/1

N2 - Quality of service (QoS) routing has generally been addressed in the context of reservation-based network services (e.g. ATM, IntServ), which require explicit (out of band) signaling of reservation requests and maintenance of per-flow state information. It has been recognized that the processing of per-flow state information poses scalability problems, especially at core routers. To remedy this situation, in this paper we introduce an approach for stateless QoS routing in IP networks that assumes no support for signaling or reservation from the network. Instead, our approach makes use of the currently unused two bits in the DiffServ (DS) byte of the IP packet header. Simple heuristics are used to identify a low-cost delay-constrained path. These heuristics essentially divide the end-to-end path into at most two 'superedges' that are connected by a 'relay node'. Routers that lie on the same superedge use either the cost metric or the delay metric (but not both) to forward the packet. Standard hop-by-hop forwarding is performed with respect to either metric. Two different approaches are presented for implementing the relay-based forwarding. In the first approach, a probing protocol is used to identify the relay node and the routing metrics of the superedges. Tunneling and packet encapsulation are then used to forward packets from the source node to the relay node and then from the relay node to the destination node. The second approach does not require probing, but instead relies on the time-to-live (TTL) field in the header of the IP packet. Simulations are presented to evaluate the cost performance of the various approaches.

AB - Quality of service (QoS) routing has generally been addressed in the context of reservation-based network services (e.g. ATM, IntServ), which require explicit (out of band) signaling of reservation requests and maintenance of per-flow state information. It has been recognized that the processing of per-flow state information poses scalability problems, especially at core routers. To remedy this situation, in this paper we introduce an approach for stateless QoS routing in IP networks that assumes no support for signaling or reservation from the network. Instead, our approach makes use of the currently unused two bits in the DiffServ (DS) byte of the IP packet header. Simple heuristics are used to identify a low-cost delay-constrained path. These heuristics essentially divide the end-to-end path into at most two 'superedges' that are connected by a 'relay node'. Routers that lie on the same superedge use either the cost metric or the delay metric (but not both) to forward the packet. Standard hop-by-hop forwarding is performed with respect to either metric. Two different approaches are presented for implementing the relay-based forwarding. In the first approach, a probing protocol is used to identify the relay node and the routing metrics of the superedges. Tunneling and packet encapsulation are then used to forward packets from the source node to the relay node and then from the relay node to the destination node. The second approach does not require probing, but instead relies on the time-to-live (TTL) field in the header of the IP packet. Simulations are presented to evaluate the cost performance of the various approaches.

KW - Delay-constrained path selection

KW - QoS routing

KW - Stateless routing

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

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

U2 - 10.1016/S0140-3664(02)00262-1

DO - 10.1016/S0140-3664(02)00262-1

M3 - Article

AN - SCOPUS:0038487232

VL - 26

SP - 1570

EP - 1580

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 14

ER -