Results 1  10
of
426,867
Approximate Multicommodity Flow for WDM Networks Design
 in « SIROCCO 10 », series Proceedings in Informatics, number 17, Carleton Scientific
, 2003
"... The design of WDM optical networks is an issue for telecom operators since the spreading of this technology will not occur unless enough performance guarantees are provided. Motivated by the quest for efficient algorithms for the Routing and Wavelength Assignment problem (RWA), we address approximat ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
The design of WDM optical networks is an issue for telecom operators since the spreading of this technology will not occur unless enough performance guarantees are provided. Motivated by the quest for efficient algorithms for the Routing and Wavelength Assignment problem (RWA), we address
Multicommodity maxflow mincut theorems and their use in designing approximation algorithms
 J. ACM
, 1999
"... Abstract. In this paper, we establish maxflow mincut theorems for several important classes of multicommodity flow problems. In particular, we show that for any nnode multicommodity flow problem with uniform demands, the maxflow for the problem is within an O(log n) factor of the upper bound imp ..."
Abstract

Cited by 370 (6 self)
 Add to MetaCart
the flow result to design the first polynomialtime (polylog ntimesoptimal) approximation algorithms for wellknown NPhard optimization problems such as graph partitioning, mincut linear arrangement, crossing number, VLSI layout, and minimum feedback arc set. Applications of the flow results to path
Network information flow
 IEEE TRANS. INFORM. THEORY
, 2000
"... We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a pointtopoint communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information source ..."
Abstract

Cited by 1961 (24 self)
 Add to MetaCart
We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a pointtopoint communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 565 (0 self)
 Add to MetaCart
are given. We show that, if each flow augmentation is made along an augmenting path having a minimum number of arcs, then a maximum flow in an nnode network will be obtained after no more than ~(n a n) augmentations; and then we show that if each flow change is chosen to produce a maximum increase
Optimization Flow Control, I: Basic Algorithm and Convergence
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1999
"... We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm. In thi ..."
Abstract

Cited by 690 (64 self)
 Add to MetaCart
We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm
LanguageBased InformationFlow Security
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 2003
"... Current standard security practices do not provide substantial assurance that the endtoend behavior of a computing system satisfies important security policies such as confidentiality. An endtoend confidentiality policy might assert that secret input data cannot be inferred by an attacker throug ..."
Abstract

Cited by 821 (57 self)
 Add to MetaCart
through the attacker's observations of system output; this policy regulates information flow.
Wireless sensor networks: a survey
, 2002
"... This paper describes the concept of sensor networks which has been made viable by the convergence of microelectromechanical systems technology, wireless communications and digital electronics. First, the sensing tasks and the potential sensor networks applications are explored, and a review of fact ..."
Abstract

Cited by 1936 (23 self)
 Add to MetaCart
of factors influencing the design of sensor networks is provided. Then, the communication architecture for sensor networks is outlined, and the algorithms and protocols developed for each layer in the literature are explored. Open research issues for the realization of sensor networks are
Energy Conserving Routing in Wireless Adhoc Networks
, 2000
"... An adhoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and needs to reach a set of designated gateway nodes. Each node may adjust its power within a certain range that determines the set ..."
Abstract

Cited by 611 (2 self)
 Add to MetaCart
An adhoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and needs to reach a set of designated gateway nodes. Each node may adjust its power within a certain range that determines
Route Packets, Not Wires: OnChip Interconnection Networks
, 2001
"... Using onchip interconnection networks in place of adhoc global wiring structures the top level wires on a chip and facilitates modular design. With this approach, system modules (processors, memories, peripherals, etc...) communicate by sending packets to one another over the network. The structur ..."
Abstract

Cited by 864 (10 self)
 Add to MetaCart
Using onchip interconnection networks in place of adhoc global wiring structures the top level wires on a chip and facilitates modular design. With this approach, system modules (processors, memories, peripherals, etc...) communicate by sending packets to one another over the network
Consensus and cooperation in networked multiagent systems
 PROCEEDINGS OF THE IEEE
"... This paper provides a theoretical framework for analysis of consensus algorithms for multiagent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, timedelays, and performance guarantees. An overview of ..."
Abstract

Cited by 772 (2 self)
 Add to MetaCart
This paper provides a theoretical framework for analysis of consensus algorithms for multiagent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, timedelays, and performance guarantees. An overview
Results 1  10
of
426,867