Proceedings of IEEE INFOCOM '96. Conference on Computer Communications最新文献

筛选
英文 中文
A new rate-based switch algorithm for ABR traffic to achieve max-min fairness with analytical approximation and delay adjustment 基于解析逼近和时延调整的基于速率的ABR流量最大最小公平性切换算法
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.493062
D. Tsang, Wales Kin Fai Wong
{"title":"A new rate-based switch algorithm for ABR traffic to achieve max-min fairness with analytical approximation and delay adjustment","authors":"D. Tsang, Wales Kin Fai Wong","doi":"10.1109/INFCOM.1996.493062","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493062","url":null,"abstract":"A new rate-based switch mechanism for ABR traffic in ATM networks, which aims to rapidly achieve max-min fairness allocation, is proposed. Simulation results show that the proposed scheme can out-perform both CAPC and ERICA in terms of response times and peak queue lengths. An analytical approximation of the performance is also introduced and its accuracy is found to be close to the simulation results. A variant of the proposed scheme is presented for handling the problem of different source-to-bottleneck separations. By using this scheme, the peak queue lengths at the switches can further be reduced without any degradation in throughput.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130243297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 59
Bounds on finite horizon QoS metrics with application to call admission 有限视界QoS指标的边界与应用程序调用准入
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.493081
Zhen Liu, P. Nain, D. Towsley
{"title":"Bounds on finite horizon QoS metrics with application to call admission","authors":"Zhen Liu, P. Nain, D. Towsley","doi":"10.1109/INFCOM.1996.493081","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493081","url":null,"abstract":"There exists a substantial body of work on the problem of providing guaranteed quality of service (QoS) to different service classes in B-ISDNs. We consider a discrete time, single server system in which packets arrive from a finite population of sources. Under the assumption that arrivals from each source are modulated by a Markov process, we examine the following metrics (i) the fraction of an interval during which the queue length exceeds a certain value, and (ii) the fraction of a group of packets from a single source that arrive to find the queue length above a certain value. For both metrics we derive upper and lower bounds on the probabilities that they exceed a threshold. These are important measures because they reflect more accurately the behavior perceived by applications such as networked audio and video. An application of these results to call admission is also given.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"64 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130727182","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Integrated control of connection admission, flow rate, and bandwidth for ATM based networks 基于ATM的网络连接准入、流量和带宽的综合控制
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.493376
A. Pitsillides, Petros A. Ioannou, D. Tipper
{"title":"Integrated control of connection admission, flow rate, and bandwidth for ATM based networks","authors":"A. Pitsillides, Petros A. Ioannou, D. Tipper","doi":"10.1109/INFCOM.1996.493376","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493376","url":null,"abstract":"We consider the combined control problem of connection admission, flow rate, and bandwidth allocation (capacity, service-rate) under nonstationary conditions. A fluid flow model in state variable form describes the time varying mean behaviour of available bit rate (ABR) traffic, which competes with guaranteed traffic for network resources. Using nonlinear control we derive an integrated control strategy, for the finite buffer and finite server case, that is insensitive to any propagation delay. We also derive bounds on mix between ABR and guaranteed traffic to ensure that control strategy is effective, and select control design variables which can be used to influence the delivered QoS. The performance of proposed scheme is evaluated using analysis and simulation. Simulation results show that it achieves effective server and buffer utilisation (as predicted by analysis) and by appropriate choice of control design variables achieves prescribed bounded delays (for guaranteed traffic only) and zero cell loss (even for ABR traffic demands exceeding server capacity, which if not controlled would cause losses). Hence proposed scheme delivers guaranteed QoS to user and avoids retransmissions, thus increasing network utilisation.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124572324","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 28
An adaptive virtual path allocation policy for broadband networks 宽带网络自适应虚拟路径分配策略
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.497910
A. Orda, G. Pacifici, D. Pendarakis
{"title":"An adaptive virtual path allocation policy for broadband networks","authors":"A. Orda, G. Pacifici, D. Pendarakis","doi":"10.1109/INFCOM.1996.497910","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.497910","url":null,"abstract":"We propose a new policy for virtual path bandwidth allocation in broadband networks. Based on a threshold scheme, our policy handles the inherent tradeoff between bandwidth utilization and processing costs. In each virtual path controller the thresholds are chosen so as to keep bandwidth utilization high, while obtaining a low rate of processing requests. Two novel ideas are used in our threshold scheme: adaptivity, which results in a better prediction of future bandwidth requirements; and hysteresis, which prevents excessive processing of requests due to oscillations around thresholds. We tested the performance of our new bandwidth control scheme, and compared it with previously suggested schemes. The performance measures were the expected amount of unused bandwidth, the average signaling load and the blocking probability. Performance has been evaluated through numerical computations as well as by simulations. Our analysis is based on a time segmentation technique which allows us to reduce a Markov chain with NM states into M Markov chains with N states and a one-dimensional chain with M states. Our results show that our policy significantly improves upon previously suggested approaches.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124685498","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 34
Mobile power management for maximum battery life in wireless communication networks 移动电源管理,最大限度地延长电池寿命的无线通信网络
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.493310
J. M. Rulnick, N. Bambos
{"title":"Mobile power management for maximum battery life in wireless communication networks","authors":"J. M. Rulnick, N. Bambos","doi":"10.1109/INFCOM.1996.493310","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493310","url":null,"abstract":"We address the problem of how a mobile node in a wireless network should vary its transmitter power so that energy consumption is minimized, subject to fixed quality-of-service constraints. Optimal solutions are obtained for channels with stationary, extraneous interference. A simple dynamic power management algorithm based on these solutions is developed. The algorithm is tested by a series of simulations, including the extraneous-interference case and the more general case where multiple, mutually interfering transmitters operate in a therefore highly responsive interference environment. Results show improved network capacity and stability in addition to substantially improved battery life at the mobile terminals.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125044641","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 85
Traffic-controlled rate monotonic priority scheduling of ATM cells ATM单元的流量控制速率单调优先级调度
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.493361
Seok-Kyu Kweon, K. Shin
{"title":"Traffic-controlled rate monotonic priority scheduling of ATM cells","authors":"Seok-Kyu Kweon, K. Shin","doi":"10.1109/INFCOM.1996.493361","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493361","url":null,"abstract":"Future (broadband) integrated services networks are expected to carry various types of traffic including real-time packet video for which stringent quality of service (QoS) requirements must be met. We propose a cell multiplexing scheme for providing real-time communication services in point-to-point ATM networks. Our scheme is simple enough to be used in high-speed ATM networks, yet reasonably efficient in terms of accommodating channel requests. The scheme employs the leaky bucket model as the input traffic description model and regulates the input traffic at user network interface (UNI) to comply with the input traffic specification. Inside the network ATM switches provide bounded local delays to individual cells using a traffic controller and a non-preemptive rate-monotonic priority scheduler.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129382267","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 30
A measurement-based loss scheduling scheme 一种基于测量的损耗调度方案
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.493049
Tao Yang, Jie Pan
{"title":"A measurement-based loss scheduling scheme","authors":"Tao Yang, Jie Pan","doi":"10.1109/INFCOM.1996.493049","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493049","url":null,"abstract":"In high-speed communication networks such as the ATM-based B-ISDN, a frequently addressed issue in traffic management is how to effectively manage network resources to meet different quality of service (QoS) requirements of multiple traffic streams. We consider a measurement-based loss scheduling scheme, termed the QoS-scheme, for high-speed packet networks. We show that the QoS-scheme is optimal in terms of bandwidth utilization among all stationary, space conserving loss scheduling schemes, and that it is also optimal among all stationary loss schemes when all traffic streams are equally demanding. We examine the properties of the QoS-scheme and how these properties may be used to compute the minimum bandwidth required for a given traffic scenario. We also discuss the implications of these properties and compare the QoS-scheme with other loss scheduling schemes such as the last-in-first-out, partial buffer sharing, and push-out scheme through simulation studies.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127031754","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
A distributed adaptive protocol providing real-time services on WDM-based LANs 一种在基于wdm的局域网上提供实时服务的分布式自适应协议
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.493037
A. Yan, A. Ganz, C. M. Krishna
{"title":"A distributed adaptive protocol providing real-time services on WDM-based LANs","authors":"A. Yan, A. Ganz, C. M. Krishna","doi":"10.1109/INFCOM.1996.493037","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493037","url":null,"abstract":"We consider the problem of supporting multiple classes of real-time and non-real-time traffic on a WDM-based local-area network. We present a demand-adaptive algorithm which schedules transmission according to the quality-of-service requirements of the various traffic classes. The algorithm requires one control channel, on which a single token circulates. This token is used both as a means of communicating status information between the nodes and of controlling access to each of the multiple channels. Numerical examples are provided to illustrate the performance of the algorithm.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130166035","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 50
A protocol for efficient transfer of data over fiber/cable systems 在光纤/电缆系统上有效传输数据的协议
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.493390
D. Sala, J. Limb
{"title":"A protocol for efficient transfer of data over fiber/cable systems","authors":"D. Sala, J. Limb","doi":"10.1109/INFCOM.1996.493390","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493390","url":null,"abstract":"A revolution is occurring in the scope and range of information, communication and education services that will be made available to schools, libraries, town-halls, clinics and, most importantly, residences. These services will be provided initially, primarily over hybrid fiber-cable systems, either by telephone companies or cable companies. The old cable plant is being upgraded and used in totally new ways. The topology and physical characteristics of the upstream channel present new challenges for efficient channel access. We present a media access protocol that efficiently transfers data on this channel. A primary goal in the design was to keep the portion of the protocol resident in the station as simple as possible. Thus we use centralized control located in the cable head-end and minimize intelligence in the station. We refer to this protocol as centralized priority reservation or CPR. A station wishing to transmit sends a request to the head-end using a contention channel. The head-end acknowledges the request and then schedules the request, informing the station by means of a grant message when to transmit. The protocol performs well under heavy load. Performance is affected little by the number of stations, the speed of the system and the physical length of the system.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125690641","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 36
Performance evaluation of selective cell discard schemes in ATM networks ATM网络中选择性小区丢弃方案的性能评价
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.493048
K. Kawahara, Kouichirou Kitajima, T. Takine, Y. Oie
{"title":"Performance evaluation of selective cell discard schemes in ATM networks","authors":"K. Kawahara, Kouichirou Kitajima, T. Takine, Y. Oie","doi":"10.1109/INFCOM.1996.493048","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493048","url":null,"abstract":"In transport-layer protocols such as TCP over ATM networks, a packet is discarded when one or more cells are lost in that packet, and the destination node then requires its source to retransmit the corrupted packet. Therefore, once one of the cells constituting a packet is lost, the subsequent cells of the corrupted packet waste network resources. Thus, discarding those cells will enable us to efficiently utilize the network resources and improve the packet loss probability. We focus on tail dropping (TD) and early packet discard (EPD) as selective cell discard schemes which force the switches to discard some of the arriving cells instead of relaying them. We exactly analyze the packet loss probability in a system applying these schemes. Their advantage and limits are then discussed based on numerical results derived through the analysis.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121320402","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信