Results 221 to 230 of about 8,828 (263)
Some of the next articles are maybe not open access.
Routing and handoff in the edge mobility architecture
ACM SIGMOBILE Mobile Computing and Communications Review, 2000We consider a future IP network architecture in which the core topology is fixed but where the hosts at the edge of the network may be mobile, as is the case in cellular networks. Within this architecture, Mobile-Enhanced Routing (MER) protocols are used to support the prefix-routed requirements of the fixed Internet, along with the movement of IP ...
Alan O'Neill +2 more
openaire +1 more source
Route planning with flexible edge restrictions
ACM Journal of Experimental Algorithmics, 2012In this work, we explore a new type of flexible shortest-path query, in which the query can be dynamically parameterized to constrain the type of edges that may be included in the resulting shortest path (e.g., find the shortest path in a road network that avoids toll roads and low overpasses, respective of the specified vehicle height).
Robert Geisberger +3 more
openaire +1 more source
The Swap Edges of a Multiple-Sources Routing Tree
Algorithmica, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bang Ye Wu +2 more
openaire +2 more sources
Edge transcoding with name-based routing
Proceedings of the 5th ACM Conference on Information-Centric Networking, 2018This demonstration shows the use of ICN for tile-based panoramic video streaming. To reduce the bandwidth usage, tiles are encoded with different qualities. Tiles having a valuable impact on user QoE are fetched by the client at high quality, the others at low quality.
Atsushi Tagami +6 more
openaire +1 more source
Equilibria in Routing Games with Edge Priorities
2018In this paper, we present a new routing model with edge priorities. We consider network users that route packages selfishly through a network over time and try to reach their destinations as fast as possible. If the number of packages that want to enter an edge at the same time exceeds the inflow capacity of this edge, edge priorities with respect to ...
Robert Scheffler 0001 +2 more
openaire +1 more source
Learnability of edge cost functions in routing games
2017 IEEE 56th Annual Conference on Decision and Control (CDC), 2017We study the learnability of the edge cost functions in routing games from observations of the equilibrium flows, where the learnability is measured as the minimum number of samples needed to maintain a high consistency of the empirical risk, which is a statistical estimator for the quality of the learned model. To provide an upper bound on the minimum
Jerome Thai, Alexandre M. Bayen
openaire +1 more source
2001
We consider the problem of drawing a graph where edges are represented by smooth curves between the associated nodes. Previously curved edges were drawn as splines defined by carefully calculated control points. We present a completely different approach where finding an edge is reduced to solving a differential equation.
openaire +1 more source
We consider the problem of drawing a graph where edges are represented by smooth curves between the associated nodes. Previously curved edges were drawn as splines defined by carefully calculated control points. We present a completely different approach where finding an edge is reduced to solving a differential equation.
openaire +1 more source
Edge Mobility Architecture - Routing and Hand-off
BT Technology Journal, 2001This paper presents a network architecture for supporting edge mobility, and goes on to consider IP networks in which the core topology is fixed but where the hosts at the edge of the network may be mobile, as is the case in cellular networks. Within this architecture, mobile enhanced routeing (MER) protocols are used to support the prefix-routed ...
A W O'Neill, G Tsirtsis
openaire +1 more source
Longest Edge Routing on the Spatial Aloha Graph
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference, 2008The multihop spatial reuse Aloha (MSR-Aloha) protocol was recently introduced by Baccelli et aL, where each transmitter selects the receiver among its feasible next hops that maximizes the forward progress of the head of line packet towards its final destination.
Steven Weber 0001 +3 more
openaire +1 more source
Face Traversal Routing on Edge Dynamic Graphs
19th IEEE International Parallel and Distributed Processing Symposium, 2005Previous face traversal algorithms for ad-hoc routing all assume static graphs during the routing process. In this paper, we present a new face traversal algorithm that does not rely on this assumption. Specifically, we consider routing on edge dynamic graphs, which have stationary nodes and whose edges may change between being active and inactive at ...
openaire +1 more source