scispace - formally typeset
Search or ask a question

Showing papers on "Static routing published in 2020"


ReportDOI
01 Mar 2020
TL;DR: This document describes the Se segment Routing Extension Header and how it is used by Segment Routing capable nodes.
Abstract: Segment Routing can be applied to the IPv6 data plane using a new type of Routing Extension Header. This document describes the Segment Routing Extension Header and how it is used by Segment Routing capable nodes.

119 citations


Journal ArticleDOI
TL;DR: In the proposed scheme, the participation of ordinary nodes in the network is 95.9 %, which not only balances load between participating nodes but also improves the network lifetime in the presence of field-proven schemes.
Abstract: Owing to the limited resources of sensor nodes, we propose an efficient hybrid routing scheme using a dynamic cluster-based static routing protocol (DCBSRP), leveraging the ad hoc on-demand distance vector (AODV) routing protocol and low-energy adaptive clustering hierarchy (LEACH) protocol. In the proposed scheme, the cluster head (CH) nodes are formed dynamically for a fixed interval, whereas static routing is applied in the designated clusters by utilizing the AODV routing protocol. The static routing condition of the proposed scheme limits all connected nodes of the cluster for a defined interval of time (T) to share their collected information through a specific CH node. Once the time (T) interval is completed, all ordinary nodes connected with the specific CH are released and they are free to advertise their CH candidateship within the network. Likewise, the node receiving the maximum number of route replies (RREPs) is selected as the next CH node in the vicinity of deployed sensor nodes. However, with the DCBSRP protocol, the recently selected CH node does not advertise its candidateship for five consecutive cycles and acts as an ordinary node. The simulation result shows significant improvement in the lifetime and participation of ordinary nodes in the network until the end-stage of the network. In the proposed scheme, the participation of ordinary nodes in the network is 95.9 %, which not only balances load between participating nodes but also improves the network lifetime in the presence of field-proven schemes. Moreover, the simulation results show an out-performance of rival schemes in terms of communication cost, end to end delay, throughput, packet lost ratio, and energy consumption.

42 citations


Proceedings ArticleDOI
Samuel Steffen1, Timon Gehr1, Petar Tsankov1, Laurent Vanbever1, Martin Vechev1 
30 Jul 2020
TL;DR: NetDice is introduced, the first scalable and accurate probabilistic network configuration analyzer supporting BGP, OSPF, ECMP, and static routes and automatically identifies a set of links whose failure is provably guaranteed not to change whether φ holds.
Abstract: Not all important network properties need to be enforced all the time. Often, what matters instead is the fraction of time / probability these properties hold. Computing the probability of a property in a network relying on complex inter-dependent routing protocols is challenging and requires determining all failure scenarios for which the property is violated. Doing so at scale and accurately goes beyond the capabilities of current network analyzers. In this paper, we introduce NetDice, the first scalable and accurate probabilistic network configuration analyzer supporting BGP, OSPF, ECMP, and static routes. Our key contribution is an inference algorithm to efficiently explore the space of failure scenarios. More specifically, given a network configuration and a property φ, our algorithm automatically identifies a set of links whose failure is provably guaranteed not to change whether φ holds. By pruning these failure scenarios, NetDice manages to accurately approximate P(φ). NetDice supports practical properties and expressive failure models including correlated link failures. We implement NetDice and evaluate it on realistic configurations. NetDice is practical: it can precisely verify probabilistic properties in few minutes, even in large networks.

31 citations


Journal ArticleDOI
TL;DR: A multi path routing protocol based on estimated probability locations with path diversion at necessary places along path is proposed for improved routing performance without larger packet overhead.

30 citations


