Sciweavers

6110 search results - page 373 / 1222
» Graceful Network Operations
Sort
View
194
Voted
HIS
2009
15 years 4 months ago
A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
Bin Hu, Günther R. Raidl
CORR
2010
Springer
149views Education» more  CORR 2010»
15 years 4 months ago
Hallway Monitoring: Distributed Data Processing with Wireless Sensor Networks
We present a sensor network testbed that monitors a hallway. It consists of 120 load sensors and 29 passive infrared sensors (PIRs), connected to 30 wireless sensor nodes. There ar...
Tobias Baumgartner, Sándor P. Fekete, Tom K...
INFOCOM
2011
IEEE
14 years 10 months ago
Utility optimization for dynamic peer-to-peer networks with tit-for-tat constraints
— We consider a peer-to-peer network where nodes can send and receive files amongst their peers. File requests are generated randomly, and each new file can correspond to a dif...
Michael J. Neely, Leana Golubchik

Publication
151views
17 years 5 months ago
The OSU Scheme for Congestion Avoidance in ATM Networks: Lessons Learnt and Extensions
The OSU scheme is a rate-based congestion avoidance scheme for ATM networks using explicit rate indication. This work was one of the first attempts to define explicit rate switch m...
Raj Jain, Shiv Kalyanaraman and Ram Viswanathan
PERCOM
2004
ACM
16 years 6 months ago
Virtual Paths Routing: A Highly Dynamic Routing Protocol for Ad Hoc Wireless Networks
In this paper, we introduce the Virtual Paths Routing (VPR) Protocol for ad hoc wireless networks. VPR provides highly dynamic, correct, and efficient paths creation and maintenan...
Abdulrahman H. Altalhi, Golden G. Richard III