Sciweavers

104 search results - page 18 / 21
» Privacy-Preserving Network Aggregation
Sort
View
159
Voted
INFOCOM
2008
IEEE
16 years 16 days ago
Delay Tolerant Collaborations among Campus-Wide Wireless Users
Abstract—The ubiquitous deployment of wireless LAN networks are allowing students to embrace laptops as their preferred computing platform. We investigated the viability of build...
Xuwen Yu, Surendar Chandra
INFOCOM
2009
IEEE
16 years 23 days ago
Polynomial Time Approximations for Multi-Path Routing with Bandwidth and Delay Constraints
— In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks....
Satyajayant Misra, Guoliang Xue, Dejun Yang
INFOCOM
2005
IEEE
15 years 11 months ago
Distributed, secure load balancing with skew, heterogeneity and churn
— Numerous proposals exist for load balancing in peer-to-peer (p2p) networks. Some focus on namespace balancing, making the distance between nodes as uniform as possible. This te...
Jonathan Ledlie, Margo I. Seltzer
INFOCOM
2003
IEEE
15 years 11 months ago
Can Shortest-path Routing and TCP Maximize Utility
TCP-AQM protocols can be interpreted as distributed primal-dual algorithms over the Internet to maximize aggregate utility over source rates. In this paper we study whether TCP–...
Jiantao Wang, Lun Li, Steven H. Low, John Doyle
173
Voted
INFOCOM
2000
IEEE
15 years 10 months ago
Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...
Murali S. Kodialam, T. V. Lakshman