Balanced routing of random calls

Balanced routing of random calls

We consider an online routing problem in continuous time, where calls have Poisson arrivals and exponential durations. The first-fit dynamic alternative routing algorithm sequentially selects up to $d$ random two-link routes between the two endpoints of a call, via an intermediate node, and assigns...

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	Luczak, M, McDiarmid, C
Formáid:	Journal article
Foilsithe / Cruthaithe:	2008

Míreanna comhchosúla

On-line routing of random calls in networks
de réir: Luczak, M, et al.
Foilsithe / Cruthaithe: (2003)

Bisecting sparse random graphs.
de réir: Luczak, M, et al.
Foilsithe / Cruthaithe: (2001)

On the maximum queue length in the supermarket model
de réir: Luczak, M, et al.
Foilsithe / Cruthaithe: (2006)

On the power of two choices: Balls and bins in continuous time
de réir: Luczak, M, et al.
Foilsithe / Cruthaithe: (2005)

Asymptotic distributions and chaos for the supermarket model
de réir: Luczak, M, et al.
Foilsithe / Cruthaithe: (2007)

Concentration for locally acting permutations
de réir: Luczak, M, et al.
Foilsithe / Cruthaithe: (2003)

On the maximum queue length in the supermarket model
de réir: Luczak, M, et al.
Foilsithe / Cruthaithe: (2006)

On the maximum queue length in the supermarket model
de réir: Luczak, MJ, et al.
Foilsithe / Cruthaithe: (2006)

Random graphs on surfaces.
de réir: McDiarmid, C
Foilsithe / Cruthaithe: (2008)

Random channel assignment in the plane.
de réir: McDiarmid, C
Foilsithe / Cruthaithe: (2003)

On The Span Of A Random Channel Assignment Problem.
de réir: McDiarmid, C
Foilsithe / Cruthaithe: (2007)

Random Graphs from a Minor-Closed Class.
de réir: McDiarmid, C
Foilsithe / Cruthaithe: (2009)

Random graphs from a weighted minor-closed class
de réir: McDiarmid, C
Foilsithe / Cruthaithe: (2012)

Connectivity for random graphs from a weighted bridge-addable class
de réir: McDiarmid, C
Foilsithe / Cruthaithe: (2012)

On the Number of Edges in Random Planar Graphs.
de réir: Gerke, S, et al.
Foilsithe / Cruthaithe: (2004)

On the chromatic number of random geometric graphs
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2011)

On the chromatic number of random geometric graphs
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2011)

Random perfect graphs
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2018)

Random unlabelled graphs containing few disjoint cycles.
de réir: Kang, M, et al.
Foilsithe / Cruthaithe: (2011)

The t-improper chromatic number of random graphs
de réir: Kang, R, et al.
Foilsithe / Cruthaithe: (2008)

Random graphs with few disjoint cycles
de réir: Kurauskas, V, et al.
Foilsithe / Cruthaithe: (2010)

The t-Improper Chromatic Number of Random Graphs
de réir: Kang, R, et al.
Foilsithe / Cruthaithe: (2010)

Modularity in random regular graphs and lattices.
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2013)

Modularity of Erdos-Rényi random graphs
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2018)

On the Maximum Degree of a Random Planar Graph.
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2008)

Random graphs from a block-stable class
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2016)

Random Graphs Containing Few Disjoint Excluded Minors
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2014)

Upper bounds on the non-3-colourability threshold of random graphs.
de réir: Fountoulakis, N, et al.
Foilsithe / Cruthaithe: (2002)

Random planar graphs
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2005)

On the spread of random graphs
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2014)

On the spread of random graphs
de réir: Addario-Berry, L, et al.
Foilsithe / Cruthaithe: (2009)

Upper bounds on the non-3-colourability threshold of random graphs
de réir: Nikolaos Fountoulakis, et al.
Foilsithe / Cruthaithe: (2002-01-01)

Upper bounds on the non- 3-colourability threshold of random graphs
de réir: Nikolaos Fountoulakis, et al.
Foilsithe / Cruthaithe: (2002-12-01)

Random Hyperplane Search Trees.
de réir: Devroye, L, et al.
Foilsithe / Cruthaithe: (2009)

The t-stability number of a random graph
de réir: Fountoulakis, N, et al.
Foilsithe / Cruthaithe: (2008)

Largest sparse subgraphs of random graphs.
de réir: Fountoulakis, N, et al.
Foilsithe / Cruthaithe: (2011)

Largest sparse subgraphs of random graphs
de réir: Fountoulakis, N, et al.
Foilsithe / Cruthaithe: (2014)

Clique colouring of binomial random graphs
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2018)

The component structure of dense random subgraphs of the hypercube
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2021)

Uniform multicommodity flows in the hypercube with random edge‐capacities
de réir: McDiarmid, C, et al.
Foilsithe / Cruthaithe: (2016)