No description available.

In an attempt to slow the exhaustion of the Internet Protocol (IP) address space, Class-less Inter-Domain Routing (CIDR) was proposed and adopted. However, the decision to utilize CIDR also increases the size of the routing table, since it allows an arbitrary partitioning of the routing space. We propose a scheme to reduce the size of routing table in the CIDR context. Our approach utilizes a well-known and highly efficient heuristic to perform 2-level logic minimization in order to compress the routing table. By considering the IP routing table as a set of completely specified logic functions, we demonstrate that our technique can achieve about 25% reduction in the size of IP routing tables, while ensuring that our approach can handle routing table updates in real-time. The resulting routing table can be used with existing routers without needing any change in architecture. However, by realizing the IP routing table as proposed in this thesis, the implementation requires less complex hardware than Ternary CAM (TCAM) which are traditionally used to implement IP routing tables. The proposed architecture also reduces lookup latency by about 46%, hardware area by 9% and power consumed by 15% in contrast to a TCAM based implementation.

In this paper, we present a new routing protocol which using the characteristic of Bluetooth on Bluetooth-based mobile ad hoc networks. After observing the existing ad hoc routing protocol, we found there exist some useless routing packets which was helpless to build the routing path and increasing the load of network. We present a new Bluetooth routing protocol (BRP) which use the limited routing table in master device to reducing the routing table size and routing packets. In the simulation results, we show that BRP can reduce the routing overhead in network and avoid to product useless routing packets.

Master’s thesis proposes a new algorithm which enables efficient conversion of graphical representation of warehouse into graph theory representation and consequently accelerates estimation for route costs. The proposed algorithm computes route distances between any places in warehouse based on Breadth first search, image processing „skeletonization“ and Dijkstra algorithm. Using the proposed algorithm it is possible to search routes in a warehouse effectively and fast using precomputed routing table. Searching time is less then milisecond using routing table and even size of warehouse doesn’t affect it significantly instead of using Dijkstra algorithm.

No description available.

Problem of traffic routing in autonomous system is under consideration. The solution of this problem would stabilize the operation of the network in case of accidents and high loads. A method for generating analogy of routing table based on the modification of the actual table. Two test sites were constructed for testing and finding a method of stabilization of an autonomous system routing information. The result of the introduction of an autonomous system route reflectors showed that route reflectors increases the stability of the system routing within an autonomous system and reduces the lack of communication between the nodes. / В работе актуализируется проблема маршрутизации трафика внутри автономной системы. Решение этой задачи позволит стабилизировать работу сети при авариях и высоких нагрузках. Разработан метод генерирования аналога таблицы маршрутизации на основе модификации реальной таблицы. Построены две тестовые площадки для тестирования и поиска метода стабилизации маршрутной информации автономной системы. Результат внедрения в автономную систему отражателей маршрутов показал, что они увеличивают стабильность системы маршрутизации трафика и уменьшают время отсутствия связи между узлами

The diploma thesis deals with the use of a simulation model for the development of an automatic algorithm for the creation of a routing table and route evaluation in a transport system. It includes a search of modeling and simulation issues and state-space search issues with an analysis of available search methods. The simulation model of the transport system is created in the software Tecnomatix Plant Simulation, where an algorithm for automatic creation of routing tables for routing and evaluation of routes according to static criteria is subsequently developed and tested. The work presents a proposal for the principle of the algorithm for evaluating the routes of the transport system, including dynamic criteria and their optimization.