移动客户端常规计划中延迟差异化业务的数据维度

J. Tsiligaridis
{"title":"移动客户端常规计划中延迟差异化业务的数据维度","authors":"J. Tsiligaridis","doi":"10.5220/0004119500690074","DOIUrl":null,"url":null,"abstract":"The broadcast problem including the plan design is considered. The data are inserted and numbered into customized size relations at a predefined order. The server ability to create a full, regular Broadcast Plan (RBP) with single and multiple channels after some data transformations is examined. The Basic Regular Algorithm (BRA) prepares an RBP and enables users to catch their items while avoiding wasting energy by their devices. In the case of multiple channels a dynamic grouping solution is proposed, called the Partition Value Algorithm with Less Dimension (PVALD), under a multiplicity constraint. In order to provide an RBP under relative delays a Dimensioning Algorithm (DA) is developed. The DA, with the criterion of ratio, offers the differentiation of service. This last property, in addition to the self-monitoring, and selforganizing, can be offered by servers today providing also channel availability and lower energy consumption by using a smaller, number of channels, of equal bandwidth. Simulation results are provided.","PeriodicalId":194465,"journal":{"name":"DCNET/ICE-B/OPTICS","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Data Dimensioning for Delay Differentiation Services in Regular Plans for Mobile Clients\",\"authors\":\"J. Tsiligaridis\",\"doi\":\"10.5220/0004119500690074\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The broadcast problem including the plan design is considered. The data are inserted and numbered into customized size relations at a predefined order. The server ability to create a full, regular Broadcast Plan (RBP) with single and multiple channels after some data transformations is examined. The Basic Regular Algorithm (BRA) prepares an RBP and enables users to catch their items while avoiding wasting energy by their devices. In the case of multiple channels a dynamic grouping solution is proposed, called the Partition Value Algorithm with Less Dimension (PVALD), under a multiplicity constraint. In order to provide an RBP under relative delays a Dimensioning Algorithm (DA) is developed. The DA, with the criterion of ratio, offers the differentiation of service. This last property, in addition to the self-monitoring, and selforganizing, can be offered by servers today providing also channel availability and lower energy consumption by using a smaller, number of channels, of equal bandwidth. Simulation results are provided.\",\"PeriodicalId\":194465,\"journal\":{\"name\":\"DCNET/ICE-B/OPTICS\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-04-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"DCNET/ICE-B/OPTICS\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5220/0004119500690074\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"DCNET/ICE-B/OPTICS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5220/0004119500690074","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

考虑了包括方案设计在内的广播问题。将数据按预定义的顺序插入并编号到自定义的大小关系中。在检查了一些数据转换之后,服务器能够使用单个和多个通道创建完整的常规广播计划(RBP)。基本规则算法(BRA)准备一个RBP,使用户能够抓住他们的物品,同时避免设备浪费能量。在多信道的情况下,在多重性约束下提出了一种动态分组方法,称为少维分割值算法(PVALD)。为了提供相对延迟下的RBP,提出了一种标注算法(DA)。DA以比率为标准,提供了服务的差异化。除了自我监控和自组织之外,最后一个特性可以由今天的服务器提供,通过使用更少的、相同带宽的通道数量来提供通道可用性和更低的能耗。给出了仿真结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Data Dimensioning for Delay Differentiation Services in Regular Plans for Mobile Clients
The broadcast problem including the plan design is considered. The data are inserted and numbered into customized size relations at a predefined order. The server ability to create a full, regular Broadcast Plan (RBP) with single and multiple channels after some data transformations is examined. The Basic Regular Algorithm (BRA) prepares an RBP and enables users to catch their items while avoiding wasting energy by their devices. In the case of multiple channels a dynamic grouping solution is proposed, called the Partition Value Algorithm with Less Dimension (PVALD), under a multiplicity constraint. In order to provide an RBP under relative delays a Dimensioning Algorithm (DA) is developed. The DA, with the criterion of ratio, offers the differentiation of service. This last property, in addition to the self-monitoring, and selforganizing, can be offered by servers today providing also channel availability and lower energy consumption by using a smaller, number of channels, of equal bandwidth. Simulation results are provided.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信