A Feasible Partial Train Traffic Simulation Using Diagram Expressed in Network

Simulating large-scale and complex systems is commonly considered a difficult and time-consuming task. In this paper, we propose a partial simulation way to speed up the simulation with real time demands. It is based on the idea that a train traffic diagram is expressed in a network, and through calculating the maximal long path in the network the simulation is done, but only within a particular partial area.Upon this, we let it become a problem oriented simulation. The simulation could be started at any time,from any trains or at any stations and stopped as the same way according to the problem to be concerned.We can use this kind of simulation to analyse or confirm the correctness of traffic schedule at a high speed to meet the real time demands.

Intelligent Traffic Scheduling for Mobile Edge Computing in IoT via Deep Learning

Nowadays,with the widespread application of the Internet of Things(IoT),mobile devices are renovating our lives.The data generated by mobile devices has reached a massive level.The traditional centralized processing is not suitable for processing the data due to limited computing power and transmission load.Mobile Edge Computing(MEC)has been proposed to solve these problems.Because of limited computation ability and battery capacity,tasks can be executed in the MEC server.However,how to schedule those tasks becomes a challenge,and is the main topic of this piece.In this paper,we design an efficient intelligent algorithm to jointly optimize energy cost and computing resource allocation in MEC.In view of the advantages of deep learning,we propose a Deep Learning-Based Traffic Scheduling Approach(DLTSA).We translate the scheduling problem into a classification problem.Evaluation demonstrates that our DLTSA approach can reduce energy cost and have better performance compared to traditional scheduling algorithms.

Traffic Scheduling Mechanism Based on Interference Avoidance for Meter Data Collection in Wireless Smart Grid Communication Networks

Meter Data Collection Building Area Network(MDCBAN) deployed in high rises is playing an increasingly important role in wireless multi-hop smart grid meter data collection. Recently, increasingly numerous application layer data traffic makes MDCBAN be facing serious communication pressure. In addition, large density of meter data collection devices scattered in the limited geographical space of high rises results in obvious communication interference. To solve these problems, a traffic scheduling mechanism based on interference avoidance for meter data collection in MDCBAN is proposed. Firstly, the characteristics of network topology are analyzed and the corresponding traffic distribution model is proposed. Next, a wireless multi-channel selection scheme for different Floor Gateways and a single-channel time unit assignment scheme for data collection devices in the same Floor Network are proposed to avoid interference. At last, a data balanced traffic scheduling algorithm is proposed. Simulation results show that balanced traffic distribution and highly efficient and reliable data transmission can be achieved on the basis of effective interference avoidance between data collection devices.

Software Defined Traffic Engineering for Improving Quality of Service

The Software Defined Networking(SDN) paradigm separates the control plane from the packet forwarding plane, and provides applications with a centralized view of the distributed network state. Thanks to the flexibility and efficiency of the traffic flow management, SDN based traffic engineering increases network utilization and improves Quality of Service(QoS). In this paper, an SDN based traffic scheduling algorithm called CATS is proposed to detect and control congestions in real time. In particular, a new concept of aggregated elephant flow is presented. And then a traffic scheduling optimization model is formulated with the goal of minimizing the variance of link utilization and improving QoS. We develop a chaos genetic algorithm to solve this NP-hard problem. At the end of this paper, we use Mininet, Floodlight and video traces to simulate the SDN enabled video networking. We simulate both the case of live video streaming in the wide area backbone network and the case of video file transferring among data centers. Simulation results show that the proposed algorithm CATS effectively eliminates network congestions in subsecond. In consequence, CATS improves the QoS with lower packet loss rate and balanced link utilization.

DR-IS:Dynamic Response Incremental Scheduling in Time-Sensitive Network

