UNIVERSAL ROUTING AND PERFORMANCE ASSURANCE FOR DISTRIBUTED NETWORKS

DOI10.1142/S0219265907001886zbMath1187.68026OpenAlexW2046766176MaRDI QIDQ3636561

Kevin F. Chen, Edwin Hsing-Mean Sha

Publication date: 30 June 2009

Published in: Journal of Interconnection Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219265907001886

zbMATH Keywords

universalityVLSInetwork architecturesfat-stack, routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Cites Work

• Unnamed Item
• A framework for solving VLSI graph layout problems
• Communication-efficient parallel algorithms for distributed random-access machines
• A compact layout for the three-dimensional tree of meshes
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• Adaptive packet routing for bursty adversarial traffic
• Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
• Adversarial queuing theory
• Universal-stability results and performance bounds for greedy contention-resolution protocols
• Randomized Routing and Sorting on Fixed-Connection Networks
• Deterministic on-line routing on area-universal networks

This page was built for publication: UNIVERSAL ROUTING AND PERFORMANCE ASSURANCE FOR DISTRIBUTED NETWORKS