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...

Deskribapen osoa

Xehetasun bibliografikoak
Egile Nagusiak:	Luczak, M, McDiarmid, C
Formatua:	Journal article
Argitaratua:	2008

Antzeko izenburuak

On-line routing of random calls in networks
nork: Luczak, M, et al.
Argitaratua: (2003)

Bisecting sparse random graphs.
nork: Luczak, M, et al.
Argitaratua: (2001)

On the maximum queue length in the supermarket model
nork: Luczak, M, et al.
Argitaratua: (2006)

On the power of two choices: Balls and bins in continuous time
nork: Luczak, M, et al.
Argitaratua: (2005)

Asymptotic distributions and chaos for the supermarket model
nork: Luczak, M, et al.
Argitaratua: (2007)

Concentration for locally acting permutations
nork: Luczak, M, et al.
Argitaratua: (2003)

On the maximum queue length in the supermarket model
nork: Luczak, M, et al.
Argitaratua: (2006)

On the maximum queue length in the supermarket model
nork: Luczak, MJ, et al.
Argitaratua: (2006)

Random graphs on surfaces.
nork: McDiarmid, C
Argitaratua: (2008)

Random channel assignment in the plane.
nork: McDiarmid, C
Argitaratua: (2003)

On The Span Of A Random Channel Assignment Problem.
nork: McDiarmid, C
Argitaratua: (2007)

Random Graphs from a Minor-Closed Class.
nork: McDiarmid, C
Argitaratua: (2009)

Random graphs from a weighted minor-closed class
nork: McDiarmid, C
Argitaratua: (2012)

Connectivity for random graphs from a weighted bridge-addable class
nork: McDiarmid, C
Argitaratua: (2012)

On the Number of Edges in Random Planar Graphs.
nork: Gerke, S, et al.
Argitaratua: (2004)

On the chromatic number of random geometric graphs
nork: McDiarmid, C, et al.
Argitaratua: (2011)

On the chromatic number of random geometric graphs
nork: McDiarmid, C, et al.
Argitaratua: (2011)

Random perfect graphs
nork: McDiarmid, C, et al.
Argitaratua: (2018)

Random unlabelled graphs containing few disjoint cycles.
nork: Kang, M, et al.
Argitaratua: (2011)

The t-improper chromatic number of random graphs
nork: Kang, R, et al.
Argitaratua: (2008)

Random graphs with few disjoint cycles
nork: Kurauskas, V, et al.
Argitaratua: (2010)

The t-Improper Chromatic Number of Random Graphs
nork: Kang, R, et al.
Argitaratua: (2010)

Modularity in random regular graphs and lattices.
nork: McDiarmid, C, et al.
Argitaratua: (2013)

Modularity of Erdos-Rényi random graphs
nork: McDiarmid, C, et al.
Argitaratua: (2018)

On the Maximum Degree of a Random Planar Graph.
nork: McDiarmid, C, et al.
Argitaratua: (2008)

Random graphs from a block-stable class
nork: McDiarmid, C, et al.
Argitaratua: (2016)

Random Graphs Containing Few Disjoint Excluded Minors
nork: McDiarmid, C, et al.
Argitaratua: (2014)

Upper bounds on the non-3-colourability threshold of random graphs.
nork: Fountoulakis, N, et al.
Argitaratua: (2002)

Random planar graphs
nork: McDiarmid, C, et al.
Argitaratua: (2005)

On the spread of random graphs
nork: McDiarmid, C, et al.
Argitaratua: (2014)

On the spread of random graphs
nork: Addario-Berry, L, et al.
Argitaratua: (2009)

Upper bounds on the non-3-colourability threshold of random graphs
nork: Nikolaos Fountoulakis, et al.
Argitaratua: (2002-01-01)

Upper bounds on the non- 3-colourability threshold of random graphs
nork: Nikolaos Fountoulakis, et al.
Argitaratua: (2002-12-01)

Random Hyperplane Search Trees.
nork: Devroye, L, et al.
Argitaratua: (2009)

The t-stability number of a random graph
nork: Fountoulakis, N, et al.
Argitaratua: (2008)

Largest sparse subgraphs of random graphs.
nork: Fountoulakis, N, et al.
Argitaratua: (2011)

Largest sparse subgraphs of random graphs
nork: Fountoulakis, N, et al.
Argitaratua: (2014)

Clique colouring of binomial random graphs
nork: McDiarmid, C, et al.
Argitaratua: (2018)

The component structure of dense random subgraphs of the hypercube
nork: McDiarmid, C, et al.
Argitaratua: (2021)

Uniform multicommodity flows in the hypercube with random edge‐capacities
nork: McDiarmid, C, et al.
Argitaratua: (2016)