We present and verify ROAM, an on-demand routing algorithm that maintains multiple loop-free paths to destinations. Each router maintains entries only for those destinations for which data flows through the router, which reduces storage space requirements and the amount of bandwidth needed to maintain correct routing tables. In ROAM, routes are established and maintained on demand using diffusi...

The computational complexity and the approximation algorithms of the optimal p-source communication spanning tree (p-OCT) problem were investigated. Let G be an undirected graph with nonnegative edge lengths. Given p vertices as sources and all vertices as destinations, and also given arbitrary requirements between sources and destinations, we investigated the problem how to construct a spannin...

In this paper, we propose a uniform adaptive routing strategy for wormhole-routed hypercube networks that accommodates both unicast and multicast communication. Based on a node labeling method, the resultant routing algorithms are shown to be deadlock-free without requiring virtual channels. The order in which the destinations are visited is important to ee-ciency. We present an ordering algori...

We provide an efficient heuristic algorithm to obtain a multicast network for multimedia applications, given a source and a set of destinations, that is within a specified maximum delay and a specified maximum variation in the delays from a source to the destinations. The time-complexity of our algorithm is O(|E| + nk log (|E|/n) + mk), where n and |E| are the number of nodes and edges in the n...

Regional accessibility can be defined as the ease with which destinations can be reached throughout a region. The proximity of a residence to potential destinations, such as jobs, shopping, and leisure-time activities, and the nature of the transportation links to those destinations together determine accessibility. In general, the closer a residence is to the center of the region, the higher t...

Given the growing importance of search in online travel planning, marketers need to better understand the behavioural aspect of search engines use. Built upon a number of previous studies, the goal of this research is to identify patterns in online travel queries across tourist destinations. Utilizing transaction log files from a number of search engines, the analysis shows important patterns i...

Conventional emergency evacuation plans often assign evacuees to fixed routes or destinations based mainly on geographic proximity. Such approaches can be inefficient if the roads are congested, blocked, or otherwise dangerous because of the emergency. By not constraining evacuees to prespecified destinations, a one-destination evacuation approach provides flexibility in the optimization proces...

Being able to transfer addressed information between sources and destinations is the prime function of a communication network. Hence, how to find paths for the data flow between source and destinations through the network is one of the most salient issues and important functions in network architecture and operation. In this paper, the function is denoted path finding, irrespective of whether ...

We investigate a general model of route selection for interdomain traffic engineering where the routing of multiple destinations can be coordinated. We identify potential instability and inefficiency problems, derive practical guidelines to guarantee stability without global coordination, and evaluate routing instability of interdomain traffic engineering using realistic Internet topology. We f...