Balanced paths in telecommunication networks: some computational results
نویسندگان
چکیده
Given a weighted directed network G, we consider the problem of computing k balanced paths from given source nodes to given destination nodes of G, i.e. k paths such that the difference in cost between the longest and the shortest path is minimized. The special case in which G is an acyclic network was theoretically investigated in [3]. It was proved that, in such a special case, the balanced path problem is solvable in pseudo-polynomial time. When arc-disjoint or node-disjoint balanced paths are looked for, then the problem is strongly NP-Hard.
منابع مشابه
Design of OSPF networks using subpath consistent routing patterns
We address the problem of designing IP networks where the traffic is routed using the OSPF protocol. Routers in OSPF networks use link weights set by an administrator for determining how to route the traffic. The routers use all shortest paths when traffic is routed to a destination, and the traffic is evenly balanced by the routers when several paths are equally short. We present a new model f...
متن کاملAn Algorithm to Obtain Possibly Critical Paths in Imprecise Project Networks
We consider criticality in project networks having imprecise activity duration times. It is well known that finding all possibly critical paths of an imprecise project network is an NP-hard problem. Here, based on a method for finding critical paths of crisp networks by using only the forward recursion of critical path method, for the first time an algorithm is proposed which can find all pos...
متن کاملRouting Through Virtual Paths in Layered Telecommunication Networks
We study a network connguration problem in telecommunications where one wants to set up paths in a capacitated network to accommodate given point-to-point traac demand. The problem is formulated as an integer linear programming model where 0-1 variables represent diierent paths. An associated integral polytope is studied and diier-ent classes of facets are described. These results are used in a...
متن کاملBalanced clusters and diffusion process in signed networks
In this paper we study the topology effects on diffusion process in signed networks. Considering a simple threshold model for diffusion process, it is extended to signed networks and some appropriate definitions are proposed. This model is a basic model that could be extended and applied in analyzing dynamics of many real phenomena such as opinion forming or innovation diffusion in social netwo...
متن کاملPerformance analysis in multi-hop radio networks with balanced fair resource sharing
Balanced fairness is a new resource sharing concept recently introduced by Bonald and Proutière. We extend the use of this notion to wireless multi-hop networks, e.g. ad hoc networks, where the link capacities at the flow level are not fixed but depend on lower layer issues such as scheduling and interference. Utilizing this extension we present the theoretical framework for flow level performa...
متن کامل