Sciweavers

4781 search results - page 176 / 957
» Online algorithms for network design
Sort
View
ANTSW
2006
Springer
15 years 10 months ago
An Analysis of the Different Components of the AntHocNet Routing Algorithm
Abstract. Mobile ad hoc networks are a class of highly dynamic networks. In previous work, we developed a new routing algorithm, called AntHocNet, for these challenging network env...
Frederick Ducatelle, Gianni Di Caro, Luca Maria Ga...
VTC
2008
IEEE
119views Communications» more  VTC 2008»
16 years 29 days ago
On the Design of a Quality-Of-Service Driven Routing Protocol for Wireless Cooperative Networks
—In this paper, a quality-of-service driven routing protocol is proposed for wireless cooperative networks. The key contribution of the proposed protocol is to bring the performa...
Zhengguo Sheng, Zhiguo Ding, Kin K. Leung
MSS
2000
IEEE
130views Hardware» more  MSS 2000»
15 years 10 months ago
Design for a Decentralized Security System For Network Attached Storage
T This paper describes an architecture for a secure file system based on network-attached storage that guarantees end-to-end encryption for all user data. We describe the design of...
William E. Freeman, Ethan L. Miller
BELL
2006
71views more  BELL 2006»
15 years 6 months ago
Design tools for transparent optical networks
s span three levels of abstraction, from routing and reconfigurable add/drop multiplexer (ROADM) choice, to span engineering, to power dynamics simulation. Each level represents a ...
Chandra Chekuri, Paul Claisse, René-Jean Es...
INFORMS
2008
241views more  INFORMS 2008»
15 years 6 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker