Sciweavers

625 search results - page 72 / 125
» Latency Insensitive Protocols
Sort
View
GLOBECOM
2010
IEEE
13 years 7 months ago
Trust Management for Encounter-Based Routing in Delay Tolerant Networks
: We propose and analyze a class of trust management protocols for encounter-based routing in delay tolerant networks (DTNs). The underlying idea is to incorporate trust evaluation...
Ing-Ray Chen, Fenye Bao, Moonjeong Chang, Jin-Hee ...
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
14 years 9 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
ICNP
2002
IEEE
14 years 2 months ago
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks
The emerging Multi-Protocol Label Switching (MPLS) networks enable network service providers to route bandwidth guaranteed paths between customer sites [3, 2, 8, 5]. This basic La...
Erran L. Li, Milind M. Buddhikot, Chandra Chekuri,...
CCR
2010
179views more  CCR 2010»
13 years 9 months ago
An argument for increasing TCP's initial congestion window
TCP flows start with an initial congestion window of at most four segments or approximately 4KB of data. Because most Web transactions are short-lived, the initial congestion wind...
Nandita Dukkipati, Tiziana Refice, Yuchung Cheng, ...
IWQOS
2004
Springer
14 years 2 months ago
Small world overlay P2P networks
In this paper, we consider how to “construct” and “maintain” an overlay structured P2P network based on the “smallworld paradigm”. Two main attractive properties of a ...
Ken Y. K. Hui, John C. S. Lui, David K. Y. Yau