Results 1 
5 of
5
Survivable Network Design: The Capacitated Minimum Spanning Network Problem
 In Proc. 7th INFORMS Telecommunications Conf
, 2004
"... We are given an undirected graph G = (V; E) with positive weights on its vertices representing demands, and nonnegative costs on its edges. Also given are a capacity constraint k, and root vertex r 2 V . In this paper, we consider the capacitated minimum spanning network (CMSN) problem, which as ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We are given an undirected graph G = (V; E) with positive weights on its vertices representing demands, and nonnegative costs on its edges. Also given are a capacity constraint k, and root vertex r 2 V . In this paper, we consider the capacitated minimum spanning network (CMSN) problem, which asks for a minimum cost spanning network such that the the removal of r and its incident edges breaks the network into a number of components (groups), each of which is 2edgeconnected with a total weight of at most k. We show that the CMSN problem is NPhard, and present a 4approximation algorithm for graphs satisfying triangle inequality. We also show how to obtain similar approximation results for a related 2vertexconnected CMSN problem.
Designing wireless radio access networks for third generation cellular networks
 in Proc. IEEE INFOCOM
, 2005
"... Abstruct In third generation (3G) cellular networks, base stations ate connected to base station controllers by pointtopoint (usually TlIE1) links. However, today’s TllEl based hackhaul network is not a good match for next generation wireless networks because symmetric Tls is not an efficient way ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstruct In third generation (3G) cellular networks, base stations ate connected to base station controllers by pointtopoint (usually TlIE1) links. However, today’s TllEl based hackhaul network is not a good match for next generation wireless networks because symmetric Tls is not an efficient way to carry bursty and asymmetric data traffic. In this paper, we propose designing an IEEE 802.16based wireless radio access network to carry the traffic from the base station to the radio network controller. 802.16 has several characteristics that make it a better match for 36 radio acres % networks including its support for Time Division Duplex mode that supports asymmetry eficiently. In this paper, we tackle the following question: given a layout of base stations and base station controllers, how do we design the topology of the 802.16 radio access network connecting the base stations to the base station controller that minimizes the number of 802.16 links used while meeting the expected demands of traffic frodto the base station?? We make three contributions: we first sbow that finding the optimal solution to the problem is NPhard, We then provide heuristics that perform close to the optimal solution. Finally, we address the reliability issue of failure of 802.16 links or nodes by designing algorithms to create topologies that can handle single failures effectively. I.
Dynamic Capacitated Minimum Spanning Trees
 In Proc. 3rd Intl. Conf. on Networking (ICN
, 2004
"... Given a set of terminals, each associated with a positive number denoting the traffic to be routed to a central terminal (root), the Capacitated Minimum Spanning Tree (CMST) problem asks for a minimum spanning tree, spanning all terminals, such that the amount of traffic routed from a subtree, linke ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Given a set of terminals, each associated with a positive number denoting the traffic to be routed to a central terminal (root), the Capacitated Minimum Spanning Tree (CMST) problem asks for a minimum spanning tree, spanning all terminals, such that the amount of traffic routed from a subtree, linked to the root by an edge, does not exceed the given capacity constraint k. The CMST problem is NPcomplete and has been extensively studied for the past 40 years. Current best heuristics, in terms of cost and computation time (O(n log n)), are due to Esau and Williams [1], and Jothi and Raghavachari [2].
unknown title
"... • We present a K − 1 simple approximation algorithm, this algorithm is suitable for small values of K. • We also present a 6approximation algorithm which is suitable for all values of K. – For k = 2 we present a 10approximation algorithm, suitable for all values ..."
Abstract
 Add to MetaCart
• We present a K − 1 simple approximation algorithm, this algorithm is suitable for small values of K. • We also present a 6approximation algorithm which is suitable for all values of K. – For k = 2 we present a 10approximation algorithm, suitable for all values
Allocating Virtual and Physical Flows for Multiagent Teams in Mutable, Networked Environments
, 2012
"... The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the U.S. Army Research Laboratory, the U.S. Government, the U.K. Ministry of Defence or the U.K. Government. Keywords: mu ..."
Abstract
 Add to MetaCart
The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the U.S. Army Research Laboratory, the U.S. Government, the U.K. Ministry of Defence or the U.K. Government. Keywords: multiple source network flow, partial centralization, network augmentation, The movement of information, agents, and resources is a crucial part of cooperative multiagent systems: decision makers must receive data in a timely manner to make good decisions, while agents and resources must be provided at appropriate locations for tasks to be completed. Flow allocation meets these conditions by computing paths through the environment, be it the communication network (for data or software agents) or the physical world (for embodied agents or physical resources). This thesis addresses the problem of allocating flows when the environment is mutable, either by the agents or by a malicious adversary. In this thesis I represent the environment as a graph with agents and tasks represented by source and sink nodes, respectively. The agents are partitioned