GARCIA-LUNA-ACEVES, J., J.PARSA, MICHAELJ. Raju et al., "System and Method for Information Object Routing in Computer Networks," U.S. Patent 7,552,233, June 23, 2009
The application of neural networks to the optimum routing problem in packet-switched computer networks, where the goal is to minimize the network-wide average time delay, is addressed. Under appropriate assumptions, the optimum routing algorithm relies heavily on shortest path computations that have to...
Routing methods in that environment works on the basis of store-and-forward. However, reasonable use of scarce resources in such networks, like Ad-hoc networks, is necessary. After reviewing some important key factors, we have compared two antithesis methods: Epidemic and PROPHET. 展开 关键词: ...
Hence, reinforcement learning algorithms viable options for addressing a variety of computer networking challenges. In this dissertation, we propose two applications of reinforcement learning algorithms in computer networks.We first investigate the applications of reinforcement learning for deflection routing in...
The existence of a wide variety of services with different QoS requirements suggests the devising of specific measurement methods for each traffic type. For instance, real time traffic performance is evaluated by delay and packet losses which can be assessed through network probes installed at domain...
A survey on methods to provide multipath transmission in wired packet networks Jerzy Domżał, ... Robert Wójcik, in Computer Networks, 2015 2.2 Multi-topology routing Multi-Topology Routing (MTR) allows each router in a network to maintain several valid routes to the same destination over ...
We conceal a method for scaled routing in the quantum Internet with deterministic and adaptive routing in the subnetworks. 4. The methods fuse the fundamentals of queueing theory and the theory of quantum networking and entangled networks. This paper is organized as follows. “System model and pr...
In other words, the trajectories of these R-nodes will have to be adaptively controlled. We propose various methods to control the trajectories of an R-node based on information exchanged within a local vicinity of the current position of the R-node. Of these methods, we find by simulations...
This classification falls short in providing a perspective in wireless OR networks (our main focus herein) since it does not consider the broadcast nature of wireless networks. In Fig. 7, we present a taxonomy of OR metrics in terms of their computation methods and computation scopes. The ...
routes are chosen in a more flexible fashion. Dynamic methods has proved to be important tools to adapt networks to changing traffic demands, shifts in traffic patterns and network failures, as well as to even out excessive idle capacity in some parts of the network and overload in other ...