Sökning: "constraint-based routing"

Hittade 3 avhandlingar innehållade orden constraint-based routing.

  1. 1. Reliable and deterministic network services

    Författare :Florian-Daniel Otel; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; queuing delay guarantees; service curve; constraint-based routing; TCP; network security; arrival curve; network failure recovery; traffic engineering; network calculus; traffic envelope;

    Sammanfattning : In a post Internet bubble economic environment the obvious lack of any disruptive new technologies that could give new impetus to network growth (as, for example, experienced after the appearance of the Web) lead to a trivialization of network services: Aside grass-roots, semi-subterranean applications like file sharing, entertainment content swapping and on-line gaming, it can be argued that network services are presently used in a manner not very different than a decade ago. In this respect, one of the factors that can be identified as limiting further development is the perceived lack of guarantees with regard to network services. LÄS MER

  3. 2. Provisioning Strategies for Transparent Optical Networks Considering Transmission Quality, Security, and Energy Efficiency

    Författare :Amornrat Jirattigalachote; Lena Wosinska; Paolo Monti; Biswanath Mukherjee; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; transparent optical networks; routing and wavelength assignment; physical-layer impairments; signal quality; differentiation of services; physical-layer attacks; power equalizers; Greedy Randomized Adaptive Search Procedure GRASP ; green networks; energy awareness; dedicated path protection; shared path protection; survivable WDM networks;

    Sammanfattning : The continuous growth of traffic demand driven by the brisk increase in number of Internet users and emerging online services creates new challenges for communication networks. The latest advances in Wavelength Division Multiplexing (WDM) technology make it possible to build Transparent Optical Networks (TONs) which are expected to be able to satisfy this rapidly growing capacity demand. LÄS MER

  4. 3. High-level modelling and local search

    Författare :Magnus Ågren; Pierre Flener; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Datavetenskap; Computer Science;

    Sammanfattning : Combinatorial optimisation problems are ubiquitous in our society and appear in such varied guises as DNA sequencing, scheduling, configuration, airline-crew and nurse rostering, combinatorial auctions, vehicle routing, and financial portfolio design. Their efficient solution is crucial to many people and has been the target for much research during the last decades. LÄS MER