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...

This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing algorithms inspired by the behavior of the ant colonies in locating and storing food. The effectiveness of the heuristic algorithm is supported by mathematical proofs and demonstrated by a comparison with the well-known A...

Hazardous Materials transportation risk mitigation may be achieved by reducing the accident probability and alleviating the associated potential consequences. The consideration of risk as a criterion for selecting Hazardous Materials distribution routes contributes substantially to the reduction of accident probability and the severity of the accident consequences. Furthermore the optimum deplo...

An important part of the development of any machine translation system is the creation of lexical resources. We describe an analysis of the dictionary development workflow and supporting tools currently in use and under development at Logos. This workflow identifies the component processes of: setting goals, locating and acquiring lexical resources, transforming the resources to a common format...

Middleware is a growing, multidisciplinary area that merges knowledge from diverse areas such as distributed systems, networks and, more recently, embedded systems. This paper presents the results of an extensive review of middleware related literature, and presents an overview of critical features that must be considered during middleware development. These features include: network independen...

The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can transit by hubs. The aim of this paper is to investigate polyhedral properties of these problems and...

Domination in graphs is an emerging area of research at present and it has applications to several fields such as School bus routing, Computer communication networks, Facility location problems, Locating radar stations problem etc. Recently dominating functions in domination theory have received much attention. The new concepts viz., unidominating functions and total unidominating functions hav...

Pavan Kumar Pagadala, Research Scholar Computer Science and Engineering Anna University, Tamilnadu,India [email protected] Dr. N.M Saravana Kumar, Professor & HOD Computer Science and Engineering Vivekanadha College of Engineering for Women, Tiruchengode, Tamilnadu, India [email protected] -------------------------------------------------------------------ABSTRACT---------...

Resource discovery in a Grid environment is a critical problem and also a fundamental task which provides searching and locating necessary resources for given processes. Based on the domain and resource routing nodes, a grid resource discovery model of multilayer overlay network is given in this paper. And on this basis, using a linear combination of the block distance and chessboard distance i...

Overlay networks are widely used for locating and disseminating information by means of custom routing and forwarding on top of an underlying network. Distributed Hash Table (DHT) based overlays in particular, provide good scalability and load balancing properties. However, these come at the cost of inefficient routing, caused by the lack of adaptation to the underlying network, as DHTs often o...