Quality of service based routing

Apostolopoulos, George; Guérin, Roch; Kamat, S.; Tripathi, Satish K.

doi:10.1145/285237.285251

Cited by 241 publications

(88 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The lexicographic products of S and W also correspond to practically relevant routing policies: widest-shortest path routing WS = S × W prefers from the set of shortest paths the one with the highest free capacity [1], and shortest-widest path SW = W ×S, just contrarily, prefers the shortest from the set of widest paths [8,16].…”

Section: An Algebraic Model For Policy Routingmentioning

confidence: 99%

On the Computational Complexity of Policy Routing

Zubor

Kő̈rösi

Gulyás

et al. 2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. With the advent of new network architectures, like Software Defined Networks, the rules governing the way traffic is routed through the network are becoming increasingly complex. In this paper, we revisit the theoretic underpinnings of policy routing in the light of the new requirements. We show that certain simple but plausible algebraic properties already induce intractable path selection instances, and we extend the algebraic description of policies for which the related path selection problem is guaranteed to be tractable with a new class, called polynomial finite algebras, which captures many real-life application domains.

show abstract

Section: An Algebraic Model For Policy Routingmentioning

confidence: 99%

On the Computational Complexity of Policy Routing

Zubor

Kő̈rösi

Gulyás

et al. 2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Some of the proposed heuristics only target special cases of the MC(O)P problem. For instance, when bandwidth is one of the constraints that must be satisfied by the path computation algorithm, the MCP problem is defined as a Bandwidth Restricted Path (BRP) problem [6][7][8][9][10]. Another popular subproblem is called Restricted Shortest Path (RSP) problem [11][12][13].…”

Section: Algorithmic Aspects In Qos Routingmentioning

confidence: 99%

“…However, this approach would lead to an excessive communication weight on the network and could also originate instability. Instead of distributing updates immediately after a change, the instant of distribution is generally controlled by triggering policies [6]. The process of flooding used by link-state protocols causes a burden that can consume an excessive amount of resources in the network, especially when used in QoS Routing schemes.…”

Section: Algorithmic and Dynamic Qos Routing Overheadmentioning

confidence: 99%

Research challenges in QoS routing

Masip-Bruin¹,

Yannuzzi

Domingo‐Pascual³

et al. 2006

Computer Communications

View full text Add to dashboard Cite

Quality of Service Routing is at present an active and remarkable research area, since most emerging network services require specialized Quality of Service (QoS) functionalities that cannot be provided by the current QoS-unaware routing protocols. The provisioning of QoS based network services is in general terms an extremely complex problem, and a significant part of this complexity lies in the routing layer. Indeed, the problem of QoS Routing with multiple additive constraints is known to be NP-hard. Thus, a successful and wide deployment of the most novel network services demands that we thoroughly understand the essence of QoS Routing dynamics, and also that the proposed solutions to this complex problem should be indeed feasible and affordable. This article surveys the most important open issues in terms of QoS Routing, and also briefly presents some of the most compelling proposals and ongoing research efforts done both inside and outside the E-Next Community to address some of those issues. q

show abstract

“…OSPF, BGP) [3,5,15,17,49]. Several recent studies have acknowledged the need for scalable QoS routing solutions [4,11,27,29,48] and have given the stimulus for a number of proposals on how to integrate QoS routing into a Differentiated Services (DiffServ) framework [21,24,43]. For example, in one proposal that advocates integrating the traffic engineering and scalable reservation aspects of MPLS into the DiffServ architecture [21], QoS routing is suggested as a mechanism to establish 'MPLS paths' onto which aggregates of IP flows can be transported with given QoS.…”

Section: Motivationmentioning

confidence: 99%

Algorithms and protocols for stateless constrained-based routing

Zhang

Krunz

2003

Computer Communications

View full text Add to dashboard Cite

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. q

show abstract

Quality of service based routing

Cited by 241 publications

References 3 publications

On the Computational Complexity of Policy Routing

On the Computational Complexity of Policy Routing

Research challenges in QoS routing

Algorithms and protocols for stateless constrained-based routing

Contact Info

Product

Resources

About