Results 11 to 20 of about 8,828 (263)
PAtCH: Proactive Approach to Circumvent Holes in Wireless Sensor Networks
Sensors, 2023 The occurrence of hole regions in Wireless Sensor Networks is a significant challenge when applying a greedy technique in a geographic routing approach.
Moyses M. Lima +3 more
doaj +1 more source
ParRouting: An Efficient Area Partition-Based Congestion-Aware Routing Algorithm for NoCs
Micromachines, 2020 Routing algorithms is a key factor that determines the performance of NoC (Networks-on-Chip) systems. Regional congestion awareness routing algorithms have shown great potential in improving the performance of NoC.
Juan Fang, Di Zhang, Xiaqing Li
doaj +1 more source
Journal of King Saud University: Computer and Information Sciences, 2023 Vehicle routing optimization is a crucial responsibility of transportation service providers, which can significantly reduce operating expenses and improve client satisfaction.
Qi Wang, Chengwei Zhang, Chunlei Tang
doaj +1 more source
Collaborative Content Distribution With an End-to-End Caching Framework
IEEE Access, 2020 While the mobile networks are evolving to a content-centric paradigm, the surging traffic demands keep stressing the ever-increasing network capacities.
Haoru Xing, Wei Song
doaj +1 more source
Frequency dependent wave routing based on dual-band valley-Hall topological photonic crystal
New Journal of Physics, 2021 Previous studies on the propagation direction of valley topological edge states mainly focus on the matching between orbital angular momentum of the excitation source and specific pseudo-spin state of valley edge mode at certain frequency that falls in ...
Guo-Chao Wei +3 more
doaj +1 more source
Winding Roads: Routing edges into bundles [PDF]
Computer Graphics Forum, 2010 AbstractVisualizing graphs containing many nodes and edges efficiently is quite challenging. Drawings of such graphs generally suffer from visual clutter induced by the large amount of edges and their crossings. Consequently it is difficult to read the relationships between nodes and the high‐level edge patterns that may exist in standard node‐link ...
Lambert, Antoine +2 more
openaire +2 more sources
Service-based Routing at the Edge
CoRR, 2019 Future scenarios, such as AR/VR, pose challenging latency and bandwidth requirements in 5G. This need is complemented by the adoption of cloud principles for providing services, particularly for virtualizing service components with which virtualized instances can appear rapidly at different execution points in the network.
Dirk Trossen +5 more
openaire +2 more sources
Fast Edge-Routing for Large Graphs [PDF]
, 2010 To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area involves finding shortest paths in a tangent-visibility graph. However, construction of the full tangent-visibility graph is expensive, at least quadratic time in the number ...
Tim Dwyer, Lev Nachmanson
openaire +1 more source
Scalable node-disjoint and edge-disjoint multiwavelength routing [PDF]
Physical Review E, 2022 Probabilistic message-passing algorithms are developed for routing transmissions in multi-wavelength optical communication networks, under node and edge-disjoint routing constraints and for various objective functions. Global routing optimization is a hard computational task on its own but is made much more difficult under the node/edge-disjoint ...
Yi-Zhi Xu +3 more
openaire +3 more sources
Orthogonal Edge Routing for the EditLens
CoRR, 2016 The EditLens is an interactive lens technique that supports the editing of graphs. The user can insert, update, or delete nodes and edges while maintaining an already existing layout of the graph. For the nodes and edges that are affected by an edit operation, the EditLens suggests suitable locations and routes, which the user can accept or adjust. For
Stefan Gladisch +3 more
openaire +2 more sources