Posted Content
TL;DR: This work simulates and optimize demand-responsive PT fleets via a commonly used linear programming formulation and measures their performance, suggesting that the optimized performance is mainly affected by the skew of the noise distribution and the presence of infrequently large prediction errors.
Abstract: As Public Transport (PT) becomes more dynamic and demand-responsive, it increasingly depends on predictions of transport demand. But how accurate need such predictions be for effective PT operation? We address this question through an experimental case study of PT trips in Metropolitan Copenhagen, Denmark, which we conduct independently of any specific prediction models. First, we simulate errors in demand prediction through unbiased noise distributions that vary considerably in shape. Using the noisy predictions, we then simulate and optimize demand-responsive PT fleets via a commonly used linear programming formulation and measure their performance. Our results suggest that the optimized performance is mainly affected by the skew of the noise distribution and the presence of infrequently large prediction errors. In particular, the optimized performance can improve under non-Gaussian vs. Gaussian noise. We also obtain that dynamic routing can reduce trip time by at least 23% vs. static routing. This reduction is estimated at 809,000 EUR per year in terms of Value of Travel Time Savings for the case study.

18 citations


Journal ArticleDOI
TL;DR: Novel Wireless Transient Bounds (WTB) for end-to-end delay and backlog in a multi-hop wireless network using stochastic network calculus approach is derived and the obtained results can be applied to a mesh network with static routing using a concept called ’ leftover service’.
Abstract: In this article, we investigate the transient behavior of a sequence of packets/bits traversing a multi-hop wireless network under static routing. Our work is motivated by novel applications from the domain of process automation, Machine-Type Communication (MTC) and cyber-physical systems, where short messages are communicated and statistical guarantees need to be provided on a per-message level. In order to optimize such a network, apart from understanding the stationary system dynamics, an understanding of the short-term dynamics (i.e. transient behavior) is also required. To this end, we derive novel Wireless Transient Bounds (WTB) for end-to-end delay and backlog in a multi-hop wireless network using stochastic network calculus approach. We start by analyzing a single end-to-end path, i.e. a line topology, and then we show how the obtained results can be applied to a mesh network with static routing using a concept called ’ leftover service ’. WTB depends on the initial backlog at each node as well as the instantaneous channel states. We numerically compare WTB with Kernel-Based-Transient Bound (KBTB), which can be obtained by adapting existing stationary bound, as well as simulated end-to-end delay of the investigated network. While KBTB and stationary bounds are not able to capture the short-term system dynamics well, WTB provides relatively tight upper bound and has a decay rate that closely matches the simulation. This is achieved by WTB only with a slight increase in the computational complexity, by a factor of $O(T+N)$ , where $T$ is the duration of the arriving sequence and $N$ is the number of hops in the network. We believe that the presented analysis and the bounds are necessary tools for future work on transient network optimization for many important emerging applications, e.g., massive MTC, critical MTC, edge computing and autonomous vehicle.

11 citations


Journal ArticleDOI
TL;DR: A formal modeling of a Network-on-Chip (NoC) using a communicating finite state machine (CFSM) is presented in this article and it is shown that this situation actually depicts cyclic dependencies among the different NoC components.
Abstract: A formal modeling of a Network-on-Chip (NoC) using a communicating finite state machine (CFSM) is presented in this article. We have automated the CFSM model generation for NoCs with Mesh and Torus topologies. To verify deadlock in an NoC, we need to consider the formal model of all the routers in a given topology. It is not supported by the available verification tools due to the state space explosion problem. An NoC simulator gives only a warning message about a possible deadlock, which does not guarantee a real deadlock situation. Therefore, we have developed a simulation framework based on our CFSM models of NoCs in which any routing algorithm can be simulated over a given traffic pattern. Our simulation framework confirms real deadlock when simulation reaches a state from which no progress is possible. We have shown that this situation actually depicts cyclic dependencies among the different NoC components. As a proof of concept, we have implemented our simulation framework for one static routing and two adaptive routing algorithms. The experimental results show that our method is scalable. This is possible because we only check the existence of a deadlock for a given traffic pattern at a time, rather than for all possible traffic patterns. Our approach opens up a way to verify other NoC properties such as starvation, livelock, and so on for a given routing algorithm for any realistic traffic patterns.

