SMS系统瞬时到达海量数据情况的ED算法  

Early Detection Algorithm Based on Instant Arriving Mass Data in SMS System

作　　者：赵海[1] 刘智[2] 成雅琼[2] 赵明[1] 

机构地区：[1]东北大学信息科学与工程学院,辽宁沈阳110004 [2]东北大学软件学院,辽宁沈阳110004

出　　处：《东北大学学报（自然科学版）》2007年第1期35-39,共5页Journal of Northeastern University(Natural Science)

基　　金：国家科技型中小企业创新基金资助项目(01C26212110802);国家火炬计划项目(2002EB010154)

摘　　要：在短信息服务系统(SMSS)中,一些应用要求SMSS的损失率比较小.当瞬时到达海量数据(IAMD)时可能造成队列长度超过系统的缓存区最大限度,从而数据损失率超过要求.基于上述情况提出一种基于增加部分用户的等待时间从而降低系统中用户的平均等待时间进而缩短系统队列长度的调度算法.该算法综合考虑了SMSS的时延和丢失率的要求,通过查看SMSS的队列长度,估算用户的服务时间,按照服务时间的长短安排用户的排队队列,达到了既控制SMSS的队长,又避免SMSS内队列长度有限时用户等待时间过长的问题的目的.In the short message service system （SMSS）, some specific applications request lower loss rate in SMSS. When the instant arriving mass data （IAMD） comes along the queue length may overrun the buffer＇s maximum limit in the system so as to exceed the required loss rate of data. Therefore, an algorithm is proposed to reduce the queue length in the system by way of lengthening the latency for part of users to reduce the average latency for all the system users. Giving consideration to both time delay and loss rate of SMSS, the algorithm schedules the queue length for users in accordance to their different service times through checking the queue length in SMSS and estimating the service times for users. Thus, it will not only achieve the goal to control the queue length but also make users avoid too long latency when the queue length is limited in SMSS.

关 键 词：调度算法 短信息服务系统 M/M/n/m 丢失率 队长 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]