Results 21 to 30 of about 47,653 (229)
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
Ranking paths in stochastic time-dependent networks [PDF]
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
Dynamic adaptive spectrum allocation in flexible grid optical network with multi‐path routing
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
Fuzzy Clustering with Multi-Constraint QoS Service Routing in Wireless Sensor Networks
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
Application of Traffic Weighted Multi-Map Optimization Strategies to Traffic Assignment
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
An efficient shortest path routing algorithm in the data centre network DPillar. [PDF]
DPillar has recently been proposed as a server-centric data centre network and is combinatorially related to the well-known wrapped butterfly network. We explain the relationship between DPillar and the wrapped butterfly network before proving a symmetry
A Greenberg+9 more
core +2 more sources
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
Space-Efficient Routing Tables for Almost All Networks and the Incompressibility Method [PDF]
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
MAP: Medial Axis Based Geometric Routing in Sensor Networks [PDF]
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
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