Results 21 to 30 of about 53,951 (279)
Ranking paths in stochastic time-dependent networks [PDF]
, 2014 In this paper we address optimal routing problems in networks where travel times are both stochastic and time-dependent. In these networks, the best route choice is not necessarily a path, but rather a "time-adaptive strategy" that assigns successors to
Kim Allan Andersen +2 more
core +1 more source
Hybrid Optimized Approaches for Routing and Resource Reservation Protocols in Optical Networks
IEEE Photonics Journal, 2021 We have proposed hybrid approaches to solve dynamic provisioning problems in fixed-grid and elastic optical networks (EON). The proposed approaches use the information from the optimization models, which normally are used to solve static problems, to ...
Akhtar Nawaz Khan +5 more
doaj +1 more source
Photonics, 2023 Filterless optical networks (FONs) have become a cost-effective solution for optical network deployment due to their low-cost characteristics. However, eliminating active switching elements causes signals to propagate over unintended links, wasting ...
Junling Yuan +5 more
doaj +1 more source
Fuzzy Clustering with Multi-Constraint QoS Service Routing in Wireless Sensor Networks
Journal of Telecommunications and Information Technology, 2019 This paper presents a fuzzy logic-based, service differentiated, QoS aware routing protocol (FMSR) offering multipath routing for WSNs, with the purpose of providing a service differentiated path meant for communication between nodes, based on actual ...
Jayashree V. Agarkhed +2 more
doaj +1 more source
Dynamic adaptive spectrum allocation in flexible grid optical network with multi‐path routing
IET Communications, 2021 Fragmentation is one of the major issues in elastic optical network (EON) due to its dynamic characteristics which may possibly degrade the spectrum efficiency.
Ujjwal Ujjwal +2 more
doaj +1 more source
Space-Efficient Routing Tables for Almost All Networks and the Incompressibility Method [PDF]
, 1999 We use the incompressibility method based on Kolmogorov complexity to determine the total number of bits of routing information for almost all network topologies. In most models for routing, for almost all labeled graphs $\Theta (n^2)$ bits are necessary
Buhrman, Harry +2 more
core +6 more sources
Application of Traffic Weighted Multi-Map Optimization Strategies to Traffic Assignment
IEEE Access, 2021 Traffic Assignment Problem (TAP) is a critical issue for transportation and mobility models that deals mainly with the calculus and delivery of best-cost routes for the trips in a traffic network.
Alvaro Paricio, Miguel A. Lopez-Carmona
doaj +1 more source
MAP: Medial Axis Based Geometric Routing in Sensor Networks [PDF]
, 2005 One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication.
Bruck, Jehoshua +2 more
core +1 more source
Applied Sciences, 2023 Urban traffic congestion is a pressing issue, demanding effective and cost-efficient solutions. This paper develops the Traffic Weighted Multi-Maps (TWM) method to solve the Traffic Assignment Problem in Intelligent Transportation Systems (ITS).
Alvaro Paricio-Garcia +1 more
doaj +1 more source
International Journal of Interactive Multimedia and Artificial Intelligence, 2020 The concept of Internet of Things (IoT) was proposed by Professor Kevin Ashton of the Massachusetts Institute of Technology (MIT) in 1999. IoT is an environment that people understand in many different ways depending on their requirement, point of view ...
Sumit Kumar +4 more
doaj +1 more source