RFC 6724 defines default address selection mechanisms for IPv6 that allow nodes to select an appropriate address when faced with multiple source and/or destination addresses to choose between. RFC 6724 allows for the future definition of methods to administratively configure the address selection policy information. This document defines a new DHCPv6 option for such configuration, allowing a si...

Recently, many researchers have been attracted to intermittently connected mobile ad-hoc networks (MANETs), which are a type of DTN (delay/disruption/disconnect tolerant network). To achieve end-to-end communication between a source node and a destination node in the networks, storecarry-forward routing has been considered as a promising solution. In this paper, we propose an algorithm for opti...

RFC 6724 defines default address selection mechanisms for IPv6 that allow nodes to select an appropriate address when faced with multiple source and/or destination addresses to choose between. RFC 6724 allows for the future definition of methods to administratively configure the address selection policy information. This document defines a new DHCPv6 option for such configuration, allowing a si...

Cooperative diversity is a communication technique where a relay node provides signal diversity to the destination by retransmitting the signal received from the source. To find an optimal relay and maximize the resulting performance, a relay selection procedure is used with channel state information as a selection metric. In this paper, we model cooperative diversity with relay selection as a ...

Many simulation models contain one or more transport systems where some type of vehicle, perhaps an AGV, a fork truck, a shuttle, or a human being, travel along predefined paths. Locations along the paths may specify where loads carried by the vehicle transfer to or from it, where some activity takes place requiring the vehicle’s presence, or where vehicle routing logic executes. This paper foc...

Fat-tree topology has become very popular among switch manufacturers. Routing in fat-trees is composed of two phases, an adaptive upwards phase, and a deterministic downwards phase. The unique downwards path to the destination depends on the switch that has been reached in the upwards phase. As adaptive routing is used in the ascending phase, several output ports are possible at each switch and...

Current commercial mobile navigation systems often use a predetermined scale selection schema without considering differences in spatial complexity of locations. To identify what map scales people may need and what spatial features make relevant maps stand out, we conducted an experiment on subjective map selection in a route planning task between two cities in the United States. Our results su...

In this paper, we propose and analyze three routing algorithms for anycast packets: i) source-destination based routing with weighted random selection (SD/WRS), ii) destination based routing with weighted random selection (D/WRS), and iii) the shortest shortest path first (SSPF) algorithms. The SSPF algorithm is a simple extension to the traditional SPF algorithm for routing unicast packets. Th...