![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity
The question, whether an optional set of routes can be represented as shortest paths, and if yes, then how, has been a rather scarcely investigated problem up until now. In turn, an algorithm that, given an ar...
-
Chapter and Conference Paper
Severe Congestion Handling with Resource Management in Diffserv on Demand
Quality of Service (QoS) for the Internet has been discussed for a long time without any major breakthrough. There are several reasons, the main one being the lack of a scalable, simple, fast and low cost QoS ...
-
Chapter and Conference Paper
Resource Management in Diffserv (RMD): A Functionality and Performance Behavior Overview
The flexibility and the wide deployment of IP technologies have driven the development of IP-based solutions for wireless networks, like IP-based Radio Access Networks (RAN). These networks have different char...