Routing Domain Research Articles

Neural Network Estimators for Optimal Tour Lengths of Traveling Salesperson Problem Instances with Arbitrary Node Distributions

It is essential to solve complex routing problems to achieve operational efficiency in logistics. However, because of their complexity, these problems are often tackled sequentially using cluster-first, route-second frameworks. Unfortunately, such two-phase frameworks can suffer from suboptimality due to the initial phase. To address this issue, we propose leveraging information about the optimal tour lengths of potential clusters as a preliminary step, transforming the two-phase approach into a less myopic solution framework. We introduce quick and highly accurate Traveling Salesperson Problem (TSP) tour length estimators based on neural networks (NNs) to facilitate this. Our approach combines the power of NNs and theoretical knowledge in the routing domain, utilizing a novel feature set that includes node-level, instance-level, and solution-level features. This hybridization of data and domain knowledge allows us to achieve predictions with an average deviation of less than 0.7% from optimality. Unlike previous studies, we design and employ new instances replicating real-life logistics networks and morphologies. These instances possess characteristics that introduce significant computational costs, making them more challenging. To address these challenges, we develop a novel and efficient method for obtaining lower bounds and partial solutions to the TSP, which are subsequently utilized as solution-level predictors. Our computational study demonstrates a prediction error up to six times lower than the best machine learning (ML) methods on their training instances and up to 100 times lower prediction error on out-of-distribution test instances. Furthermore, we integrate our proposed ML models with metaheuristics to create an enumeration-like solution framework, enabling the improved solution of massive-scale routing problems. In terms of solution time and quality, our approach significantly outperforms the state-of-the-art solver, demonstrating the potential of our features, models, and the proposed method. History: This paper has been accepted for the Transportation Science Special Issue on Machine Learning Methods and Applications in Large-Scale Route Planning Problems. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2022.0015 .

Inventory Routing Problem: A Problem that is Still Relevant Today

The most important challenge of a supply chain is the control of its logistics costs. The managers who drive the various logistics flows tend to reduce its overall costs in order to achieve overall profits. Among the problems that help them achieve their goals is the inventory routing problem (IRP). In its classical definition, IRP is an integration tool that can provide a joint answer to inventory management and vehicle routing problems. In this review article, we present an overview of supply chain management with a focus on the inventory routing domain. We will start by introducing the concept of IRP and the various works done in this area since its emergence that have contributed to its development. Then, we will discuss recent research and take the most studied model to expose its impact on the development of this research area until today. This paper shows that despite the age of this tool, this field of research has maintained its importance and continues to evolve and produce considerable research articles.

A Comparative Study of Routing Protocols for Minimum Path Cost Matric in MANETS

The Routing is the process of transmitting data packets from one node to another another node from source to destination The Mobile Adhoc Networks (MANETs ) doesn't have any fixed network structure or any centralized process to administer. The selection of the route is important for performance of packet transfer from source to destination. These routing protocol are classified as inter domain routing and Intra domain routing protocol. The routing protocols have been classified into Non Reactive , Reactive and Hybrid protocols. In the present paper we proposes to compare reactive routing protocols videlicet Ad hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR) protocols, Temporarily Ordered Routing Algorithm (TORA) and Associativity Grounded Routing (ABR) protocol.The Routing in MANETs is a one of the robustly and demanding task and has entered a great quantum of mindfulness from experimenters around the globe. To overcome this problem, a colorful number of routing classes have been introduced and the number is still rising day by day fastly. It's relatively hard to decide which protocols or routing classes may do well under an quantum of different network scripts similar as network volume and network topology etc. The study and performance of the above mentioned protocol has also been tabulated in the present two tables . The protocols are based on minimum power and temporary configuration of topology. The table 1 gives comparison of the main characteristics of routing protocols and Table2. provide comparison of various reactive routing protocol.

A Heuristic Approach to Detect MPLS L3 VPN Misconfiguration in Multi-Homed Multi-VRF Site-Redundant CE Environments