9 citations


Proceedings ArticleDOI
Jiamin Cao1, Yu Zhou1, Ying Liu1, Mingwei Xu1, Yongkai Zhou 
13 Oct 2020
TL;DR: TurboNet, a new network emulator that leverages one programmable switch to enable faithful emulation of both network data plane and control plane, and provides API for operators to simplify network emulation tasks is proposed.
Abstract: Faithfully emulating networks is critical for verifying the correctness and effectiveness of new networking-related designs. Existing network experiment platforms either cannot faithfully emulate functionality and performance of production networks or cannot scale well because of cost limitations. In this paper, we propose TurboNet, a new network emulator that leverages one programmable switch to enable faithful emulation of both network data plane and control plane. For data plane emulation, we present a series of key designs such as port mapper, queue mapper, and delayed queue to emulate network topologies and performance metrics with high flexibility and accuracy. For control plane emulation, we support static routing configurations, distributed routing agents, and the centralized routing controller. Meanwhile, we provide API for operators to simplify network emulation tasks. We implement TurboNet on a Tofino switch. The evaluation results show that: (1) TurboNet can flexibly emulate various topologies such as the 8-ary fat-tree on the data plane and support about 200 BGP agents with 25% CPU usage on the control plane; (2) TurboNet can accurately emulate different network performance metrics, including 400Gbps linerate background traffic injection, as small as 10–8 link loss, and microsecond-level to millisecond-level link delay.

8 citations


Proceedings ArticleDOI
09 Jun 2020
TL;DR: This paper presents a reinforcement learning solution to obtain optimal routing paths from a source to a destination when the typical transmission time is stochastic and unknown, and ensures that the policy only makes safe routing decisions, thus never violating pre-determined timing constraints.
Abstract: Time-critical networks require strict delay bounds on the transmission time of packets from source to destination. Routes for transmissions are usually statically determined, using knowledge about worst-case transmission times between nodes. This is generally a conservative method, that guarantees transmission times but does not provide any optimization for the typical case. In real networks, the typical delays vary from those considered during static route planning. The challenge in such a scenario is to minimize the total delay from a source to a destination node, while adhering to the timing constraints. For known typical and worst-case delays, an algorithm was presented to (statically) determine the policy to be followed during the packet transmission in terms of edge choices. In this paper we relax the assumption of knowing the typical delay, and we assume only worst-case bounds are available. We present a reinforcement learning solution to obtain optimal routing paths from a source to a destination when the typical transmission time is stochastic and unknown. Our reinforcement learning policy is based on the observation of the state-space during each packet transmission and on adaptation for future packets to congestion and unpredictable circumstances in the network. We ensure that our policy only makes safe routing decisions, thus never violating pre-determined timing constraints. We conduct experiments to evaluate the routing in a congested network and in a network where the typical delays have a large variance. Finally, we analyze the application of the algorithm to large randomly generated networks.

8 citations


Journal ArticleDOI
TL;DR: The transmission scenario of ground station switching with connected satellites is introduced and the problem of data packet loss caused by ground station and satellite communication link switching is analyzed, with software-simulated test results showing that both approaches can effectively avoid packet loss.
Abstract: Low earth orbit (LEO) satellite systems, an important part of the next generation of global communication systems, have the advantages of low transmission delay, low satellite cost and low launch cost. The construction of an LEO satellite network with global coverage has become the direction of future space network transmission development. Although extensive research has been conducted on the routing of LEO satellite networks, most papers focus on only space segment routing, with little attention paid to the route between the satellite and ground station. This paper introduces the transmission scenario of ground station switching with connected satellites and analyzes the problem of data packet loss caused by ground station and satellite communication link switching. Two optimization strategies based on static routing and dynamic routing are proposed as solutions to the problem of data packet loss, with software-simulated test results showing that both approaches can effectively avoid packet loss.

8 citations


