On-line routing of random calls in networks

DOI10.1007/S00440-002-0242-2zbMATH Open1028.90009OpenAlexW2083188388MaRDI QIDQ1396752FDOQ1396752

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

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

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Cited In (14)

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

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)