检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:杨九如[1] 王晓飞[1] 柳春郁[1] 丁群[1]
机构地区:[1]黑龙江大学黑龙江省普通高等学校电子工程重点实验室,哈尔滨150080
出 处:《光子学报》2014年第7期127-132,共6页Acta Photonica Sinica
基 金:The National Natural Science Foundation of China(Nos.61302075,61205071,61177079);the Science Foundation of Heilongjiang Province(No.F201009);the China Postdoctoral Science Foundation Funded Project(No.2012M520779)
摘 要:基于小尺寸缓存的提前预留机制是有效的竞争解决方案.为支持区分服务,本文研究了两优先级提前预留机制的阻塞模型,分析了变化缓存尺寸与载荷比率条件下光突发交换网络核心节点的阻塞性能.为降低两优先级提前预留机制的突发丢弃率,提出一种基于流量门限的提前预留机制.数值分析确定了合理的缓存尺寸与流量门限,实现了高、低优先级间的缓存使用平衡.仿真结果表明:与原有提前预留机制相比,基于流量门限的提前预留机制保持了全流量状态范围内的阻塞性能,并明显降低了中、低流量状态内的突发丢弃率.Pre-reservation based small buffers is an efficient method for contention resolution in optical burst switching networks. In this paper, the blocking model of pre-reservation with two-class state was studied in order to provide differentiated services, and a comprehensive analysis on the blocking performance was exhibited by varying buffer size and traffic ratio. In order to reduce the total loss probability of pre-reservation with two-class state, a novel scheme named pre-reservation based traffic- threshold was proposed by constraining the buffered right of low priority within the specific traffic states. Additionally, through the detailed numercial analysis, the reasonable values of buffer size and traffie- threshold were gained, and the balance of buffer usage between high and low priority was achieved. The simulation results show that comaparing with the eonventional pre-reservation sehemes, pre-reservation based traffic-threshold maintains the total blocking performance in all traffic states and obtains a obvious reduction of burst loss probability in light and moderate traffic states.
分 类 号:TN919.2[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28