… dynamic’routing strategy associated with a single idealized node in a data network. We
analyze a dynamic routing policy where messages, or packets, that arrive at a certain node are …

… problem of optimal routing in data networks… routing problems representative of today’s data
networks, and • To describe our approach to solving the optimal shortest-path routing problem…

… the routing problem is the static version: the graph is given in advance and the problem
consists … We saw that it is not easy to design a compact data structure for a minimal routing time, …

… establish the model of energy-aware routing problem. Then, we prove that it is an NP-Hard
problem by reducing from 0-1 Knapsack problem into the energy-aware routing problem. …

… In Section V, we study the routing problem with caching taken into account. Through
analysis and simulation comparisons, we verify the same results as that without caching. The …

… The brain behind the network routing also deals with the principle that send data from source
to destination or end users. The major path it follows and medium is what is determined by …

… In this paper, a novel TSPN algorithm is proposed for solving this robot routing problem, …
points is formulated as a continuous optimization problem. The advantage is that given the …

… In contrast, we believe that the disconnected network problem is also a … routing protocol
that can support highly diverse network topologies. In this study, we use vehicle traffic data …

… for the data gathering and routing problem with in-network … the network lifetime by utilizing
data aggregation and in-network … problem of optimal data routing with data aggregation en …

… its data throughput over the network be guaranteed at or above a certain rate. … networks is
likely to be connection-oriented for real-time traffic.' This article focuses on the routing problem …