In cache-enabled networks, contents are cached in intermediate routers to be downloaded by clients. In the past, a multi-armed bandit (MAB) problem-based routing (named MAB-routing) has been proposed in order to effic...
详细信息
ISBN:
(纸本)9798350386851;9798350386844
In cache-enabled networks, contents are cached in intermediate routers to be downloaded by clients. In the past, a multi-armed bandit (MAB) problem-based routing (named MAB-routing) has been proposed in order to efficiently utilize the cached contents. In the MAB-routing, each intermediate router forwards an arrival content request to an appropriate output port based on an MAB algorithm, regarding output ports as arms. By doing so, the MAB-routing becomes increasingly likely to find the corresponding content cached in a router. In this paper, we examine how MAB algorithms affect the performance of the MAB-routing. There exist several MAB algorithms such as epsilon-greedy, Upper Confidence Bound, and Thompson Sampling. Through simulation experiments, we show the performance of the MAB-routing with each algorithm.
The back-pressure algorithm is a well-known throughput-optimal algorithm. However, its delay performance may be quite poor even when the traffic load is not close to network capacity due to the following two reasons. ...
详细信息
ISBN:
(纸本)9781424435128
The back-pressure algorithm is a well-known throughput-optimal algorithm. However, its delay performance may be quite poor even when the traffic load is not close to network capacity due to the following two reasons. First, each node has to maintain a separate queue for each commodity in the network, and only one queue is served at a time. Second, the back-pressure routing algorithm may route some packets along very long routes. In this paper, we present solutions to address both of the above issues, and hence, improve the delay performance of the back-pressure algorithm. One of the suggested solutions also decreases the complexity of the queueing data structures to be maintained at each node.
The backpressure routing policy is known to be a throughput optimal policy that supports any feasible traffic demand in data networks, but may have poor delay performance when packets traverse loops in the network. In...
详细信息
With constant improvement in intelligent technolo- gies across domains, improving intelligence in the maritime sector is very important. Optimal routing of ships in the vast ocean is a tedious task. Unmanned ships nee...
详细信息
This paper considers the problem of permutation packet routing on a √ × √ meshconnected array of processors. Each node in the array is assumed to be independently faulty with a probability bounded above by a va...
详细信息
This paper proposes to adapt parallel sorting/message routing algorithms to route Automated Guided Vehicles (or AGVs for short) on meshlike path topologies. Our strategy guarantees that no conflicts will occur among A...
详细信息
Assuming d-port multiaccepting communication, we design an optimal locally adaptive permutation routing algorithm on the binary hypercube of dimension 7 (called 7-cube). We also prove an Ω(√N/log N) lower bound for ...
详细信息
In 1988, Leighton, Maggs and Rao (1988) showed that for any network and any set of packets whose paths through the network are fixed and edge-simple, there exists a schedule for routing the packets to their destinatio...
详细信息
We investigate the problem of online routing and wave-length assignment and the related throughput maximization problem in wavelength division multiplexing optical networks. It is pointed out that these problems are h...
详细信息
In technical world, many organization and educational institutions need in the use of transportation but they are facing difficulties to give ideal courses to set of vehicles to serve given clients. In order to solve ...
详细信息
暂无评论