A new memoryless online routing algorithm for Delaunay triangulations

Author(s):  
Ashkan Rezazadeh ◽  
Mostafa Nouri-Baygi
2017 ◽  
Vol 27 (04) ◽  
pp. 241-253
Author(s):  
Prosenjit Bose ◽  
Jean-Lou De Carufel ◽  
Stephane Durocher ◽  
Perouz Taslakian

Let [Formula: see text] be a graph, [Formula: see text] be a source node and [Formula: see text] be a target node. The sequence of adjacent nodes (graph walk) visited by a routing algorithm is a [Formula: see text]-competitive route if its length in [Formula: see text] is at most [Formula: see text] times the length of the shortest path from [Formula: see text] to [Formula: see text] in [Formula: see text]. We present a [Formula: see text]-competitive online routing algorithm on the Delaunay triangulation of an arbitrary given set of points in the plane. This improves the competitive ratio on Delaunay triangulations from the previous best of [Formula: see text]. We also present a [Formula: see text]-competitive online routing algorithm for Delaunay triangulations of point sets in convex position.


Author(s):  
Nicolas Bonichon ◽  
Prosenjit Bose ◽  
Jean-Lou De Carufel ◽  
Ljubomir Perković ◽  
André van Renssen

2019 ◽  
Vol 0 (0) ◽  
Author(s):  
Sridhar Iyer

AbstractIn the current work, we focus on the optimization of lightpath routing in a Space Division Multiplexing based Elastic Optical Network (SDM-b-EON) for which we propose an online routing algorithm, named as Resource Efficient Online Routing Algorithm with Regeneration (REORAwR) which, in addition to ensuring the routing of translucent lightpaths through spectral super-channels over spatial modes links also accounts for the presence of the transceivers in the network. The proposed REORAwR algorithm is tunable such that it can either aim to reduce the bandwidth blocking probability or can aim to minimize the overall consumed power. In regard to regeneration, we investigate two scenarios which differ in their regeneration variability level in addition to the adjustment of modulation formats as per the transmission route characteristics. We conduct extensive simulations considering two realistic network topologies and realistic transmission reach values. The obtained results demonstrate that significant benefits can be obtained in regard to the utilization of both the major network resources (spectrum and transceivers) when regeneration is conducted with complete flexibility and modulation format conversion is also permitted at every node of the SDM-b-EON. In addition, the obtained results also show that when compared to spectrum usage, in terms of the overall consumed power, the performance profits which can be obtained in a translucent SDM-b-EON are very small.


2005 ◽  
Author(s):  
Mingxia Bo ◽  
Xiaofei Pan ◽  
Fanghua Ma ◽  
Wanyi Gu

2016 ◽  
Vol 58 (2) ◽  
pp. 482-504 ◽  
Author(s):  
Nicolas Bonichon ◽  
Prosenjit Bose ◽  
Jean-Lou De Carufel ◽  
Ljubomir Perković ◽  
André van Renssen

Author(s):  
Prosenjit Bose ◽  
Jean-Lou De Carufel ◽  
Stephane Durocher ◽  
Perouz Taslakian

2002 ◽  
Vol 12 (04) ◽  
pp. 283-295 ◽  
Author(s):  
PROSENJIT BOSE ◽  
ANDREJ BRODNIK ◽  
SVANTE CARLSSON ◽  
ERIK D. DEMAINE ◽  
RUDOLF FLEISCHER ◽  
...  

We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no memory and uses no randomization, (2) no equivalent result is possible for convex subdivisions, (3) there is no competitive online routing algorithm under the Euclidean distance metric in arbitrary triangulations, and (4) there is no competitive online routing algorithm under the link distance metric even when the input graph is restricted to be a Delaunay, greedy, or minimum-weight triangulation.


Sign in / Sign up

Export Citation Format

Share Document