In recent years,various internet architectures,such as Integrated Services(IntServ),Differentiated Services(DiffServ),Time Sensitive Networking(TSN)and Deterministic Networking(DetNet),have been proposed to meet the q...In recent years,various internet architectures,such as Integrated Services(IntServ),Differentiated Services(DiffServ),Time Sensitive Networking(TSN)and Deterministic Networking(DetNet),have been proposed to meet the quality-of-service(QoS)requirements of different network services.Concurrently,network calculus has found widespread application in network modeling and QoS analysis.Network calculus abstracts the details of how nodes or networks process data packets using the concept of service curves.This paper summarizes the service curves for typical scheduling algorithms,including Strict Priority(SP),Round Robin(RR),Cycling Queuing and Forwarding(CQF),Time Aware Shaper(TAS),Credit Based Shaper(CBS),and Asynchronous Traffic Shaper(ATS).It introduces the theory of network calculus and then provides an overview of various scheduling algorithms and their associated service curves.The delay bound analysis for different scheduling algorithms in specific scenarios is also conducted for more insights.展开更多
One of the challenging scheduling problems in Cloud data centers is to take the allocation and migration of reconfigurable virtual machines as well as the integrated features of hosting physical machines into consider...One of the challenging scheduling problems in Cloud data centers is to take the allocation and migration of reconfigurable virtual machines as well as the integrated features of hosting physical machines into consideration. We introduce a Dynamic and Integrated Resource Scheduling algorithm (DAIRS) for Cloud data centers. Unlike traditional load-balance scheduling algorithms which often consider only one factor such as the CPU load in physical servers, DAIRS treats CPU, memory and network bandwidth integrated for both physical machines and virtual machines. We develop integrated measurement for the total imbalance level of a Cloud datacenter as well as the average imbalance level of each server. Simulation results show that DAIRS has good performance with regard to total imbalance level, average imbalance level of each server, as well as overall running time.展开更多
Packet scheduling algorithm is the key technology to guarantee Quality of Service (QoS) and balance the fairness between users in broadband Wireless Metropolitan Area Network (WMAN). Based on the research of Proportio...Packet scheduling algorithm is the key technology to guarantee Quality of Service (QoS) and balance the fairness between users in broadband Wireless Metropolitan Area Network (WMAN). Based on the research of Proportional Fairness (PF) algorithm and Modified Largest Weighted Delay First (M-LWDF) algorithm, a new packet scheduling algorithm for real-time services in broadband WMAN, called Enhanced M-LWDF (EM-LWDF), was proposed. The algorithm phases in new information to measure the load of service queues and updates the state parameters in real-time way, which remarkably improves system performance.Simulation results show that comparing with M-LWDF algorithm, the proposed algorithm is advantageous in performances of queuing delay and fairness while guaranteeing system throughput.展开更多
In this paper, we study utilitybased resource allocation for users supporting multiple services in a LTEA system with coordinated multipoint transmission for singleuser multiinput multioutput （CoMPSUMIMO）. We design...In this paper, we study utilitybased resource allocation for users supporting multiple services in a LTEA system with coordinated multipoint transmission for singleuser multiinput multioutput （CoMPSUMIMO）. We designed Joint Transmission Power Control （JTPC） for the selected clusters for minimizing power consumption in LTEA systems. The objective of JTPC is to calculate the optimal transmission power for each scheduled user and subcarrier. Moreover, based on the convex optimization theory, we propose the dynamic sector selection method in which the average sector throughput and celledge users （UEs） rates are performed to achieve the optimal solution. Simulation results show that the system performance achieved by using the proposed suboptimal algorithm is close to that achieved by the dual decomposition method.展开更多
Transmission Control Protocol (TCP) performance over Optical Burst Switching (OBS) is experimentally investigated on an OBS network testbed, concluding that burst losses will lead to a significant drop in the availabl...Transmission Control Protocol (TCP) performance over Optical Burst Switching (OBS) is experimentally investigated on an OBS network testbed, concluding that burst losses will lead to a significant drop in the available TCP bandwidth. Two mechanisms are introduced to improve TCP performance. One is concerning the burst assembly optimization and another is based on the novel assembly and scheduling mechanism to reduce the burst losses.展开更多
An optimizing method of observation scheduling based on time-division multiplexing is proposed in this paper,and its efficiency is verified by outdoor experiments. The initial observation scheduling is first obtained ...An optimizing method of observation scheduling based on time-division multiplexing is proposed in this paper,and its efficiency is verified by outdoor experiments. The initial observation scheduling is first obtained by using a semi-random search algorithm,and secondly the connection time pair（ CTP） between adjacent objects is optimized by using a genetic algorithm. After obtaining these two parameters,the final observation scheduling can be obtained. According to pre-designed tracks between each adjacent objects in observation order,the seamless observation of neighboring targets is derived by automatically steering the antenna beam,so the observation efficiency is improved.展开更多
基金supported by ZTE Industry-University-Institute Cooperation Funds。
文摘In recent years,various internet architectures,such as Integrated Services(IntServ),Differentiated Services(DiffServ),Time Sensitive Networking(TSN)and Deterministic Networking(DetNet),have been proposed to meet the quality-of-service(QoS)requirements of different network services.Concurrently,network calculus has found widespread application in network modeling and QoS analysis.Network calculus abstracts the details of how nodes or networks process data packets using the concept of service curves.This paper summarizes the service curves for typical scheduling algorithms,including Strict Priority(SP),Round Robin(RR),Cycling Queuing and Forwarding(CQF),Time Aware Shaper(TAS),Credit Based Shaper(CBS),and Asynchronous Traffic Shaper(ATS).It introduces the theory of network calculus and then provides an overview of various scheduling algorithms and their associated service curves.The delay bound analysis for different scheduling algorithms in specific scenarios is also conducted for more insights.
基金supported by Scientific Research Foundation for the Returned Overseas Chinese ScholarsState Education Ministry under Grant No.2010-2011 and Chinese Post-doctoral Research Foundation
文摘One of the challenging scheduling problems in Cloud data centers is to take the allocation and migration of reconfigurable virtual machines as well as the integrated features of hosting physical machines into consideration. We introduce a Dynamic and Integrated Resource Scheduling algorithm (DAIRS) for Cloud data centers. Unlike traditional load-balance scheduling algorithms which often consider only one factor such as the CPU load in physical servers, DAIRS treats CPU, memory and network bandwidth integrated for both physical machines and virtual machines. We develop integrated measurement for the total imbalance level of a Cloud datacenter as well as the average imbalance level of each server. Simulation results show that DAIRS has good performance with regard to total imbalance level, average imbalance level of each server, as well as overall running time.
基金This work was funded by the National High Technology Research and Development Program ("863" Program) of China under Grant No.2007AA01Z289
文摘Packet scheduling algorithm is the key technology to guarantee Quality of Service (QoS) and balance the fairness between users in broadband Wireless Metropolitan Area Network (WMAN). Based on the research of Proportional Fairness (PF) algorithm and Modified Largest Weighted Delay First (M-LWDF) algorithm, a new packet scheduling algorithm for real-time services in broadband WMAN, called Enhanced M-LWDF (EM-LWDF), was proposed. The algorithm phases in new information to measure the load of service queues and updates the state parameters in real-time way, which remarkably improves system performance.Simulation results show that comparing with M-LWDF algorithm, the proposed algorithm is advantageous in performances of queuing delay and fairness while guaranteeing system throughput.
基金partially supported by the Fundamental Research Funds for the Central Universities under Grant No.2012RC0401
文摘In this paper, we study utilitybased resource allocation for users supporting multiple services in a LTEA system with coordinated multipoint transmission for singleuser multiinput multioutput （CoMPSUMIMO）. We designed Joint Transmission Power Control （JTPC） for the selected clusters for minimizing power consumption in LTEA systems. The objective of JTPC is to calculate the optimal transmission power for each scheduled user and subcarrier. Moreover, based on the convex optimization theory, we propose the dynamic sector selection method in which the average sector throughput and celledge users （UEs） rates are performed to achieve the optimal solution. Simulation results show that the system performance achieved by using the proposed suboptimal algorithm is close to that achieved by the dual decomposition method.
基金supported by MOST program with grant No.2006DFA11040, 2007AA01Z248111 Project (B07005)PCSIRT with grant No.IRT0609, MOE, China
文摘Transmission Control Protocol (TCP) performance over Optical Burst Switching (OBS) is experimentally investigated on an OBS network testbed, concluding that burst losses will lead to a significant drop in the available TCP bandwidth. Two mechanisms are introduced to improve TCP performance. One is concerning the burst assembly optimization and another is based on the novel assembly and scheduling mechanism to reduce the burst losses.
基金Supported by the National Natural Science Foundation of China(61271373,61571043)111 Project of China(B14010)
文摘An optimizing method of observation scheduling based on time-division multiplexing is proposed in this paper,and its efficiency is verified by outdoor experiments. The initial observation scheduling is first obtained by using a semi-random search algorithm,and secondly the connection time pair（ CTP） between adjacent objects is optimized by using a genetic algorithm. After obtaining these two parameters,the final observation scheduling can be obtained. According to pre-designed tracks between each adjacent objects in observation order,the seamless observation of neighboring targets is derived by automatically steering the antenna beam,so the observation efficiency is improved.
