Multicast, also known as one-to-many communication, is the problem of sending a message from a single source node to several destination nodes. In this paper, we study the problem of implementing multicasts via a technique called Unicast-Based Multicast (UBM). In particular, we focus on the problem of nding optimal UBM calling schedules for arbitrary topologies using restricted inclusive routin...

In the past few years, overlay networks have received much attention but there has been little study on the “interaction” of multiple, co-existing overlays on top of a physical network. In addition to previously introduced concept of overlay routing strategy such as selfish routing, we introduce a new strategy called “overlay optimal routing”. Under this routing policy, the overlay seeks to min...

The principle of load balancing is examined for dynamic resource allocation subject to certain constraints The emphasis is on the performance of simple allocation strategies which can be implemented on line Either nite capacity constraints on resources or migration of load can be incorporated into the setup The load balancing problem is formulated as a stochastic optimal control problem Variant...

Traditional VLSI systems automatically place and route circuits using two independent steps; first an optimal placement is determined by using wire length estimates, then an optimal routing is attempted for the given placement. In actuality, placement and routing can have complicated interactions, and separating them can lead to conservative and un-optimal solutions. GRAPE, a Genetic Routing An...

In this paper, routing problem of Delay Tolerant Networks (DTN) was investigated and a new routing scheme was proposed based on the Epidemic routing. By combining the advantage of a variety of related routing algorithm, a Limited Multi-copy Optimal Path-Hybrid Routing (LMOP-HR) was put forward belonging to the flooding message copies strategy. An optimal tree mixed strategy based on priority wa...

Interval routing was introduced to reduce the size of the routing tables. This way of implementing routing functions is quite attractive but very few is known on the topological properties that should satisfy a network to admit an interval routing function satisfying particular constraints (shortest paths, limited number of intervals associated to each direction, etc). In this paper, we investi...