Sciweavers

410 search results - page 68 / 82
» Upgrading Shortest Paths in Networks
Sort
View
SECON
2008
IEEE
15 years 6 months ago
Practical Algorithms for Gathering Stored Correlated Data in a Network
—Many sensing systems remotely monitor/measure an environment at several sites, and then report these observations to a central site. We propose and investigate several practical...
Ramin Khalili, James F. Kurose
EUROMICRO
2007
IEEE
15 years 6 months ago
A Light-Weight Implementation Scheme of the Tree Morphing Protocol for Mobile Multicast Sources
Multicast network services advantageously complement multimedia information and communication technologies, as they open up the realm for highly scalable multicustomer application...
Olaf Christ, Thomas C. Schmidt, Matthias Wähl...
ICNP
1998
IEEE
15 years 4 months ago
Statistical Anomaly Detection for Link-State Routing Protocols
The JiNao project at MCNC/NCSU focuses on detecting intrusions, especially insider attacks, against OSPF (Open Shortest Path First) routing protocol. This paper presents the imple...
D. Qu, Brain Vetter, Feiyi Wang, R. Narayan, Shyht...
92
Voted
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
15 years 1 months ago
IMproved results for route planning in stochastic transportation
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
Justin A. Boyan, Michael Mitzenmacher
SIGMETRICS
2004
ACM
108views Hardware» more  SIGMETRICS 2004»
15 years 5 months ago
Uncooperative congestion control
—Traditionally uncooperative rate control schemes have implied open loop protocols such as UDP, CBR. In this paper we show that closed loop uncooperative rate control schemes als...
Kartikeya Chandrayana, Shivkumar Kalyanaraman