Sciweavers

410 search results - page 35 / 82
» Upgrading Shortest Paths in Networks
Sort
View
INFOCOM
2007
IEEE
15 years 7 months ago
DEFT: Distributed Exponentially-Weighted Flow Splitting
— Network operators control the flow of traffic through their networks by adapting the configuration of the underlying routing protocols. For example, they tune the integer li...
Dahai Xu, Mung Chiang, Jennifer Rexford
COMCOM
2006
79views more  COMCOM 2006»
15 years 1 months ago
How many sensors for an acceptable breach detection probability?
Determining the required number of sensors to be deployed is a critical decision for surveillance wireless sensor networks. In this paper, we discuss the trade-off between the num...
Ertan Onur, Cem Ersoy, Hakan Deliç
INFOCOM
2003
IEEE
15 years 6 months ago
Detecting Network Intrusions via Sampling: A Game Theoretic Approach
In this paper, we consider the problem of detecting an intruding packet in a communication network. Detection is accomplished by sampling a portion of the packets transiting selec...
Murali S. Kodialam, T. V. Lakshman
ICC
2008
IEEE
167views Communications» more  ICC 2008»
15 years 8 months ago
Traceroute-Based Topology Inference without Network Coordinate Estimation
Abstract— Underlay topology information is important to construct efficient overlay networks. To achieve end-to-end network topology inference among a group of hosts, traceroute...
Xing Jin, Wanqing Tu, S.-H. Gary Chan
CIC
2006
102views Communications» more  CIC 2006»
15 years 2 months ago
On-line Algorithm for Server Selection of Video Streaming over P2P Networks
We consider a video streaming application over P2P networks and introduce the P2P on-line server selection problem. This task is related to the classic K-server problem, known fro...
Hao Wang, Andras Farago