MPLS L3 VPNs are often configured manually and are prone to errors. Misconfigured VPNs violate customer’s privacy and security. With the advent of the Multi-VRF (VRF-Lite) feature on the CE, it is now possible to support two or more routing domains on a single CE. Customers can also add more CE devices in redundant configurations having multi-homed connections to service providers’ PE routers for enhanced reliability and high availability of MPLS L3 VPNs. This scenario adds more complexity increasing the reasonable probability of misconfiguration. MINA algorithm can detect errors in the MPLS infrastructure without the cooperation of the service providers. However, the MINA algorithm works for single-homed CE configured for a single VRF per CE. In this paper, we extend the MINA algorithm using a heuristic-based approach to detect misconfiguration in the MPLS infrastructure connected to Multi-VRF, Multi-homed, site-redundant CE environments. We effectively utilize both control-plane and data-plane information to demonstrate the detection of one-way and discovery of two-way RT (Route Targets) misconfiguration. The heuristic method can further detect the probable location/site and pinpoint the shared CE-customer affected by this misconfiguration.

Running on Empty: The Challenge of Managing Internet Addresses

Over a quarter century has passed since IP addresses from the Internet’s now globally ubiquitous (IPv4) address pool first began to be distributed to and used by operators of the 28,000 and counting independent routing domains that constitute today’s Internet. At current demand rates, the total pool of IPv4 addresses is expected to be fully allocated within the next 3-5 years. Despite the looming exhaustion of the address pool, many Internet network operators have exhibited reluctance to transition to the successor address resource pool (IPv6). In light of the looming scarcity of IPv4 addresses, there is growing interest in the potential for market-based allocation mechanisms to induce more efficient use of the IPv4 address space and to smooth the transition to IPv6. Some of these proposals include allowing existing allocations to be reclaimed or traded to supplement the supply of IPv4 addresses to meet continuing demand. This paper will provide an appropriate contextual framing, suitable for a multidisciplinary audience, of the ongoing discussion of how market forces might be introduced to enhance the management of the Internet address space. We discuss some of the proposals currently under consideration and highlight the key points of contention. While we conclude that market-based incentives can play an important role, how they are implemented needs to be carefully considered in light of the requirements for Internet routing, the politics of global Internet governance, and the likely implications on the transition to IPv6. For example, we believe inappropriately allowing unrestricted trading of IPv4 addresses could have the perverse effect of increasing the aggregate costs of Internet routing, retarding the migration to IPv6, and thereby adversely impacting Internet growth and architecture. On the other hand, while the existing framework for Internet address management has served reasonably well to date, retaining the status quo is likely to result in a burgeoning black/grey market in IPv4 addresses and similar unfavorable outcomes with respect to aggregate costs and Internet architecture. Further research and collective discussion is needed to identify how best to forge a middle road toward improved Internet address management. The discussion provided herein is intended to help frame and seed the debate.

Automatic detection technique for voice quality inter-disciplinary methodologies

This paper mainly studies process of dynamic routing in a multi-level perspective the mobile radio network based on the new generation of radio enhance the mobility a new and higher quality of service is required for different types of traffics,The Routing protocol in data networks will understand a formal set of rules and agreements on sharing network information between routers to determine the route of data transmission that satisfies a given quality of service requirements and provides a balanced load across the mobile radio network as a whole. including routing issues, devoted to the work of scientists, For modern computer networks of large dimension is typical multilevel routing in which in some way divided into a subnet routing domains, with at the most efficient protocol subnets group IGP, EGP group and protocols between networks. It is proposed to use a well-known proactive routing protocol OLSR multipoint handoff service packages as part of a hybrid protocol (HWMP). The description, the algorithm and the features of the implementation of the proactive protocol (OLSR). © 2018 JASET, International Scholars and Researchers Association

Context Analysis of Customer Requests using a Hybrid Adaptive Neuro Fuzzy Inference System and Hidden Markov Models in the Natural Language Call Routing Problem

Abstract The context analysis of customer requests in a natural language call routing problem is investigated in the paper. One of the most significant problems in natural language call routing is a comprehension of client request. With the aim of finding a solution to this issue, the Hybrid HMM and ANFIS models become a subject to an examination. Combining different types of models (ANFIS and HMM) can prevent misunderstanding by the system for identification of user intention in dialogue system. Based on these models, the hybrid system may be employed in various language and call routing domains due to nonusage of lexical or syntactic analysis in classification process.

Location arc routing problem with inventory constraints

Dust suppression of hauling roads in open pit mines is done by periodically spraying water from a water truck. The objective of this paper is to present and compare two methods for locating water depots along the road network so that penalty costs for the lack of humidity in roads and routing costs are minimized. Because the demands are located on the arcs of the network and the arcs require service more than once in a time horizon, this problem belongs to the periodic capacitated arc routing domain. We compare two methods for finding the initial depot location. We then use an exchange algorithm to modify the initial location and an adaptive large neighborhood search algorithm to modify the initial routing of vehicles. This method is the first one used for depot location in periodic arc routing problems.

