Configuration synthesis for a heterogeneous backbone cluster and a PC-interface network

IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies Pub Date : 1989-04-23 DOI:10.1109/INFCOM.1989.101480

J. Betser, Alberto Avritzer, J. Carlyle, W. Karplus

{"title":"Configuration synthesis for a heterogeneous backbone cluster and a PC-interface network","authors":"J. Betser, Alberto Avritzer, J. Carlyle, W. Karplus","doi":"10.1109/INFCOM.1989.101480","DOIUrl":null,"url":null,"abstract":"The design is discussed of the Locus family of networks rendering PC interface (PCI) service. Given are the expected user workload, the hardware costs, and the performance constraints. The workload consists of three classes of users: interactive, highly-interactive, and communication-intensive. The number of PCs is given and is equal to the number of users. It is shown that the problem can be reduced to a discrete capacity and flow assignment (CFA) problem. The backbone capacity assignment is inspired by the Lagrangian decomposition approach. It starts from a backbone capacity assignment which matches the initial flow and chooses a backbone server upgrade that gives the greatest response-time reduction per dollar. At this point, the flow deviation method is applied and iteration is continuous until the constraints are met. Several computational examples of network configuration synthesis are presented that emphasize the significance and generality of the results obtained.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"169 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1989.101480","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

Abstract

The design is discussed of the Locus family of networks rendering PC interface (PCI) service. Given are the expected user workload, the hardware costs, and the performance constraints. The workload consists of three classes of users: interactive, highly-interactive, and communication-intensive. The number of PCs is given and is equal to the number of users. It is shown that the problem can be reduced to a discrete capacity and flow assignment (CFA) problem. The backbone capacity assignment is inspired by the Lagrangian decomposition approach. It starts from a backbone capacity assignment which matches the initial flow and chooses a backbone server upgrade that gives the greatest response-time reduction per dollar. At this point, the flow deviation method is applied and iteration is continuous until the constraints are met. Several computational examples of network configuration synthesis are presented that emphasize the significance and generality of the results obtained.<>

查看原文本刊更多论文

异构骨干集群与pc接口网络的配置综合

讨论了提供PC接口(PCI)服务的Locus网络系列的设计。给定的是预期的用户工作负载、硬件成本和性能限制。工作负载由三类用户组成:交互式、高度交互式和通信密集型。pc的数量是给定的，它等于用户的数量。结果表明，该问题可简化为离散容量与流量分配问题。骨干容量分配的灵感来自拉格朗日分解方法。它从匹配初始流的骨干容量分配开始，并选择一个骨干服务器升级，使每美元的响应时间减少最多。此时，应用流偏差法，连续迭代，直到满足约束条件。给出了几个网络构型综合的计算实例，强调了所得结果的重要性和通用性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies

自引率

0.00%

发文量