Time-Sensitive Network(TSN)with deterministic transmission capability is increasingly used in many emerging fields.It mainly guarantees the Quality of Service(QoS)of applications with strict requirements on time and security.One of the core features of TSN is traffic scheduling with bounded low delay in the network.However,traffic scheduling schemes in TSN are usually synthesized offline and lack dynamism.To implement incremental scheduling of newly arrived traffic in TSN,we propose a Dynamic Response Incremental Scheduling(DR-IS)method for time-sensitive traffic and deploy it on a software-defined time-sensitive network architecture.Under the premise of meeting the traffic scheduling requirements,we adopt two modes,traffic shift and traffic exchange,to dynamically adjust the time slot injection position of the traffic in the original scheme,and determine the sending offset time of the new timesensitive traffic to minimize the global traffic transmission jitter.The evaluation results show that DRIS method can effectively control the large increase of traffic transmission jitter in incremental scheduling without affecting the transmission delay,thus realizing the dynamic incremental scheduling of time-sensitive traffic in TSN.

Review of Load Balancing Mechanisms in SDN-Based Data Centers

With the continuous expansion of the data center network scale, changing network requirements, and increasing pressure on network bandwidth, the traditional network architecture can no longer meet people’s needs. The development of software defined networks has brought new opportunities and challenges to future networks. The data and control separation characteristics of SDN improve the performance of the entire network. Researchers have integrated SDN architecture into data centers to improve network resource utilization and performance. This paper first introduces the basic concepts of SDN and data center networks. Then it discusses SDN-based load balancing mechanisms for data centers from different perspectives. Finally, it summarizes and looks forward to the study on SDN-based load balancing mechanisms and its development trend.

Dynamic QoS Mapping and Adaptive Semi-Persistent Scheduling in 5G-TSN Integrated Networks

The ubiquitous and deterministic communication systems are becoming indispensable for future vertical applications such as industrial automation systems and smart grids.5G-TSN(Time-Sensitive Networking)integrated networks with the 5G system(5GS)as a TSN bridge are promising to provide the required communication service.To guarantee the endto-end(E2E)QoS(Quality of Service)performance of traffic is a great challenge in 5G-TSN integrated networks.A dynamic QoS mapping method is proposed in this paper.It is based on the improved K-means clustering algorithm and the rough set theory(IKCRQM).The IKC-RQM designs a dynamic and loadaware QoS mapping algorithm to improve its flexibility.An adaptive semi-persistent scheduling(ASPS)mechanism is proposed to solve the challenging deterministic scheduling in 5GS.It includes two parts:one part is the persistent resource allocation for timesensitive flows,and the other part is the dynamic resource allocation based on the max-min fair share algorithm.Simulation results show that the proposed IKC-RQM algorithm achieves flexible and appropriate QoS mapping,and the ASPS performs corresponding resource allocations to guarantee the deterministic transmissions of time-sensitive flows in 5G-TSN integrated networks.

Scheduling Scheme for Cellular-Based Machine-Type Communication

Cellular-based Machine-Type Communication (MTC) will become more and more important in the near future for the advantage of the long-distance wireless communication.However,a large number of MTC applications introduce heavy load to cellular network.MTC traffic scheduling schemes are proposed to avoid congestion in this paper.Our approaches are based on the delay-tolerance of MTC traffic.Some MTC traffic is postponed until the network load becomes light.Moreover,our scheme efficiently utilizes the bandwidth resources reserved for handover in traditional cellular network.Simulation results show that the utility usage of radio resources is improved and the congestion probability is reduced.

Approximate Sorting of Packet-Scheduling in High-Speed Networks

Fairness, latency and computational complexity are three important factors in evaluating the performance of a scheduling algorithm. Fairness must be satisfied so that service can be distributed according to the reserved rate. Only when latency is irrelevant to the number of connections, is it possible to minimize the end-to-end delay through controlling the reserved rate. Among existing scheduling algorithms, Round Robin is the least complex. However, conventional Round Robin is unable to ensure fairness, and the improved round robin algorithms like Deficit Round Robin, Weighted Round Robin and Virtual Round Robin are unable to ensure that their latencies are irrelevant to the number of connections although they gua- rantee fairness. Potential Round Robin developed for analysis of fairness and latency reduction is thus proposed. It is based on the introduction of a new concept, Round Potential Function. The function splits service time into a number of service round periods to guarantee fairness regardless of the serving process used in the period. In the analysis of latency, service round periods are re-split into multiple scanning cycles for further service distribution with approximate sorting between scanning cycles. As a result, latency is no longer relevant to the number of connections while the low complexity of round robin is kept.