Main navigation | Main content

HOME » PROGRAMS/ACTIVITIES » Annual Thematic Program

PROGRAMS/ACTIVITIES

Annual Thematic Program »Postdoctoral Fellowships »Hot Topics and Special »Public Lectures »New Directions »PI Programs »Math Modeling »Seminars »Be an Organizer »Annual »Hot Topics »PI Summer »PI Conference »Applying to Participate »

Seminar on Industrial Problems

Diffusion Approximations of Join-the-Least-Loaded Infinite Server Station

Diffusion Approximations of Join-the-Least-Loaded Infinite Server Station

February 20, 1998

Presented
by: **Philip Fleming**, Motorola

We consider models of multicarrier IS-95 Cellular CDMA System under a "Weighted Least-Load" load-balancing algorithm and describe diffusion approximations for the joint probability mass function of the number of calls on each (radio) carrier. The underlying queueing model consists of a finite number of stations each having an infinite number of servers. New arrivals are either dedicated to a given station or are allowed to join the (weighted) least loaded station. The approximation has a particularly simple form and is quite accurate as will be demonstated by comparisons with simulation.