Simultaneous allocation of multiple resources for computer communications networks

S. Tsumura, S. Kuribayashi
{"title":"Simultaneous allocation of multiple resources for computer communications networks","authors":"S. Tsumura, S. Kuribayashi","doi":"10.1109/APCC.2006.255775","DOIUrl":null,"url":null,"abstract":"In computer communications networks, all services are provided using servers (computing resource and storage resource) distributed in various locations and network bandwidth which connects the selected server and the user terminal. Therefore, for each service request, it is necessary to assign multiple types of resource simultaneously and effectively. This paper proposes a new method of allocating multiple types of resource simultaneously in a computer communications network. The key idea of the proposed method is first to identify the resource type for which the requested amount is the largest proportion of the maximum resource of that type, and then to select the center with the least available amount of the selected resource type. Moreover, this paper proposes another method of allocating multiple types of resource which takes account of the network delay time. It is demonstrated by simulation evaluations that the proposed method could reduce the amount of the resource of 20% in the maximum, compared with the existing method","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Asia-Pacific Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCC.2006.255775","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

Abstract

In computer communications networks, all services are provided using servers (computing resource and storage resource) distributed in various locations and network bandwidth which connects the selected server and the user terminal. Therefore, for each service request, it is necessary to assign multiple types of resource simultaneously and effectively. This paper proposes a new method of allocating multiple types of resource simultaneously in a computer communications network. The key idea of the proposed method is first to identify the resource type for which the requested amount is the largest proportion of the maximum resource of that type, and then to select the center with the least available amount of the selected resource type. Moreover, this paper proposes another method of allocating multiple types of resource which takes account of the network delay time. It is demonstrated by simulation evaluations that the proposed method could reduce the amount of the resource of 20% in the maximum, compared with the existing method
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
为计算机通信网络同时分配多种资源
在计算机通信网络中,所有服务都是通过分布在不同位置的服务器(计算资源和存储资源)和连接所选服务器和用户终端的网络带宽来提供的。因此,对于每个服务请求,需要同时有效地分配多种类型的资源。提出了一种计算机通信网络中多种资源同时分配的新方法。该方法的核心思想是首先确定请求量占该类型最大资源比例最大的资源类型,然后选择所选资源类型中可用量最少的中心。此外,本文还提出了一种考虑网络延迟时间的多类型资源分配方法。仿真评价表明,与现有方法相比,该方法最多可减少20%的资源量
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
aMAC: Advanced MAC Scheme for Mobile Ad-hoc Networks A Modeling for Radiowave Propagation of M/W bands in Microcells A Taxonomy of Electronic Funds Transfer Domain Intrusions and its Feasibility Converting into Ontology TAEE: A NEW Transmit-rate Aware Energy Efficient Routing Algorithm For Multicast/Broadcast In Ad Hoc Network Extended TCAM for Adopting Range and Negation Rules in Packet Classification
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1