Sciweavers

1391 search results - page 201 / 279
» Distributed routing in networks using affinity propagation
Sort
View
PE
2007
Springer
112views Optimization» more  PE 2007»
15 years 5 months ago
Performance bounds for feedforward queueing networks with upper-constrained inputs
We propose a simple framework for analyzing feedforward queueing networks that have the following features: each customer belongs to a (customer) flow and the route that a custom...
S. Shioda
HIPC
2004
Springer
15 years 11 months ago
An Incentive Driven Lookup Protocol for Chord-Based Peer-to-Peer (P2P) Networks
In this paper we describe a novel strategy for carrying out lookups in Chord-based peer-to-peer (P2P) networks, wherein nodes are assumed to behave selfishly. This is in contrast ...
Rohit Gupta, Arun K. Somani
DBISP2P
2003
Springer
100views Database» more  DBISP2P 2003»
15 years 11 months ago
Content-Based Overlay Networks for XML Peers Based on Multi-level Bloom Filters
Peer-to-peer systems are gaining popularity as a means to effectively share huge, massively distributed data collections. In this paper, we consider XML peers, that is, peers that ...
Georgia Koloniari, Yannis Petrakis, Evaggelia Pito...
ICPADS
2005
IEEE
15 years 12 months ago
A Configurable Time-Controlled Clustering Algorithm for Wireless Sensor Networks
Future large-scale sensor networks may comprise thousands of wirelessly connected sensor nodes that could provide an unimaginable opportunity to interact with physical phenomena i...
S. Selvakennedy, Sukunesan Sinnappan
ICDCIT
2005
Springer
15 years 12 months ago
Merging Clustering Algorithms in Mobile Ad Hoc Networks
Abstract. Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We propose a n...
Orhan Dagdeviren, Kayhan Erciyes, Deniz Cokuslu