Search

Aiming to address the drawbacks in SRv6 technology, such as low network carrying efficiency caused by long packet header and inability to deploy in IPv4 networks, a segment routing technology SRv4 for IPv4 networks is proposed. The format of packets header in SRv4, the format of packet encapsulation of SRv4 in IPv4, the processing instructions and the forwarding process of SRv4 packets are designed. SRv4 is compatible with the IPv4 protocol and existing IPv4 network devices, and can be incrementally deployed in IPv4 networks. Compared to SRv6, SRv4 reduces the SID length by 75%, resulting in higher network carrying efficiency. The SRv4 module is developed in the Linux kernel using XDP technology to verify the feasibility of the SRv4. The function, performance and stability of the SRv4 module were tested using a network environment built in a server computer. The results show that the SRv4 module has the correct segment routing function and can run stably. [ABSTRACT FROM AUTHOR]

In order to solve the problems of unreasonable traffic path allocation, elephant flow collision and high overhead of controller flow table in data center networks, this paper proposed an SDN based hybrid segment routing probability flow scheduling mechanism (SRPFS). By taking advantage of SDN s centralized control feature, SRPFS initialized the traffic forwarding method by hybrid segment routing at first. Then, it utilized particle swarm optimization and redefined the internal particles optimization process to filter the traffic. Finally, SRPFS constructed the global node probability matrix and designed probability scheduling algorithm to elect the optimal path for traffic forwarding. Experimental results show that the hybrid segment routing has a greater advantage in terms of flow table overhead. Compare with other classic flow transmission mechanisms, SRPFS has certain advantages in average network throughput, link utilization and standard network throughput rate, it reduces the controller flow-table overhead and ensures better network performance. [ABSTRACT FROM AUTHOR]

Introduction: In the future, quantum networks will be an important development direction. Quantum networks should be studied considering quantum's unique physical properties. In quantum networks with limited resources, decoherence will lead to qubits loss, which restricts the time that data qubits can be stored in memory before use. To realize the network function, it is very important to transmit data qubits as quickly as possible. In order to ensure timeliness and make use of entanglement resources as much as possible, this paper proposes a concurrent multipath entanglement routing scheme based on segment routing for quantum hybrid networks. Methods: In this scheme, centralized routing is used to calculate the "segments" of quantum relay path, and distributed routing is used to transmit control messages between the "segments". The "concurrent" mechanism is fully adopted in classical messages passing, path nodes BSM (Bell State Measurement) execution and multipath shunt transmission. Conclusion: This scheme has obvious advantages in multipath concurrent transmission, traffic diversion, reducing transmission time and providing redundancy. [ABSTRACT FROM AUTHOR]

In view of the low flow entry utilization rate caused by the current SDN network when dealing with a large number of flows, the slow forwarding response and the current network scheduling algorithms may cause local network congestion and load imbalance, a multi-path scheduling based on segment routing is proposed. Algorithm SRMF. First, the SDN controller sends the initial flow entries according to the network topology links information; then, comprehensively considers the remaining bandwidth of the network links, the packet loss rate and the estimated bandwidth requirements of the flow to calculate the path weight; finally, selects the optimal path according to the path weight and install the segment flow entries to the edge switches. Experimental results show that the segment routing technology has obvious advantages in terms of flow entries overhead compared with general forwarding under multiple network topologies. Compared with Hedera and ECMP, the SRMF algorithm has certain advantages in terms of end-to-end delay and delay jitter, network throughput, and packet loss rate. [ABSTRACT FROM AUTHOR]

Quality of Experience (QoE) reflects end users’ overall experience and feeling with network services, but needs support in terms of end-to-end Quality of Service (QoS). Segment routing (SR) as a new routing paradigm can provide good end-to-end QoS guarantee, making traditional multimedia traffic routing more efficient and scalable. In this paper, we address two problems related to the new SR mechanism: enabling fine-grained end-to-end QoS routing under a complex network environment and constructing the multicast routing tree with branch node load balancing. To solve these problems, an Inaccurate information-based QoE-driven Routing algorithm (IQdR) and a Branch-aware Multicast Tree (BaMT) algorithm were proposed. Simulation test results that have compared the performance of our proposed solution against that of other algorithms show that the previous works were outperformed. Additionally, the results also show that our multicast architecture improves the scalability of the network in terms of the number of flows. [ABSTRACT FROM AUTHOR]

Considering the load balancing needs in edge computing network, this paper proposed a scheduling scheme based on centralized control. This scheme decided which nodes to deploy edge computing module firstly, then considered users' data and requests, minimized the average end-to-end delay of traffic through scheduling while meeting the load balancing constraints. The evaluation results indicate that the number of edge computing nodes and the load balancing level of computing and network resources may affect the average end-to-end delay of traffic. Selecting a small number of suitable nodes as edge computing nodes and making the load balancing level of computing and network resources appropriate can effectively reduce the average end-to-end delay. [ABSTRACT FROM AUTHOR]

In SDN networks, the abstracdon of the data forwarding plane ss the precondkion of the formulaiion of the southern interface protocols, such as OpenFlow. Currently, the standard OpenFlow protocol assumes that each low table ttem of the data p】ane ss composed of defined rules and corresponding acion sets. FlowMod messages of the data p】ane carry these ru】es and acion sets. However, wtth the coniinuous development of SDN appiicaion scenarios, the iimtted and predefined a tons of the OpenFlow protocol make tt difficult to meet some new contiguration requirements, such as centrally controUed segment rouing management contiguration, SDPA contiguration and soon. To improve the lexiblty of action detinition in SDNs, a nd remove the restrictions on actions, we foslly propose a new action extension mechanssm, caled 116x16 action extension (FAE). The FAE bases on Flow Mod messages in Open Flow, a nd can satssfy the needs for user-detined actions witch can extend in a flexible and simple way. And then we implement the FAE useing open source Floodiight controller and FAST swttch, and experiments show that the FAE can effectively support the extended actions in centrally controlled segment routing management contiguration. [ABSTRACT FROM AUTHOR]

