Data structures and network algorithms
Data structures and network algorithms
All-to-all routing and coloring in weighted trees of rings
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
On scheduling all-to-all personalized connections and cost-effective designs in WDM rings
IEEE/ACM Transactions on Networking (TON)
Ring routing and wavelength translation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
All-to-all optical routing in optimal chordal rings of degree four
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs
IEEE/ACM Transactions on Networking (TON)
Efficient Collective Communication in Optical Networks
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Optical All-to-All Communication for Some Product Graphs
SOFSEM '97 Proceedings of the 24th Seminar on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Uniform multi-hop all-to-all optical routings in rings
Theoretical Computer Science - Latin American theoretical informatics
Multihop All-to-All Broadcast on WDM Optical Networks
IEEE Transactions on Parallel and Distributed Systems
A general approach for all-to-all routing in multihop WDM optical networks
IEEE/ACM Transactions on Networking (TON)
Journal of Network and Computer Applications
Multi-hop all-to-all optical routings in Cartesian product networks
Information Processing Letters
Faster algorithms for construction of recovery trees enhancing QoP and QoS
IEEE/ACM Transactions on Networking (TON)
On conflict-free all-to-all broadcast in one-hop optical networks of arbitrary topologies
IEEE/ACM Transactions on Networking (TON)
APNOMS'09 Proceedings of the 12th Asia-Pacific network operations and management conference on Management enabling the future internet for changing business and new computing services
IEEE Journal on Selected Areas in Communications
Comprehensive performance modeling and analysis of multicasting in optical networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In this paper, we study the problem of reliable collective communication (broadcast or gossip) with the objective of maximizing the reliability of the collective communication. The need for collective communication arises in many problems of parallel and distributed computing, including Grid or cloud computing and database management. We describe the network model, formulate the reliable collective communication problem, prove that the maximum reliable collective communication problem is NP-hard, and provide an integer linear program (ILP) formulation for the problem. We then provide a greedy approximation algorithm to construct collective communication (through a spanning tree) that achieves an approximation ratio of 1 + ln(|V| + α|E| - 1), where is the average number of shared link risk groups (SRLGs) along links, and |V| and |E| are the total number of vertices and edges of the network, respectively. Simulations demonstrate that our approximation algorithm achieves good performance in both small and large networks and that, in almost 95% of total cases, our algorithm outperforms the modified minimum spanning tree algorithms.