General: The machine load balancing problem is defined as follows: There are n parallel
machines and a number of independent tasks (jobs); the tasks arrive at arbitrary times …

Classical routing and admission control strategies achieve provably good performance by
relying on an assumption that the virtual circuits arrival pattern can be described by some a …

We consider the following natural model: customers arrive as a Poisson stream of rate/spl
lambda/n,/spl lambda/< 1, at a collection of n servers. Each customer chooses some …

Suppose that we sequentially place n balls into n boxes by putting each ball into a randomly
chosen box. It is well known that when we are done, the fullest box has with high probability …

Mobile edge computing is a new cloud computing paradigm, which makes use of small-
sized edge clouds to provide real-time services to users. These mobile edge-clouds (MECs) …

Recent proposals for network virtualization provide a promising way to overcome the
Internet ossification. The key idea of network virtualization is to build a diversified Internet to …

Emerging virtual network functions (VNFs) bring new opportunities to network services on
the edge within customers' premises. Network services are realized by chained up VNFs …

During the last 15 years online algorithms have received considerable research interest. In
this survey we give an introduction to the competitive analysis of online algorithms and …

We develop a framework that allows us to address the issues of admission control and
routing in high-speed networks under the restriction that once a call is admitted and routed, it …

In this paper we study the problem of on-line allocation of routes to virtual circuits (both point-
to-point and multicast) where the goal is to route all requests while minimizing the required …