The generalized packet routing problem

DOI10.1016/0304-3975(87)90069-7zbMATH Open0626.68015OpenAlexW2043560882MaRDI QIDQ580964FDOQ580964

Eli Upfal, David Peleg

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90069-7

Recommendations

• An approximation algorithm for the general routing problem
• On the general routing polytope
• The generalized arc routing problem
• Routing optimization in packet switching communication networks
• Generalized network improvement and packing problems
• Packet Routing: Complexity and Algorithms
• scientific article; zbMATH DE number 4059093
• A capacitated general routing problem on mixed networks
• The general routing polyhedron: A unifying framework
• scientific article; zbMATH DE number 432994

zbMATH Keywords

communication networksexpander graphsefficient packet routingload balancing problem in distributed systemsparallel and distributed computationpermutation packet routingtoken distribution problem

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cites Work

• Title not available (Why is that?)
• Sorting in \(c \log n\) parallel steps
• Efficient Schemes for Parallel Communication

Cited In (18)

• Packet Routing: Complexity and Algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• AN EXTENDED DIMENSION ORDER TOKEN DISTRIBUTION ALGORITHM ON k-Ary d-CUBES AND ITS COMPLEXITY
• Title not available (Why is that?)
• TOKEN DISTRIBUTION AND LOAD BALANCING ON RECONFIGURABLEd-DIMENSIONAL MESHES
• A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria
• Rapid convergence of a local load balancing algorithm for asynchronous rings
• Constraint satisfaction, packet routing, and the lovasz local lemma
• Strongly adaptive token distribution
• Title not available (Why is that?)
• A note on the token distribution problem
• Dimension-exchange token distribution on the mesh and the torus
• The general routing polyhedron: A unifying framework
• Near-perfect token distribution
• Algorithms for generalized round robin routing
• Representing shared data on distributed-memory parallel computers
• Optimal dimension-exchange token distribution on complete binary trees

This page was built for publication: The generalized packet routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580964)