Results 271 to 280 of about 37,081 (313)

Dynamic and Personalized Routing in PreGo

2016 17th IEEE International Conference on Mobile Data Management (MDM), 2016
Existing routing services calculate the best route from source to destination over a road network graph. Most commercial routing services offer the best route in terms of either the shortest travel distance or the shortest travel time (with or without considering current traffic conditions).
Abdeltawab M. Hendawi, Aqeel Rustum, Amr A. Ahmadain, Dev Oliver, David Hazel, Ankur Teredesai, Mohamed H. Ali   +6 more
openaire   +1 more source

Hybrid routing in dynamic networks

Proceedings of ICC'97 - International Conference on Communications, 2002
In mobile radio communication networks the distribution of traffic loads and network topologies may vary from nearly static to very dynamic. This dynamic behaviour may vary both in space and in time. Since routing algorithms tend to be well suited to specific networking environments, it is very difficult to select a single routing algorithm that is ...
Peter Shoubridge, Arek Dadej
openaire   +1 more source

Dynamic multicast routing in VLSI

Computer Communications, 2000
As real-time applications requiring dynamic group communication emerges, existing multicast routing algorithms must be improved to cater for high-speed routing decisions. Most of the reported efficient multicast routing algorithms for real-time applications construct a multicast tree using the Dijkstra's algorithm.
Siew Kei Lam, Thambipillai Srikanthan
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 0001, Michael Guidero, Zhen Wu, Eric Purpus, Toby Ehrenkranz   +4 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.
Peter B. Key, Graham A. Cope
openaire   +1 more source

Dynamic routing in multiparented networks

IEEE/ACM Transactions on Networking, 1993
The authors investigate some of the consequences for dynamic routing schemes of dual- and multiparented networks, in which a call can enter (or leave) the network at two or more points. In particular, they compare bounds on the performance of optimal dynamic routing strategies which respectively ignore and utilize the multiparented structure, and show ...
Richard J. Gibbens, Frank P. Kelly, Stephen R. E. Turner   +2 more
openaire   +1 more source

Dynamic Routing and Flow Control

IEEE Transactions on Communications, 1980
This is an expanded version of an earlier report, adding, new results. The first part introduces a simple analytic model showing that dynamic routing may increase network throughput or lower delay when trunks are moderately loaded, but will reduce throughput or increase delay at heavy trunk loads.
Harry R. Rudin Jr., Heinrich R. Müller
openaire   +1 more source

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

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

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 ...
Frank Kargl, Alfred Geiss, Stefan Schlott, Michael Weber 0001   +3 more
openaire   +1 more source