Fast broadcast in high-speed networks
IEEE/ACM Transactions on Networking (TON)
Deterministic resource discovery in distributed networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Asynchronous resource discovery
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A note on line broadcast in digraphs under the edge-disjoint paths mode
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Fast construction of overlay networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Approximation and heuristic algorithms for minimum-delay application-layer multicast trees
IEEE/ACM Transactions on Networking (TON)
Optimal maintenance of a spanning tree
Journal of the ACM (JACM)
Note: A note on models for graph representations
Theoretical Computer Science
High-speed networks: definition and fundamental attributes
Computer Communications
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
O(log n)-time overlay network construction from graphs with out-degree 1
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
| Hi-index | 754.84 |
In future networks, transmission and switching capacity will dominate processing capacity. The authors investigate the way in which distributed algorithms should be changed in order to operate efficiently in this new environment. They introduce a class of new models for distributed algorithms which make explicit the difference between switching and processing. Based on these new models they define new message and time complexity measures which, they believe, capture the costs in many high-speed networks more accurately then traditional measures. In order to explore the consequences of the new models, they examine three problems in distributed computation. For the problem of maintaining network topology they devise a broadcast algorithm which takes O(n) messages and O(log n) time for a single broadcast in the new measure. For the problem of leader election they present a simple algorithm that uses O(n) messages and O(n) time. The third problem, distributed computation of a “globally sensitive” function, demonstrates some important features and tradeoffs in the new models and emphasizes and differences with the traditional network model. The results of the present paper influenced later research, as well as the design of IBM Networking Broadband Services (NBBS)