Journal ArticleDOI
TL;DR: The proportion optimal RMSTA (PO-RMSTA) heuristic algorithm with three sorting strategies is proposed and proved to obtain the approximate optimal solutions, and the compromise between two indices, both AET and AAS provided satisfying results.
Abstract: Considering the flexibility characteristic of advanced reservation (AR) requests, the problem of static routing, modulation, spectrum, and time assignment (RMSTA) of AR requests in elastic optical networks is studied in this paper, in order to deploy the spectrum resource economically and enable more requests to be served. The multi-objective integer linear program (ILP) model, which can minimize the maximum utilized frequency and time slot indices as well as find a trade-off between them, is used to formulate the RMSTA problem. Then the proportion optimal RMSTA (PO-RMSTA) heuristic algorithm with three sorting strategies is proposed to get the sub-optimal solutions. The PO-RMSTA algorithm and sorting strategies, ascending order of elastic time (AET), descending order of data volume (DDV), and ascending order of alternative schemes (AAS), are simulated in our work and proved to obtain the approximate optimal solutions. The sorting policy AET achieved the best performance when minimizing the maximum utilized frequency slot index, whereas the sorting policy DDV worked best when minimizing the maximum utilized time slot index. As for the compromise between two indices, both AET and AAS provided satisfying results.

Journal ArticleDOI
25 Aug 2020
TL;DR: From the simulation results using Cisco Packet Tracer software, it can be seen that there is a stable interconnection, both for existing networks plan and planning for adding networks on new branch offices.
Abstract: The development of company's business area will have implications for the development of computer network infrastructure as a means of exchanging data and information between regions. As a company that continues to develop its business area, PT. Timur Raya Lestari requires a computer network infrastructure that is adaptive to the development of the number of branch offices. The company's computer network currently uses the Static Routing method in determining the interconnection path between Routers connecting the head office and branch offices. The development of a dynamic company must be accompanied by the development of a dynamic network infrastructure as well. Development of a network infrastructure that continues to develop requires Dynamic Routing Protocol. In this study, it was simulated the use of EIGRP as Dynamic Routing Protocol for PT. Timur Raya Lestari. From the simulation results using Cisco Packet Tracer software, it can be seen that there is a stable interconnection, both for existing networks plan and planning for adding networks on new branch offices.

Journal ArticleDOI
01 Jul 2020-Heliyon
TL;DR: Coefficients finding algorithm has great computational complexity, but is optimal and, in comparison with Dijkstra's algorithm, is much simpler for RTL implementation which reduces network-on-chip routers resources cost.

Proceedings ArticleDOI
01 Jul 2020
TL;DR: The article analyses its application effectiveness on a test network example, which showed that the applying this method allows to really use the standard's opportunities and ensure minimum network load and maximum increase in data rates compared to the IEEE 802.11n standard's network with static routing.
Abstract: The article discusses using the collective dynamic routing method possibility in Wi-Fi communication networks of the IEEE 802.11ax standard, analyses its application effectiveness on a test network example, which showed that the applying this method allows to really use the standard's opportunities and ensure minimum network load and maximum increase in data rates compared to the IEEE 802.11n standard's network with static routing.

