Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
—In this paper, we study the problem of computing the supported QoS from a source to a destination with multiple additive constraints. The problem has been shown to be NP-complet...
Ronghui Hou, King-Shan Lui, Ka-Cheong Leung, Fred ...
- In this work, we study the problem of maximizing lightpath reliability in optical mesh networks against simultaneous failures of multiple fiber links without using protection sch...
Abstract. The advancement of network induces great demands on a series of applications such as the multicast routing. This paper firstly makes a brief review on the algorithms in ...
— This paper addresses the problem of inter-domain QoS routing. We propose a solution based on virtual-trunk type aggregates corresponding to Service Level Agreements (SLA) for d...