检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《通信学报》2001年第8期29-33,共5页Journal on Communications
基 金:西安交通大学制造系统国家重点实验室开放基金资助项目;中国博士后基金资助项目;国家自然科学基金资助项目(60074011)
摘 要:本文研究N个延迟敏感型业务流对共享时隙带宽资源的实时在线最优配置问题。延迟业务的特点是如果在阈值n时隙内没有可分配带宽,则新业务会被阻塞,优化目标是诸业务流被阻塞的概率最小,优化问题是整数规划问题。本文把离散型问题转化为连续型优化问题,基于网络阻塞率的实时测量值,采用梯度估计的搜索算法,给出诸业务流的最优时隙配置比例。然后,引入一种集成了确定性和随机性的转换方法,等价地给出原离散型问题的最优时隙配置。A technique to implement online optimal scheduling bandwidth for N delay sensitive customer arrival streams is presented. Upon arrival, a delay sensitive customer would be blocked if the assigned slots being not available within n slots threshold.The objective is to minimize the probability that each stream is blocked. Usu- ally an integral programming approach is used. However, the problem is better transferred to a continuous optimal search in the paper. According to the measured blocked rate of streams, a gradient-based algorithm is employed to optimize the slot allocation.Then, the bandwidth allocation for original discrete problem is obtained equival ently by introducing an integrared deterministic and stochastic transfer approach.
分 类 号:TN91[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145