Proceedings ArticleDOI
20 Jul 2020
TL;DR: In this article, a Wireless Heuristic List Scheduler (WHLS) is proposed to determine the schedule in Time-Triggered (TT) wireless networks, where the message is fragmented according to the timeslot size and assigned to several time-slots.
Abstract: Time Sensitive Networking (TSN) is a group of standards to improve reliability, minimize jitter and ensure bounded latency by using scheduled traffic for safety critical realtime applications. Recently, the incorporation of Time-Triggered (TT) wireless technology into this kind of networked systems has been proposed because of its flexibility and easy design. Despite these benefits, the mutual interference between signals must be considered depending on the transmission intervals and the spatial proximity. Interference may prevent reception, cause the corruption of signals or affect on the signal quality. Most of the scheduling algorithms consider either the perspective of scheduling and routing restrictions, or the impact of interference on the wireless scheduling solutions. To address the interference restrictions besides the scheduling and routing restrictions, a Wireless Heuristic List Scheduler (WHLS) is proposed in this paper to determine the schedule. In this algorithm, TT messages of the computational jobs use the optimal routes with minimum latency from all available routes. In addition, the message is fragmented according to the timeslot size and assigned to several time-slots. In each time-slot all messages can be transmitted simultaneously by using a physical interference model. WHLS supports multi-cast communication while respecting the precedence constraints between computation jobs and periodicity restrictions. To evaluate the proposed scheduler, a basic List Scheduler (LS) that uses a static route (the least hop count) is implemented. The experimental results show that WHLS outperforms LS in all simulation tests, where schedulability, make span and execution time are used as parameters.

Posted Content
TL;DR: It is proved that the robust network design problem with minimum congestion cannot be approximated within any constant factor, and another proof of the result of Goyal\&al (2009) stating that the optimal linear cost under static routing can be more expensive than the cost obtained under dynamic routing.
Abstract: Given the dynamic nature of traffic, we investigate the variant of robust network design where we have to determine the capacity to reserve on each link so that each demand vector belonging to a polyhedral set can be routed. The objective is either to minimize congestion or a linear cost. Routing is assumed to be fractional and dynamic (i.e., dependent on the current traffic vector). We first prove that the robust network design problem with minimum congestion cannot be approximated within any constant factor. Then, using the ETH conjecture, we get a $\Omega(\frac{\log n}{\log \log n})$ lower bound for the approximability of this problem. This implies that the well-known $O(\log n)$ approximation ratio established by R\"{a}cke in 2008 is tight. Using Lagrange relaxation, we obtain a new proof of the $O(\log n)$ approximation. An important consequence of the Lagrange-based reduction and our inapproximability results is that the robust network design problem with linear reservation cost cannot be approximated within any constant ratio. This answers a long-standing open question of Chekuri (2007). We also give another proof of the result of Goyal\&al (2009) stating that the optimal linear cost under static routing can be $\Omega(\log n)$ more expensive than the cost obtained under dynamic routing. Finally, we show that even if only two given paths are allowed for each commodity, the robust network design problem with minimum congestion or linear cost is hard to approximate within some constant.

Patent
18 Jun 2020
TL;DR: In this article, the authors provide a method for configuring a gateway datapath that processes data messages between a logical network implemented in a datacenter and an external network.
Abstract: Some embodiments provide a method for configuring a gateway datapath that processes data messages between a logical network implemented in a datacenter and an external network The method receives configuration data including security policy rules for a logical router implemented by the datapath that indicate whether to apply a security protocol to certain data messages transmitted from a particular interface of the logical router The method identifies a particular security policy rule that applies to data messages that (i) have a destination address in a set of destination addresses and (ii) meet at least one additional criteria The method generates a static route, for a routing table used by the datapath to implement the logical router, that routes data messages with destination addresses in the set of destination addresses to the particular interface The datapath applies the security policy rules for data messages transmitted from the particular interface

Proceedings ArticleDOI
09 Oct 2020
TL;DR: Here, this paper will specialize in some of the best routing Protocols like Routing Information Protocol (RIP), Open shortest path first (OSPF), Enhanced Interior Gateway routing protocol (EIGRP) and Static routing.
Abstract: Networking Protocols tells the simplest paths to send data from source to destination, also gives details on how routers send information between one another so that to complete its goal. Exterior Gateway Protocol (EGP) and Interior Gateway Routing (IGR) are two classes of routing Protocols. Dynamic or static are two types of Routing Protocols, and then the Dynamic Routing is classified into two types as distance-vector routing or link-state routing. Here, we will specialize in some of the best routing Protocols like Routing Information Protocol (RIP), Open shortest path first (OSPF), Enhanced Interior Gateway routing protocol (EIGRP) and Static routing. RIP, OSPF, EIGRP are dynamic IGP’s and other is Static Routing, Which is that in one Autonomous System the packets are transferred using these Routing Protocols. Distance vector Algorithm is used by Routing Information Protocol, Advanced version of Distance Vector is applied in Enhanced Interior Gateway Protocol, It is Invented by the Cisco company, link-state Algorithm is used by Open shortest path First Protocol. This paper talks about the Specified and Detailed Information about the Protocols. We get to Learn the Attributes of different protocols. Using Packet Tracer, we’ll obtain simulation Results for the required routing protocols by sending PDU’s.

