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.展开更多
With the increasing systems, the problems of fair uses of peer-to-peer （P2P） information and resources sharing become serious. P2P systems are self-organizing, distributed systems with no centralized authority, such...With the increasing systems, the problems of fair uses of peer-to-peer （P2P） information and resources sharing become serious. P2P systems are self-organizing, distributed systems with no centralized authority, such as Free-riding and Tragedy of Commons. Because of the voluntary participation and lack of motivation, the information and resources available in P2P networks are extremely variable and unpredictable. This article studied the problems existing in P2P networks and propose a different method to stimulate the peers in P2P networks to share information and resources, using agents so as to improve the performance of P2P networks And through simulation experiments and analyzing the results, it can be concluded that this mechanism can effectively solve the problems of fair sharing in P2P systems.展开更多
文摘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.
基金the National Natural Science Foundation of China （60573141, 70271050） National 863 High Technology Research Program of China （2005AA775050）+3 种基金 the Natural Science Foundation of Jiangsu Province （BK2005146） High Technology Research Programme of Jiangsu Provinc （BG2005038, BG2006001） High Technology Research Programme of Nanjing （2006RZ105） Key Laboratory of Information Technology Processing of Jiangsu Province （kjs05001, kjs06）.
文摘With the increasing systems, the problems of fair uses of peer-to-peer （P2P） information and resources sharing become serious. P2P systems are self-organizing, distributed systems with no centralized authority, such as Free-riding and Tragedy of Commons. Because of the voluntary participation and lack of motivation, the information and resources available in P2P networks are extremely variable and unpredictable. This article studied the problems existing in P2P networks and propose a different method to stimulate the peers in P2P networks to share information and resources, using agents so as to improve the performance of P2P networks And through simulation experiments and analyzing the results, it can be concluded that this mechanism can effectively solve the problems of fair sharing in P2P systems.
