Sciweavers

268 search results - page 47 / 54
» Fairness in Routing and Load Balancing
Sort
View
MSWIM
2006
ACM
14 years 1 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
INFOCOM
2005
IEEE
14 years 1 months ago
FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
Dongsheng Li, Xicheng Lu, Jie Wu
QSHINE
2005
IEEE
14 years 1 months ago
Utility-based Adaptive Resource Allocation in Hybrid Wireless Networks
Service availability in wireless networks is highly dependent on efficient resource allocation and guaranteed Quality of Service (QoS) amid overloads and failures. This paper add...
Calin Curescu, Simin Nadjm-Tehrani, Bing Cao, Tere...
WETICE
2005
IEEE
14 years 1 months ago
GRACE: Enabling collaborations in wide-area distributed systems
The globalization of businesses and the cooperation between organizations have brought on an ever increased need for providing support for distributed collaborations. In this pape...
Anne-Marie Bosneag, Monica Brockmeyer
ICFEM
2004
Springer
14 years 1 months ago
Linear Inequality LTL (iLTL): A Model Checker for Discrete Time Markov Chains
Abstract. We develop a way of analyzing the behavior of systems modeled using Discrete Time Markov Chains (DTMC). Specifically, we define iLTL, an LTL with linear inequalities on...
YoungMin Kwon, Gul Agha