Sciweavers

4642 search results - page 385 / 929
» Distributed algorithm and reversible network
Sort
View
JPDC
2000
106views more  JPDC 2000»
15 years 6 months ago
Dual of a Complete Graph as an Interconnection Network
A new class of interconnection networks, the hypernetworks, has been proposed recently. Hypernetworks are characterized by hypergraphs. Compared with point-to-point networks, they...
Si-Qing Zheng, Jie Wu
INFOCOM
2011
IEEE
14 years 10 months ago
Capacity of byzantine agreement with finite link capacity
—We consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical problem in distri...
Guanfeng Liang, Nitin H. Vaidya
PODC
2006
ACM
16 years 23 days ago
Local approximation schemes for topology control
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju
DCOSS
2005
Springer
16 years 10 days ago
Multi-query Optimization for Sensor Networks
The widespread dissemination of small-scale sensor nodes has sparked interest in a powerful new database abstraction for sensor networks: Clients “program” the sensors through ...
Niki Trigoni, Yong Yao, Alan J. Demers, Johannes G...
PDCAT
2005
Springer
16 years 8 days ago
On-Line Routing in WDM-TDM Switched Optical Mesh Networks
This paper considers the on-line traffic grooming problem in WDM-TDM switched optical mesh networks without wavelength conversion capability. The objective is to efficiently rou...
Arun Vishwanath, Weifa Liang