Skip to main content

and
  1. 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...

    Gábor Rétvári, Róbert Szabó, József J. Bíró in Networking 2004 (2004)

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

    András Császár, Attila Takács, Róbert Szabó in NETWORKING 2002: Networking Technologies, … (2002)

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

    Lars Westberg, András Császár, Georgios Karagiannis in Protocols for High Speed Networks (2002)