On-line routing of random calls in networks

DOI10.1007/S00440-002-0242-2MaRDI QIDQ1396752zbMATH OpenOpenAlexFDO

Authors Malwina Luczak, Eli Upfal, Colin McDiarmid

Publication date 8 July 2003

Published in Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00440-002-0242-2

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Recommendations

• Balanced routing of random calls
• Steady state analysis of balanced‐allocation routing
• scientific article; zbMATH DE number 1303572
• Distributed online call control on general networks
• Dynamic Routing in Fully Connected Networks

Cited in

(14)

• Limit theorems for monotonic particle systems and sequential deposition.
• On the power of two choices: balls and bins in continuous time
• scientific article; zbMATH DE number 1303572 (Why is no real title available?)
• Steady state analysis of balanced‐allocation routing
• Balanced routing of random calls
• COMPUTING CALL ADMISSION CAPACITIES IN LINEAR NETWORKS
• Reordering heuristics for routing in communications networks
• scientific article; zbMATH DE number 822901 (Why is no real title available?)
• On-Line Algorithms for Path Selection in a Nonblocking Network
• Random subgraphs of the 2D Hamming graph: The supercritical phase
• On the Maximum Degree of a Random Planar Graph
• Traffic in Connecting Networks When Existing Calls Are Rearranged
• Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
• On-line randomized call control revisited

This page was built for publication: On-line routing of random calls in networks

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