Proceedings ArticleDOI
Nan Geng1, Mingwei Xu1, Yuan Yang1, Enhuan Dong1, Chenyi Liu1 
01 Aug 2020
TL;DR: A novel clustering algorithm is developed to properly group a set of historical TMs into several clusters and compute a candidate routing for each TM cluster, which achieves near-optimal performance for dynamic traffic and introduces small overhead of routing updates.
Abstract: Traffic engineering (TE) attracts extensive researches over the years. Operators expect to design a TE scheme which accommodates traffic dynamics well and achieves good TE performance with little overhead. Some approaches like oblivious routing compute an optimal static routing based on a large traffic matrix (TM) range, which usually leads to much performance loss. Many approaches compute routings based on one or a few representative TMs obtained from observed historical TMs. However, they may suffer performance degradation for unexpected TMs and usually induce much overhead of system operating. In this paper, we propose ALTE, an adaptive and low-cost TE scheme based on TM classification. We develop a novel clustering algorithm to properly group a set of historical TMs into several clusters and compute a candidate routing for each TM cluster. A machine learning classifier is trained to infer the proper candidate routing online based on the features extracted from some easily measured statistics. We implement a system prototype of ALTE and do extensive simulations and experiments using both real and synthetic traffic traces. The results show that ALTE achieves near-optimal performance for dynamic traffic and introduces small overhead of routing updates.

Journal ArticleDOI
TL;DR: A dynamic communication mechanism that is able to circumvent the presence of static communication links between the circuits and provide dynamic communication for relocatable circuits is proposed.
Abstract: Runtime circuit relocation has been proposed for mitigating the effect of permanent damages in reconfigurable hardware, such as field-programmable gate arrays (FPGAs), with potentials to improve reliability and reduce or eliminate system downtime. However, a major obstacle to the adoption of circuit relocation is the presence of static communication links between the circuits. Existing solutions to this are either computationally expensive or counterintuitive to system reliability. This article proposes a dynamic communication mechanism that is able to circumvent the static links. The clock buffers in a typical FPGA use independent wires and, thus, do not constitute static routing. These are repurposed as network links to provide dynamic communication for relocatable circuits, with a demonstrator based on a four-node star network showing a bandwidth of 428.58 Mb/s for a 32-bit payload at an overhead of only 144 slices on a seven-series FPGA.

Book ChapterDOI
Gerry Howser1
01 Jan 2020
TL;DR: Populating and maintaining the Route Table (and Route Cache) is one of the most critical activities a network engineer performs, but Static Routes do not change as the network changes, and even medium–size networks can be too complex to maintain with static Routes.
Abstract: Populating and maintaining the Route Table (and Route Cache) is one of the most critical activities a network engineer performs. Static Routes are one way to populate the table, but Static Routes do not change as the network changes. At first this does not seem like a problem, but even medium–size networks can be too complex to maintain with Static Routes.