BGP Design for the Separation of the Local Big Data Traffic in Data Center

As the service for big data increases, the number of analysis servers for big data grows rapidly. For example, the scale of analysis servers for the big data from Large Hadron Collier in Swiss CERN is generally beyond tens of thousands of servers. Therefore, tasks for the selection of the appropriate local routing protocol and the efficient configuration of the routing protocol for those servers are getting more important portion in the local network administration in big data center. In this paper, we introduce BGP as a routing protocol for the local network of big data center even though it is developed for WAN. The concept we introduced in this paper for the separation of big data traffic in local data center network is created based on the concept of the partition of the conference room in convention center. The main conference room can be partitioned by multiple small meeting rooms according to users’ requests. Each small room can be protected from the noise of the neighbor meeting rooms by partition walls. In the same way, the huge number of servers can be grouped into various server farms and then each of server farms can be identified Autonomous System number that is used for the BGP routing domain for network administrator. Using the techniques of AS numbering we can control the big data traffic more efficiently than ever in data center. We introduced new application method of AS number for a service to recognize certain traffic. Therefore, we can separate and control big data traffic more in detail. We tried to prove that BGP is superior to IGP and overlay networking with respect to the routing control in big data center.

Channel routing based on ant colony adaptive behavior model

Based on the comparative analysis of existing approaches and methods for solving routing, routing completion, and rerouting of connections in VLSI, multiagent intelligent optimization methods are used. They are based on the simulation of adaptive behavior of an ant colony. The problem considered in this paper is represented by a set of components of the ant colony algorithm. Heuristics governing the behavior of an ant as it moves in the search graph are developed. A distinctive feature of the proposed algorithm is its capability to take into account some characteristics, such as the distribution of resources, hindrance effects (blockings), the number of transitions between layers, the number of inflections, etc., which are very difficult to take into account when calculating how the wave propagates. The routing algorithm was tested and compared with other known algorithms on a set of benchmarks. Compared with the available algorithms, the quality of solutions is improved by up to 3%. A promising direction of improving the algorithm is the use of an extended routing domain that admits a small increase in the route length but minimizes the hindrances. The efficiency of the algorithm can be improved by an adaptive control of algorithm parameters.

A New Attack on Link-State Database in Open Shortest Path First Routing Protocol

Open Shortest Path First (OSPF) protocol known as interior gateway of routing protocol is a major competitor for Cisco's EIGRP of a special routing protocol. Most attacks on this protocol are based on LSA fake router which the attacker has control over it. These attacks can affect the part of the routing domain or cause severe damage based on the strategic location of the router in the AS to bring domain routing. Attacks that cause much damage to a network security mechanism and enables fight-back will not have effect on routing domain. In this paper we will describe an attack that can arbitrarily change the routing domain routing table with harmfully threats without fight back mechanism enabled.

Strategic Information Disclosure to People with Multiple Alternatives

In this article, we study automated agents that are designed to encourage humans to take some actions over others by strategically disclosing key pieces of information. To this end, we utilize the framework of persuasion games—a branch of game theory that deals with asymmetric interactions where one player (Sender) possesses more information about the world, but it is only the other player (Receiver) who can take an action. In particular, we use an extended persuasion model, where the Sender’s information is imperfect and the Receiver has more than two alternative actions available. We design a computational algorithm that, from the Sender’s standpoint, calculates the optimal information disclosure rule. The algorithm is parameterized by the Receiver’s decision model (i.e., what choice he will make based on the information disclosed by the Sender) and can be retuned accordingly.We then provide an extensive experimental study of the algorithm’s performance in interactions with human Receivers. First, we consider a fully rational (in the Bayesian sense) Receiver decision model and experimentally show the efficacy of the resulting Sender’s solution in a routing domain. Despite the discrepancy in the Sender’s and the Receiver’s utilities from each of the Receiver’s choices, our Sender agent successfully persuaded human Receivers to select an option more beneficial for the agent. Dropping the Receiver’s rationality assumption, we introduce a machine learning procedure that generates a more realistic human Receiver model. We then show its significant benefit to the Sender solution by repeating our routing experiment. To complete our study, we introduce a second (supply--demand) experimental domain and, by contrasting it with the routing domain, obtain general guidelines for a Sender on how to construct a Receiver model.

