Sciweavers

162 search results - page 28 / 33
» Minimizing Average Finish Time in P2P Networks
Sort
View
MASCOTS
2003
13 years 8 months ago
A Packet-Level Simulation Study of Optimal Web Proxy Cache Placement
The Web proxy cache placement problem is often formulated as a classical optimization problem: place N proxies within an internetwork so as to minimize the average user response t...
Gwen Houtzager, Carey L. Williamson
IJHPCA
2006
109views more  IJHPCA 2006»
13 years 7 months ago
A Resource Leasing Policy for on-Demand Computing
Leasing computational resources for on-demand computing is now a viable option for providers of network services. Temporary spikes or lulls in demand for a service can be accommod...
Darin England, Jon B. Weissman
MOBIHOC
2002
ACM
14 years 7 months ago
Path set selection in mobile ad hoc networks
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
Emin Gün Sirer, Panagiotis Papadimitratos, Zy...
CORR
2007
Springer
124views Education» more  CORR 2007»
13 years 7 months ago
Anonymous Networking amidst Eavesdroppers
—The problem of security against packet timing based traffic analysis in wireless networks is considered in this work. An analytical measure of “anonymity” of routes in eave...
Parvathinathan Venkitasubramaniam, Ting He, Lang T...
INFOCOM
2009
IEEE
14 years 2 months ago
On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks
Abstract—Back-pressure based algorithms based on the algorithm by Tassiulas and Ephremides have recently received much attention for jointly routing and scheduling over multihop ...
Lei Ying, Sanjay Shakkottai, Aneesh Reddy