Both wireless small-cell communications and software-defined networking (SDN) in wired systems continue to evolve rapidly, aiming for improving the quality of experience (QoE) of users. Against this emerging landscape, we conceive scalable video streaming over SDN-aided dense smell-cell networks by jointly optimizing the video layer selection, the wireless resource allocation, and the dynamic routing of video streams. In the light of this ambitious objective, we conceive a dense software-defined small-cell network architecture for the fine-grained manipulation of the video streams relying on the cooperation of small-cell base stations. Based on this framework, we formulate the scalable video streaming problem as maximizing the time-averaged QoE subject to a specific time-averaged rate constraint as well as to a resource constraint. By employing the classic Lyapunov optimization method, the problem is further decomposed into the twin sub-problems of video layer selection and wireless resource allocation. Via solving these sub-problems, we derive a video layer selection strategy and a wireless resource allocation algorithm. Furthermore, we propose a beneficial routing policy for scalable video streams with the aid of the so-called segment routing technique in the context of SDN, which additionally exploits the collaboration of small-cell base stations. Our results demonstrate compelling performance improvements compared with the classic PID control theory-based method. [ABSTRACT FROM AUTHOR]

Named data networking (NDN) has promising advantages, however, it is hard to deploy because of the lack of special hardware to support it. Besides, the lack of specific routing schema also restrains the advantages of NDN. To solve the problems of deployment and routing, we come up with the source routing schema over protocol-oblivious forwarding (POF) for NDN. POF is able to directly carry NDN packets without over IP because it provides an adaptable and programmable forwarding plane by defining a generic flow instruction set. Source routing is a flexible and scalable routing schema and provides the flexible and efficient implementation for the future network. The centralized management of the source routing schema over POF can provide the following properties: (i) quickly responding to the change of network, and (ii) forwarding the Interest packet to the best cache node. Experiments show that the source routing schema over POF for NDN can reduce more than 50% of the networking traffic flow and increase the cache hit rate by up to 25% more than the baseline schemas. Thus, the source routing schema over POF could be an implementation plan for NDN. [ABSTRACT FROM AUTHOR]

In order to reduce the delay of content request, reduce network congestion and deal with node or link failure quickly in software defined content centric network (SD-CCN) , this paper designed a software defined content centric network’s segment routing strategy (SD-CCN-SR) based on the idea of segment routing in traffic engineering of SDN. The controller selected the optimal caching node or content source node as the destination node, found the optimal path, then sent the segment list (SL) down to the ingress border node (IBN). This method used the labels in the segment list as segment destination nodes sequentially to carry out the shortest path routing, realized the integral control of interest packet’s uplink by the controller through a small amount of control information. Simulation results show that this strategy can effectively reduce the average request delay and average routing hops. [ABSTRACT FROM AUTHOR]

With the rapid shrinking of technology and growing integration capacity, the probability of failures in Networks-on-Chip (NoCs) increases and thus, fault tolerance is essential. Moreover, the unpredictable locations of these failures may influence the regularity of the underlying topology, and a regular 2D mesh is likely to become irregular. Thus, for these failure-prone networks, a viable routing framework should comprise a topology-agnostic routing algorithm along with a cost-effective, scalable routing mechanism able to handle failures, irrespective of any particular failure patterns. Existing routing techniques designed to route irregular topologies efficiently lack flexibility (logic-based), scalability (table-based) or relaxed switch design (uLBDR-based). Designing an efficient routing implementation technique to address irregular topologies remains a pressing research problem. To address this, we present a fault resilient routing mechanism for irregular 2D meshes resulting from failures. To handle irregularities, it avoids using routing tables and employs a few fixed configuration bits per switch resulting in a scalable approach. Experiments demonstrate that the proposed approach is guaranteed to tolerate all locations of single and double-link failures and most multiple failures. Also, unlike uLBDR it is not restricted to any particular switching technique and does not replicate any extra messages. Along with fault tolerance, the proposed mechanism can achieve better network performance in fault-free cases. The proposed technique achieves graceful performance degradation during failure. Compared to uLBDR, our method has 14% less area requirements and 16% less overall power consumption. [ABSTRACT FROM AUTHOR]

Software-defined networks (SDNs) are improving the controllability and flexibility of networks as an innovative network architecture paradigm. Segment routing (SR) exploits an end-to-end logical path and is composed of a sequence of segments as an effective routing strategy. Each segment is represented by a middle point. The combination of SR and SDN can meet the differentiated business needs of users and can quickly deploy applications. In this paper, we propose two routing algorithms based on SR in SDN. The algorithms aim to save the cost of the path, alleviate the congestion of networks, and formulate the selection strategy by comprehensively evaluating the value of paths. The simulation results show that compared with existing algorithms, the two proposed algorithms can effectively reduce the consumption of paths and better balance the load of the network. Furthermore, the proposed algorithms take into account the preferences of users, actualize differentiated business networks, and achieve a larger comprehensive evaluation value of the path compared with other algorithms. [ABSTRACT FROM AUTHOR]