Bridging the Gap Between Theory and Practice in the Vehicle Routing Research

Research studying effective planning and optimization in the vehicle routing field has increased tremendously in the last few decades. Advances in technology and computational power have encouraged researchers to consider various vehicle routing problem types and constraints, and to experiment with new algorithmic techniques that can be applied for the automation of vehicle planning. Despite this, research in the vehicle routing domain is often accused of being too idealistic. Given the difficulty of solving vehicle routing problems, many simplifying assumption are being incorporated into problem solving techniques, in order to make the solution approach more manageable. In this paper we discuss some real life constraints that the research community should be aware of when addressing vehicle routing problems. We highlight how theoretical research in this area can be integrated into commercially applicable software. An overview of future trends in scientific research tackling this issue is also provided. This paper tries to give an insight into how developing richer vehicle routing models can help in realistic settings to improve logistic planning.

Essence and Emergence of Routing (As a Best Service)

This Research Paper emphasize on customize route computation should be offered as a ervice by Third Party Providers.In Internet routing, there is a fundamental tussle between the end users who want control over the end-to-end paths and the Autonomous Systems (ASes) who want control over the flow of traffic through their infrastructure. To resolve this tussle and offer flexible routing control across multiple routing domains, we argue that customized route computation should be offered as a service by third-party providers. Outsourcing specialized route computation allows different path-selection mechanisms to coexist, and evolve over time.

Improvement of BGP Session Maintenance

In the early days, the Internet used static routes, but very quickly network administrators couldnt keep manually updating their routing tables. Later, Internet network administrator used a protocol called EGP but EGP was not scalable so BGP was introduced to solve all problems and more. BGP stands for Border Gateway Protocol and the most current version is BGP4. BGP is a routing protocol that runs on routers. BGP allows fully decentralized management of the Internet. That means, if BGP router is on the Internet, it can tell all other routers that what networks are available to everyone in the world. BGP calls each routing domain an autonomous system (AS). It selects the best path, through the Internet, by choosing the route that has to traverse the fewest autonomous systems. As BGP provides information for controlling the flow of packets between ASes, the protocol plays a critical role in Internet efficiency, reliability, and security. However, slow convergence and abnormal termination of session are major vulnerability of BGP. Simplifying BGP design complexity helps in research, for the root cause analysis of BGP. Deriving technique to prevent the loss of data, reduce the convergence time and maintaining the sessions of BGP by instantly diverting the traffic from teardown / flapped link to the backup link considering as active link. It will be a great success to achieve the goal to maintain the sessions and reduce the BGP convergence time.

A Local Fast-Reroute mechanism for single node or link protection in hop-by-hop routed networks

Network survivability has become one of the most important QoS (Quality of Service) parameters in IP network-based applications, particularly with regard to real-time multimedia applications. IP-based protection that enable recovery from failure in just a few milliseconds can provide greater network resilience than traditional routing recovery or other lower-layer recovery technologies. This paper proposes an IP protection scheme, called IP Local Fast-Reroute (IPLFRR), for single node or link protection. This scheme works in an intra-area routing domain, providing a simple and efficient solution to improve the survivability of IP networks. Unlike MPLS Fast-Reroute, which requires an extra MPLS layer and related protocols, the proposed scheme is applicable to a network employing conventional IP routing and forwarding. Moreover, our mechanism is capable of preventing service disruptions and packet loss caused by the transient loops that normally occur during reconvergence of the network following a failure. Because the backup next-hops are predetermined, service interruption can be limited to a few milliseconds, which is on par with the failure detection time. Simulation results show that IPLFRR is capable of improving network survivability, following the failure of a single node or link.

A Physical Design Method for a New Memory-Based Reconfigurable Architecture without Switch Blocks

In this paper, we propose a placement and routing method for a new memory-based programmable logic device (MPLD) and confirm its capability by placing and routing benchmark circuits. An MPLD consists of multiple-output look-up tables (MLUTs) that can be used as logic and/or routing elements, whereas field programmable gate arrays (FPGAs) consist of LUTs (logic elements) and switch blocks (routing elements). MPLDs contain logic circuits more efficiently than FPGAs because of their flexibility and area efficiency. However, directly applying the existing placement and routing algorithms of FPGAs to MPLDs overcrowds the placed logic cells and causes a shortage of routing domains between logic cells. Our simulated annealing-based method considers the detailed wire congestion and nearness between logic cells based on the cost function and reserves the area for routing. In the experiments, our method reduced wire congestion and successfully placed and routed 27 out of 31 circuits, 13 of which could not be placed or routed using the versatile place and route tool (VPR), a well-known method for FPGAs.

