Sciweavers

2076 search results - page 206 / 416
» Universal Routing in Distributed Networks
Sort
View
98
Voted
ATAL
2007
Springer
15 years 10 months ago
Information searching and sharing in large-scale dynamic networks
Finding the right agents in a large and dynamic network to provide the needed resources in a timely fashion, is a long standing problem. This paper presents a method for informati...
George A. Vouros
138
Voted
GLOBECOM
2007
IEEE
15 years 7 months ago
Resource Efficient Survivable Clustering for Wireless Sensor Networks
Abstract-- In this paper, we address both lifetime and survivability issues in wireless sensor networks (WSNs). We present an easy-to-implement clustering method called DED (distri...
Mohammad Masud Hasan, Jason P. Jue
160
Voted
JSAC
2007
155views more  JSAC 2007»
15 years 3 months ago
Semantic social overlay networks
— Peer selection for query routing is a core task in peer-to-peer networks. Unstructured peer-to-peer systems (like Gnutella) ignore this problem, leading to an abundance of netw...
Alexander Löser, Steffen Staab, Christoph Tem...
129
Voted
TRIDENTCOM
2005
IEEE
15 years 9 months ago
TBI: End-to-End Network Performance Measurement Testbed for Empirical Bottleneck Detection
— Recent advances in networking include new bandwidth-intensive applications, sophisticated protocols that enable real-time data and multimedia delivery and aspects of network se...
Prasad Calyam, Dima Krymskiy, Mukundan Sridharan, ...
161
Voted
DBKDA
2010
IEEE
127views Database» more  DBKDA 2010»
15 years 2 months ago
Failure-Tolerant Transaction Routing at Large Scale
—Emerging Web2.0 applications such as virtual worlds or social networking websites strongly differ from usual OLTP applications. First, the transactions are encapsulated in an AP...
Idrissa Sarr, Hubert Naacke, Stéphane Gan&c...