Results 241 to 250 of about 221,094 (291)

Dynamic Location-routeing Problems

Journal of the Operational Research Society, 1989
Dynamic location-routeing problems involve the determination of the least-cost sequence of depot, vehicle fleet and route configurations in a distribution system, over a given planning horizon. This paper presents two solution approaches to such problems. The first is an exact method which is appropriate for small-scale problems.
Laporte, Gilbert, Dejax, Pierre J.
openaire   +2 more sources

Dynamic route descriptions

Proceedings of the 2nd international symposium on Smart graphics, 2002
Principles are empirically established for various multimodal representations of route descriptions that are found to facilitate aspects of user navigation performance on significantly different levels. Some representations clearly minimize navigation completion time, navigation error, and/or distraction to focal view, while others hinder these goals ...
C. M. Chewar, D. Scott McCrickard
openaire   +1 more source

Greedy Dynamic Routing on Arrays

Journal of Algorithms, 1998
Summary: We study the problem of dynamic routing on arrays. We prove that a large class of greedy algorithms perform very well on average. In the dynamic case, when the arrival rate of packets in an \(N\times N\) array is at most 99\% of network capacity, we establish an exponential bound on the tail of the delay distribution. Moreover, we show that in
Kahale, Nabil, Leighton, Tom
openaire   +2 more sources

Dynamic Route Selection in Route Planners

KN - Journal of Cartography and Geographic Information, 2007
Typically, a route planner application returns one single best route that is visualized on top of a digital map on the output medium, such as a computer screen, GPS device, or PDA, together with a route description. For intuitive route planning we suggest including a precomputation of various feasible routes as part of the interactive route selection ...
openaire   +1 more source

A dynamic vehicle routing problem with multiple delivery routes

Annals of Operations Research, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Azi, Nabila, Gendreau, Michel, Potvin, Jean-Yves   +2 more
openaire   +1 more source

Distributed dynamic routing schemes

IEEE Communications Magazine, 1990
Schemes that do not explicitly use much information about the state of networks are briefly surveyed, with the focus on dynamic alternative routing (DAR), a simple but highly effective routing method currently planned for the British Telecom Network.
P.B. Key, G.A. Cope
openaire   +1 more source

Secure Dynamic Source Routing

Proceedings of the 38th Annual Hawaii International Conference on System Sciences, 2005
In this paper we present the Secure Dynamic Source Routing protocol for Mobile Ad hoc Networks that prevents a lot of potential attacks to these kind of networks. We also present a number of similar protocols and compare the different approaches. After a detailed description of SDSR, we show that the stated security goals are met using the BAN logic ...
F. Kargl, A. Geis, S. Schlott, M. Weber
openaire   +1 more source

BGP routing dynamics revisited

ACM SIGCOMM Computer Communication Review, 2007
Understanding BGP routing dynamics is critical to the solid growth and maintenance of the Internet routing infrastructure. However, while the most extensive study on BGP dynamics is nearly a decade old, many factors that could affect BGP dynamics have changed considerably.
Jun Li, Michael Guidero, Zhen Wu, Eric Purpus, Toby Ehrenkranz   +4 more
openaire   +1 more source

Dynamic Message Routing Using Processes

2009
The Enterprise Service Bus (ESB) is composable middleware that provides applications with services such as message routing and transformation, service composition, dynamic discovery, transactional support, coordination, security features, and others.
Scheibler, Thorsten, Karastoyanova, Dimka, Leymann, Frank   +2 more
openaire   +2 more sources

Dynamic multi-path routing

Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, 2001
In this paper we study the dynamic multi-path routing problem. We focus on an operating regime where traffic flows arrive at and depart from the network in a bursty fashion, and where the delays involved in link state advertisement may lead to "synchronization" effects that adversely impact the performance of dynamic single-path routing ...
Xun Su, Gustavo de Veciana
openaire   +1 more source