Improving Convergence Speed and Scalability in OSPF: A Survey

Open Shortest Path First (OSPF), a link state routing protocol, is a popular interior gateway protocol (IGP) in the Internet. Wide spread deployment and years of experience running the protocol have motivated continuous improvements in its operation as the nature and demands of the routing infrastructures have changed. Modern routing domains need to maintain a very high level of service availability. Hence, OSPF needs to achieve fast convergence to topology changes. Also, the ever-growing size of routing domains, and possible presence of wireless mobile adhoc network (MANET) components, requires highly scalable operation on part of OSPF to avoid routing instability. Recent years have seen significant efforts aimed at improving OSPF's convergence speed as well as scalability and extending OSPF to achieve seamless integration of mobile adhoc networks with conventional wired networks. In this paper, we present a comprehensive survey of these efforts.

Inter-domain collaborative routing (IDCR): Server selection for optimal client performance

Communication between institutions, or domains, residing in the Internet requires a route to be created between the routing domains. Each of these domains is controlled by a single administrative authority, and is referred to as an autonomous system (AS). Control of routes that move the data in the Internet between ASes is problematic. If an AS requires certain route characteristics beyond the selection of the first hop, the AS must pay for some type of special service from its Internet service provider (ISP). The ISP can provide integrity of the data using end-to-end encryption, but the customer AS still does not have control over the route. In other words, an organization is unable to prevent its data from passing through certain parts of the Internet. We believe that a service allowing an AS to select from alternate routes, on behalf of an organization, could meet this need for route customization. The alternate routes could be created to meet the requirements of the source AS, such as the avoidance of another AS. The service must minimize the incremental cost (in hops) of the alternate routes and maximize the probability that an alternate route will be found. We measure the effectiveness of several algorithms as they are used to select ASes to deploy a solution, called inter-domain collaborative routing (IDCR), that allows “friend” routers to collaboratively determine a route. Key to the performance of IDCR is the placement of “friend” routers in the Internet. We explore the trade-off between placing “friend” routers in various levels of the hierarchy of routers in the Internet. In order to measure the effectiveness of IDCR as the set of ASes deploying the service is varied, we track the probability of routing success and monitor the incremental cost in hops as the service creates alternate routes in several small but representative network models. We evaluate three algorithms used to determine which routers should support the IDCR service. The first, called the degree algorithm, categorizes the routers into a hierarchy, based only on the nodal degree of the router [1]. The second, called the factor algorithm, calculates an IDCR factor for each router and uses that to rank select routers to provide the service. Finally, the greedy algorithm, serving as the baseline, iterates across all candidate routers, selecting routers one at a time based on the performance of the service.

Patrol Routing Expression, Execution, Evaluation, and Engagement

Recommended patrol routes can be used by organizations such as police agencies, emergency medical responders, and taxi services whose agents patrol roadway segments at proper times to assist or deter their target events. The creation of optimal complementary patrol routes for multiple agents targeting temporal event hotspots and minimizing travel distance is an NP-hard combinatorial problem that belongs to a class of problems known as the vehicle routing problem with time windows (VRPTW). Traffic safety patrol routing problems share many characteristics of VRPTW problems but differ in ways that prevent the application of existing solutions. In our approach, nondeterministic patrol routing algorithms are used to specify the movements of simulated mobile agents on a roadway system. Nondeterminism is critical in the traffic safety patrol routing domain, as rigidity and predictability can negatively impact the effectiveness of law enforcement agents' efforts.This paper addresses the problem of expressing, executing, evaluating, and engaging patrol routing algorithms that target event hotspots on roadways. The patrol algorithms are first expressed using Turn, which is our extensible domain-specific language (DSL) created for this purpose. Algorithms specified using Turn syntax are then executed in a custom simulation environment. Utilizing predefined metrics, users evaluate the resulting patrol routes to ensure that the criteria of interest in a given patrol context are met. Acceptable patrol routes are then engaged by end users via a web-based geographic information system (GIS) portal. To demonstrate the applicability and efficacy of our approach, we present two illustrative case studies.