Sciweavers

1205 search results - page 64 / 241
» On P Systems with Bounded Parallelism
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
Replication Strategy in Unstructured Peer-to-Peer Systems
1 The unstructured Peer-to-Peer (P2P) systems usually use a “blind search” method to find the requested data object by propagating a query to a number of peers randomly. In or...
Guofu Feng, Yuquan Jiang, Guihai Chen, Qing Gu, Sa...
SPAA
1994
ACM
13 years 11 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
GLOBECOM
2007
IEEE
14 years 2 months ago
Performance Analysis of the Parallel Optical All-Pass Filter Equalizer for Chromatic Dispersion Compensation at 10 Gb/s
— Optical fiber is capable of providing the solution to the need of high bandwidth communication. The main degradation to the optical signal integrity in single mode fibers (SMFs...
Wai Pang Ng, Wisit Loedhammacakra, Robert A. Cryan...
PODC
1991
ACM
13 years 11 months ago
Resource Bounds for Self Stabilizing Message Driven Protocols
Abstract. Self-stabilizing message driven protocols are defined and discussed. The class weakexclusion that contains many natural tasks such as -exclusion and token-passing is de...
Shlomi Dolev, Amos Israeli, Shlomo Moran
ICDCS
2002
IEEE
14 years 19 days ago
Improving Search in Peer-to-Peer Networks
Peer-to-peer systems have emerged as a popular way to share huge volumes of data. The usability of these systems depends on effective techniques to find and retrieve data; howeve...
Beverly Yang, Hector Garcia-Molina