Journal Article
TL;DR: A new scalable hierarchical inter-domain routing architecture (s-idra) is proposed here to deal with the scalability problem posed to the current inter- domain routing.
Abstract: Since routing is the cornerstone of a network, constructing new routing mechanisms is indispensable to novel network architectures. The present nature of current routing mechanisms in the network layer is based on the so-called single-next-hop. Therefore, a radical solution to network transmission congestion problem is required to change from the single-next-hop mode to something else to allow simultaneous traffic transmission on multiple paths. The Border Gateway Protocol (BGP) is now the unique inter-domain routing protocol used in the Internet. A new scalable hierarchical inter-domain routing architecture (s-idra) is proposed here to deal with the scalability problem posed to the current inter-domain routing. Other than scalability, the routing system is facing other challenges such as security, Quality of Service (QoS), multicast, mobility and adaptability to dynamic network topologies. Researches on routing protocols, especially on those employed in future information network architectures, will shoulder heavy responsibilities.

Dissertation
04 Mar 2020
TL;DR: Za uspjesnu komunikaciju potrebno je odrediti put za usmjeravanje paketa do odredista, while u ovome radu opisana je razlika između dinamickog i static.
Abstract: For successful communication it is necessary to determine the optimal path for packets to reach the destination. This paper describes the difference between dynamic and static routing, advantages and disadvantages of static routing and types of static routes. Characteristics of dynamic routing protocols are described as well as the types of metrics used to determine the cost of the route. The algorithms used to determine the shortest path and loop prevention mechanisams are also described. Small ring network topology consisiting of five routers has been configured with dynamic routing protocols. Speed of convergence has been messured and compared between protocols in case of new link discovery. Reliability of packet delivery has been tested in link failure situation.

Proceedings ArticleDOI
01 Jul 2020
TL;DR: In this paper, a static wavelength routing assignment method based on improved K shortest path and genetic algorithm is proposed to realize the optimal resource allocation of static traffic flow connection establishment request set.
Abstract: Aiming at the problem that the upper layer applications of 5G technology and Internet of Things in the future require low blocking rates for optical network service connections, this paper proposes a static wavelength routing assignment method based on improved K shortest path and genetic algorithm. Based on the idea of adding alternative supplementary path to each link of shortest path, a new and improved method of K shortest path is proposed. On this basis, a static routing and wavelength allocation method based on genetic algorithm is proposed to realize the optimal resource allocation of static traffic flow connection establishment request set. Simulation results show that the proposed algorithm can solve the static routing and wavelength assignment problem well.

Patent
22 May 2020
TL;DR: In this paper, a static route deployment method for multi-line route deployment is presented. But the static route configuration file is generated by a pre-set deployment server, and then sent to the node server to be deployed.
Abstract: Disclosed are a static route deployment method, device and system. The static route deployment method comprises: reading a multi-line route deployment task from a message center, wherein the multi-line route deployment task at least comprises an identifier of a node server to be deployed; querying, according to the identifier, basic information of the node server to be deployed, wherein the basic information comprises an IP address of each gateway corresponding to the node server to be deployed and an operator corresponding to each gateway; and generating a static route configuration file according to the IP address of each gateway and an IP address segment corresponding to each operator, and issuing, by means of a pre-set deployment server, the static route configuration file to the node server to be deployed. According to the technical solution provided in the present application, the static route deployment process can be completed automatically, thereby improving the deployment efficiency and reducing the deployment cost.

Patent
30 Apr 2020
TL;DR: In this article, the authors propose a logical hierarchy by defining a plurality of transit layers wherein to each transit layer a transit layer address is assigned and a transit router and each transit router has a unique network address.
Abstract: The embodiments relate to a method and a routing device (500). The method comprises: (401) introducing a logical hierarchy by defining a plurality of transit layers wherein to each transit layer a transit layer address is assigned and a transit router and wherein each transit router has a unique network address; (402) the layers are organized in a descending order of subnet masks; (403) for each interface between a router and said transit routers, defining, in a routing table of said router, a static route based on the transit layer address and the subnet mask of the transit router interfacing with the router; and (404) if a connection that carries traffic between the router and any of the transit routers fails, selecting a static route in said routing table as redundant route for carrying said traffic towards its destination.

