Results 31 to 40 of about 53,951 (279)

S2RC: A multi-objective route planning and charging slot reservation approach for electric vehicles considering state of traffic and charging station

Journal of King Saud University: Computer and Information Sciences, 2022
Electric vehicles (EVs) are environment friendly and are expected to find tremendous growth in the near future. However, the short voyaging reach and the lack of charging lattice have impeded the large-scale application of EVs.
Ashwani Kumar, Ravinder Kumar, Ashutosh Aggarwal   +2 more
doaj   +1 more source

Link Prediction using Top-$k$ Shortest Distances

, 2017
In this paper, we apply an efficient top-$k$ shortest distance routing algorithm to the link prediction problem and test its efficacy. We compare the results with other base line and state-of-the-art methods as well as with the shortest path. Our results
Lebedev, Andrei, Lee, JooYoung, Mazzara, Manuel, Rivera, Victor   +3 more
core   +1 more source

Logical topology design for IP rerouting: ASONs versus static OTNs [PDF]

, 2011
IP-based backbone networks are gradually moving to a network model consisting of high-speed routers that are flexibly interconnected by a mesh of light paths set up by an optical transport network that consists of wavelength division multiplexing (WDM ...
Colle, Didier, De Maesschalck, Ann-Sophie, Demeester, Piet, Groebbens, Adelbert, Nowe, Ann, Pickavet, Mario, Puype, Bart, Steenhaut, Kris   +7 more
core   +1 more source

Hierarchical Load-Balanced Routing Optimization for Mega-Constellations via Geographic Partitioning

Applied Sciences
Large-scale Low Earth Orbit (LEO) satellite constellations have become critical infrastructure for global communications, yet routing optimization remains challenging.
Guinian Feng, Yutao Xu, Yang Zhao, Wei Zhang   +3 more
doaj   +1 more source

Dovetail: Stronger Anonymity in Next-Generation Internet Routing [PDF]

, 2014
Current low-latency anonymity systems use complex overlay networks to conceal a user's IP address, introducing significant latency and network efficiency penalties compared to normal Internet usage. Rather than obfuscating network identity through higher
A. Acquisti, B.N. Levine, P. Eckersley, P. Syverson, S. Chen, S.J. Murdoch   +5 more
core   +3 more sources

Multipath Routing Algorithm for Satellite Networks Based on Convolutional Twin Delay Deep Deterministic Policy Gradient [PDF]

Jisuanji kexue
In the satellite network,due to the influence of geographical location and people's living habits,the difference in the needs of users in the satellite coverage area will cause the load imbalance of the satellite network.A multi-path routing algorithm ...
WEI Debin, ZHANG Yi, XU Pingduo, WANG Xinrui
doaj   +1 more source

Energy-Balanced Optimization on Flying Ferry Placement for Data Gathering in Wireless Sensor Networks

IEEE Access, 2021
Deploying flying ferries in large-scaled wireless sensor networks can prevent data gathering and distribution from physical communication restrictions on the ground.
Chih-Lin Hu, Sheng-Zhi Huang, Zhenjiang Zhang, Lin Hui   +3 more
doaj   +1 more source

An Optical Multicast Routing with Minimal Network Coding Operations in WDM Networks

International Journal of Optics, 2014
Network coding can improve the optical multicast routing performance in terms of network throughput, bandwidth utilization, and traffic load balance. But network coding needs high encoding operations costs in all-optical WDM networks due to shortage of ...
Huanlin Liu, Qinren Shen, Yong Chen
doaj   +1 more source

Brown-Field Migration Aware Routing and Spectrum Assignment in Backbone Optical Networks

Applied Sciences, 2022
With the development of optical networks technology, broad attention has been paid to flexible grid technology in optical networks due to its ability to carry large-capacity information as well as provide flexible and fine-grained services through on ...
Xiaosong Yu, Jiye Wang, Kaixin Zhang, Jiaqi Lv, Yongli Zhao, Kaiqiang Gao, Xuerang Guo, Jie Zhang   +7 more
doaj   +1 more source

Limited path percolation in complex networks

, 2007
We study the stability of network communication after removal of $q=1-p$ links under the assumption that communication is effective only if the shortest path between nodes $i$ and $j$ after removal is shorter than $a\ell_{ij} (a\geq1)$ where $\ell_{ij ...
B. Bollobás, D. Stauffer, Eduardo López, H. A. Simon, M. Molloy, P. Erdős, P. Erdős, R. Pastor-Satorras, R. van der Hofstad, Reuven Cohen, Roni Parshani, S. Wasserman, S. N. Dorogovtsev, Shai Carmi, Shlomo Havlin   +14 more
core   +1 more source