期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
A Novel Framework for IP DiffServ over Optical Burst Switching Networks 被引量:6
1
作者 ke-pinglong YunLi +1 位作者 RodneyS.Tucker Chong-GangWang 《Journal of Computer Science & Technology》 SCIE EI CSCD 2004年第6期948-954,共7页
This paper presents a novel framework for IP Differentiated Services (DiffServ) over optical burst switching (OBS), namely, DS-OBS. The network architecture, functional model of edge nodes and core nodes, the control ... This paper presents a novel framework for IP Differentiated Services (DiffServ) over optical burst switching (OBS), namely, DS-OBS. The network architecture, functional model of edge nodes and core nodes, the control packet format, a novel burst assembly scheme at ingress nodes and scheduling algorithm of core nodes are presented. The basic idea is to apply DiffServ capable burst assembly at ingress nodes and perform different per hop behavior (PHB) electronic treatments for control packets of different QoS class services at core nodes. Simulation results show that the proposed schemes can provide the best differentiated service for expedited forwarding (EF), assured forwarding (AF) and best effort (BE) services in terms of end-to-end delay, throughput and IP packet loss probability. Keywords IP quality of service - differentiated service - per hop behavior - optical burst switching NoteThis work is supported by the National Natural Science Foundation of China (Grant No.90304004), the National Hi-Tech Development 863 Program of China (Grant No.2003AA121540), and the research grants by the Ministry of Education of China (Grant No.204125), the Chongqing Education Commission (Grant No.050309) and the Chongqing Science Commission. 展开更多
关键词 IP quality of service differentiated service per hop behavior optical burst switching
原文传递
RWBO(pd, w): A Novel Backoff Algorithm for IEEE 802.11 DCF
2
作者 YunLi ke-pinglong Feng-RuiYang 《Journal of Computer Science & Technology》 SCIE EI CSCD 2005年第2期276-281,共6页
The Probability Distribution of. Slot Selection (PDoSS) of IEEE 802.11 DCF is extremely uneven, which makes the packet collision probability very high. In this paper, the authors explore how to make the stations selec... The Probability Distribution of. Slot Selection (PDoSS) of IEEE 802.11 DCF is extremely uneven, which makes the packet collision probability very high. In this paper, the authors explore how to make the stations select:the slots uniformly, and give an RWBO(P-d,w) algorithm for 802.11 DCF to make the PDoSS even and decrease the packet collision probability. A Markov model is given to analyze the PDoSS of RWBO(p(d), w). The performance of RWBO(p(d), w) is evaluated, by. simulation in terms of saturation throughput and packet collision probability. The simulation results indicate that RWBO(p(d), w) can decrease the packet contention,probability to a large extent, and utilize the channel more efficiently as compared to the 802.11 DCF. Moreover, the relation between saturation throughput, and walking probability (p(d)),the relation between saturation throughput and contention windows (w), the relation between packet collision probability and walking probability (p(d)), and the relation between packet collision probability and contention windows (w) are analyzed. The analysis indicates that RWBO(p(d), w) has some remarkable features: its saturation throughout keeps high and packet collision probability keeps very low (under 0.1) in a large range of p(d) and w, which allow users to configure p(d) and w more flexibly. 展开更多
关键词 IEEE 802.11 DCF PDoSS random walking BackOff Markov chain model
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部