CAJ | 학술논문

提出了一种能够提供端到端时延保证和满足丢包率要求的多优先级算法.该算法以分组头中记录的时延、丢包率、保证带宽为权重对分组进行调度,通过对信元的相对优先级及服务质量参数的加权算法,得到一种公平的满足绝对服务质量的算法.还能够使系统避免维护每个流的状态信息以及对单个流进行复杂的队列管理和调度,由此增加了系统的可扩展性.计算机仿真表明该算法具有较高的资源利用率,较低的端到端时延和时延抖动以及较低的分组丢弃率等特点.
제출료일충능구제공단도단시연보증화만족주포솔요구적다우선급산법.해산법이분조두중기록적시연、주포솔、보증대관위권중대분조진행조도,통과대신원적상대우선급급복무질량삼수적가권산법,득도일충공평적만족절대복무질량적산법.환능구사계통피면유호매개류적상태신식이급대단개류진행복잡적대렬관리화조도,유차증가료계통적가확전성.계산궤방진표명해산법구유교고적자원이용솔,교저적단도단시연화시연두동이급교저적분조주기솔등특점.
A multi-priority algorithm is proposed which can provide the guarantee of low end-to-end delay and satisfy the request of low packets-drop rate.The algorithm takes the latency,the packets-drop rate in records and the guarantee of bandwidth as the weight to carry on the dispatch,uses the cell's relative priority and the quality of service parameter's weighting algorithm to obtain an algorithm which can satisfy absolute quality of service.The algorithm also can made the system to avoid maintaining each class's status messages as well as carrying on complex queue management and dispatch to each single class,thereby increases the system's extendibility.Simulation has proved that this algorithm has the high utility ratio of resources,low end-to-end delay and latency vibration,as well as low grouping discarding rate.