传统互联网为实现端到端安全、可靠、实时的网络业务保障,需要在网元节点部署多类组网服务。然而,现有大多数网络设备只提供网络接入和路由等服务功能,缺乏安全、可靠、实时的服务设计。基于开源网络操作系统(software for open network...传统互联网为实现端到端安全、可靠、实时的网络业务保障,需要在网元节点部署多类组网服务。然而,现有大多数网络设备只提供网络接入和路由等服务功能,缺乏安全、可靠、实时的服务设计。基于开源网络操作系统(software for open networking in the cloud,SONiC)、容器技术和行为树设计一种组网服务管控架构及调度方法,实现面向网络业务保障的组网服务部署,将组网服务部署可编程网络设备进行统一管理和调度,并进行仿真测试。所述组网服务管控架构及调度方法进一步增强了网络设备能力,利用行为树高效协调管控调度过程中的状态转化,保障组网服务的交付质量。展开更多
The fact that outburst traffic in industrial Ethemet was focused on that would bring self-similar phenomenon leading to the delay increase of the cyclical data, and a hybrid priority queue schedule model was proposed ...The fact that outburst traffic in industrial Ethemet was focused on that would bring self-similar phenomenon leading to the delay increase of the cyclical data, and a hybrid priority queue schedule model was proposed in which the outburst data was given the highest priority. Some properties of the self-similar outburst data were proved by network calculus, and its service curve scheduled by the switch was gained. And then the performance of the scheduling algorithm was obtained. The simulation results are close to those calculated by using network calculus model. Some results are of actual significance to the construction of switched industrial Ethernet.展开更多
Services provided by internet need guaranteed network performance. Efficient packet queuing and scheduling schemes play key role in achieving this. Internet engineering task force(IETF) has proposed Differentiated Ser...Services provided by internet need guaranteed network performance. Efficient packet queuing and scheduling schemes play key role in achieving this. Internet engineering task force(IETF) has proposed Differentiated Services(Diff Serv) architecture for IP network which is based on classifying packets in to different service classes and scheduling them. Scheduling schemes of today's wireless broadband networks work on service differentiation. In this paper, we present a novel packet queue scheduling algorithm called dynamically weighted low complexity fair queuing(DWLC-FQ) which is an improvement over weighted fair queuing(WFQ) and worstcase fair weighted fair queuing+(WF2Q+). The proposed algorithm incorporates dynamic weight adjustment mechanism to cope with dynamics of data traffic such as burst and overload. It also reduces complexity associated with virtual time update and hence makes it suitable for high speed networks. Simulation results of proposed packet scheduling scheme demonstrate improvement in delay and drop rate performance for constant bit rate and video applications with very little or negligible impact on fairness.展开更多
In traditional wireless broadcast networks,a corrupted packet must be retransmitted even if it has been lost by only one receiver.Obviously,this is not bandwidth-efficient for the receivers that already hold the retra...In traditional wireless broadcast networks,a corrupted packet must be retransmitted even if it has been lost by only one receiver.Obviously,this is not bandwidth-efficient for the receivers that already hold the retransmitted packet.Therefore,it is important to develop a method to realise efficient broadcast transmission.Network coding is a promising technique in this scenario.However,none of the proposed schemes achieves both high transmission efficiency and low computational complexity simultaneously so far.To address this problem,a novel Efficient Opportunistic Network Coding Retransmission(EONCR)scheme is proposed in this paper.This scheme employs a new packet scheduling algorithm which uses a Packet Distribution Matrix(PDM)directly to select the coded packets.The analysis and simulation results indicate that transmission efficiency of EONCR is over 0.1,more than the schemes proposed previously in some simulation conditions,and the computational overhead is reduced substantially.Hence,it has great application prospects in wireless broadcast networks,especially energyand bandwidth-limited systems such as satellite broadcast systems and Planetary Networks(PNs).展开更多
文摘传统互联网为实现端到端安全、可靠、实时的网络业务保障,需要在网元节点部署多类组网服务。然而,现有大多数网络设备只提供网络接入和路由等服务功能,缺乏安全、可靠、实时的服务设计。基于开源网络操作系统(software for open networking in the cloud,SONiC)、容器技术和行为树设计一种组网服务管控架构及调度方法,实现面向网络业务保障的组网服务部署,将组网服务部署可编程网络设备进行统一管理和调度,并进行仿真测试。所述组网服务管控架构及调度方法进一步增强了网络设备能力,利用行为树高效协调管控调度过程中的状态转化,保障组网服务的交付质量。
基金Project( 60425310) supported by the National Science Fund for Distinguished Young Scholars of ChinaProject(05JJ40118) supported by the Natural Science Foundation of Hunan Province, China
文摘The fact that outburst traffic in industrial Ethemet was focused on that would bring self-similar phenomenon leading to the delay increase of the cyclical data, and a hybrid priority queue schedule model was proposed in which the outburst data was given the highest priority. Some properties of the self-similar outburst data were proved by network calculus, and its service curve scheduled by the switch was gained. And then the performance of the scheduling algorithm was obtained. The simulation results are close to those calculated by using network calculus model. Some results are of actual significance to the construction of switched industrial Ethernet.
文摘Services provided by internet need guaranteed network performance. Efficient packet queuing and scheduling schemes play key role in achieving this. Internet engineering task force(IETF) has proposed Differentiated Services(Diff Serv) architecture for IP network which is based on classifying packets in to different service classes and scheduling them. Scheduling schemes of today's wireless broadband networks work on service differentiation. In this paper, we present a novel packet queue scheduling algorithm called dynamically weighted low complexity fair queuing(DWLC-FQ) which is an improvement over weighted fair queuing(WFQ) and worstcase fair weighted fair queuing+(WF2Q+). The proposed algorithm incorporates dynamic weight adjustment mechanism to cope with dynamics of data traffic such as burst and overload. It also reduces complexity associated with virtual time update and hence makes it suitable for high speed networks. Simulation results of proposed packet scheduling scheme demonstrate improvement in delay and drop rate performance for constant bit rate and video applications with very little or negligible impact on fairness.
基金supported in part by the National Natural Science Foundation of China under Grant No. 61032004the National High Technical Research and Development Program of China (863 Program) under Grants No. 2012AA121605,No. 2012AA01A503,No.2012AA01A510
文摘In traditional wireless broadcast networks,a corrupted packet must be retransmitted even if it has been lost by only one receiver.Obviously,this is not bandwidth-efficient for the receivers that already hold the retransmitted packet.Therefore,it is important to develop a method to realise efficient broadcast transmission.Network coding is a promising technique in this scenario.However,none of the proposed schemes achieves both high transmission efficiency and low computational complexity simultaneously so far.To address this problem,a novel Efficient Opportunistic Network Coding Retransmission(EONCR)scheme is proposed in this paper.This scheme employs a new packet scheduling algorithm which uses a Packet Distribution Matrix(PDM)directly to select the coded packets.The analysis and simulation results indicate that transmission efficiency of EONCR is over 0.1,more than the schemes proposed previously in some simulation conditions,and the computational overhead is reduced substantially.Hence,it has great application prospects in wireless broadcast networks,especially energyand bandwidth-limited systems such as satellite broadcast systems and Planetary Networks(PNs).
