Multicast routing allows network sources to use network resources efficiently by sending only a single copy of data to all group members. In the delay constrained group multicast routing problem (DCGMRP), every group member is also a source, and has an individual minimal delay and bandwidth requirement. The routing algorithm must, for each member of the group, construct a source-based routing t...

In this paper we have further elaborated MPLS multicasting under the specific graph (graceful) labeling with the use of specific multicast tree topology called caterpillar which is next higher topological structure other than the path; that is a central concept in the IP unicast routing. The use of caterpillar as the multicast tree has been analyzed and compared with the other tree topologies u...

Abstract In this paper, we study the recently introduced time-constrained maximal covering routing problem. problem, are given a central depot, set of facilities, and customers. Each customer is associated with subset facilities which can cover it. A feasible solution consists k Hamiltonian cycles on subsets depot. cycle must contain depot respect distance limit. The goal to maximize number cus...

Approa h y Qingsong Lu, Yan Huang, Shashi Shekhar Department of Computer S ien e, University of Minnesota 200 Union St SE, Minneapolis, MN 55455 [lqingson; huangyan; shekhar℄ s.umn.edu February 10, 2003 Abstra t Eva uation planning is riti al for appli ations su h as disaster management and homeland defense preparation. EÆ ient tools are needed to produ e eva uation plans to eva uate population...

Multi-constrained quality-of-service routing (QoSR) is to find a feasible path that satisfies multiple constraints simultaneously, as an NPC problem, which is also a big challenge for the upcoming next-generation networks. In this paper, we propose SA_MCP, a novel heuristic algorithm, by applying simulated annealing to Dijkstra's algorithm. This algorithm first uses a nonlinear energy function ...

In this paper we study local routing strategies on geometric graphs. Such strategies use geometric properties of the graph like the coordinates of the current and target nodes to route. Specifically, we study routing strategies in the presence of constraints which are obstacles that edges of the graph are not allowed to cross. Let P be a set of n points in the plane and let S be a set of line s...

One critical issue of MANET is to improve packet delivery in presence of network dynamics. Proactive MANET routing protocols tend to provide smaller route discovery latency than ondemand protocols because they maintain route information to all the nodes in the network at all time. However, the downside for such protocols is the excessive routing control overhead generated by disseminating perio...