Posted Content
TL;DR: In this paper, a case study of public transport trips in metropolitan Copenhagen, Denmark, was conducted independently of any specific prediction models and the authors found that the optimized performance is mainly affected by the skew of the noise distribution and the presence of infrequently large prediction errors.
Abstract: As Public Transport (PT) becomes more dynamic and demand-responsive, it increasingly depends on predictions of transport demand. But how accurate need such predictions be for effective PT operation? We address this question through an experimental case study of PT trips in Metropolitan Copenhagen, Denmark, which we conduct independently of any specific prediction models. First, we simulate errors in demand prediction through unbiased noise distributions that vary considerably in shape. Using the noisy predictions, we then simulate and optimize demand-responsive PT fleets via a linear programming formulation and measure their performance. Our results suggest that the optimized performance is mainly affected by the skew of the noise distribution and the presence of infrequently large prediction errors. In particular, the optimized performance can improve under non-Gaussian vs. Gaussian noise. We also find that dynamic routing could reduce trip time by at least 23% vs. static routing. This reduction is estimated at 809,000 EUR/year in terms of Value of Travel Time Savings for the case study.

Patent
18 Feb 2020
TL;DR: In this paper, a static route testing method and device are applied to testing equipment, and the method comprises the steps: synchronizing a to-be-tested static route and the state of the to- be-test static route to the routing equipment after the to be- tested static route is determined from a configured routing table.
Abstract: The invention provides a static route testing method and device, which are applied to testing equipment, and the method comprises the steps: synchronizing a to-be-tested static route and the state ofthe to-be-tested static route to the routing equipment after the to-be-tested static route is determined from a configured routing table; constructing a set number of messages based on the destinationIP address of the to-be-tested static route, the subnet mask and the MAC address of the routing equipment; sending the set number of messages to routing equipment, so that the routing equipment forwards the set number of messages; receiving a message forwarded by the routing equipment; determining whether the static route to be tested is valid according to whether the received destination MAC address of each message forwarded by the routing equipment is the MAC address of the test equipment and whether the number of the received messages forwarded by the routing equipment is the set number; and determining whether the to-be-tested static route is abnormal or not according to the state of the to-be-tested static route and whether the to-be-tested static route is effective or not. By applying the embodiment of the invention, human resources can be greatly saved, and the test efficiency is improved.

Patent
12 Jun 2020
TL;DR: In this article, a protocol data unit (PDU) session with a user terminal on the private network side, obtaining an IP address of the user terminal, then generating a static route by using the IP address and sending the static routeto a route selection device at a data network side.
Abstract: The invention discloses a method, device and system for controlling downlink data network selection and a storage medium. The method is applied to a private network side, and comprises the following steps: firstly, after establishing a protocol data unit (PDU) session with a user terminal on the private network side, obtaining an IP address of the user terminal; then generating a static route by using the IP address of the user terminal, wherein the static route points to the private network; and then initiating open shortest path first (OSPF) route redistribution, and sending the static routeto a route selection device at a data network side. In this way, the route selection equipment on the data network side forwards and shunts the downlink data stream to the private network according to the static route under the condition that the open shortest path priority route is set. Therefore, the advantage of high private network access speed in edge computing can be utilized to the greatest extent.

Proceedings ArticleDOI
01 Sep 2020
TL;DR: The paper introduces two routing algorithms, the shortest path algorithm and the distance vector algorithm which are common in static routing algorithms and provides new ideas for network development.
Abstract: This paper briefly introduces the generation of IPV9 and its characteristics. The two transition technologies of tunnel and double protocol stack are described. Both IPv4 to IPV9 and IPV9 to IPv4 are based on mature network conversion services and need to consider protocol compatibility. The paper introduces two routing algorithms, the shortest path algorithm and the distance vector algorithm which are common in static routing algorithms. The film transmission system of Beijing University of Posts and Telecommunications USES IPV9 and 5G technology, which is a relatively advanced transmission application of IPV9. Finally, the paper summarizes the convenience and security brought by the new network address, and provides new ideas for network development.