10th IEEE Workshop on Local and Metropolitan Area Networks. Selected Papers (IEEE Cat. No.99EX512)最新文献

筛选
英文 中文
A novel method for video-on-demand via digital broadcast 一种通过数字广播实现视频点播的新方法
R. Kermode
{"title":"A novel method for video-on-demand via digital broadcast","authors":"R. Kermode","doi":"10.1109/LANMAN.1999.939956","DOIUrl":"https://doi.org/10.1109/LANMAN.1999.939956","url":null,"abstract":"We propose a new method for the on-demand delivery of streaming media over a small number of multicast channels to large numbers of receivers called Truncated Exponential Partitioning (TEP). Objects delivered using TEP are consumed from the beginning to the end in a linear fashion. This allows their data to be segmented and carried in different channels that are scheduled so that each can arrive just in time for presentation. As a consequence, the amount of storage required in the receiver, access latency, and bandwidth required for a desired level of performance are minimized. Quantitative expressions for these metrics are derived for TEP and compared to a similar scheme skyscraper broadcasting (SB) scheme from which the design of TEP was based. Simulations show that TEP offers superior performance to the SE scheme. Finally, an architecture for delivering movies over cable networks using TEP is proposed.","PeriodicalId":122125,"journal":{"name":"10th IEEE Workshop on Local and Metropolitan Area Networks. Selected Papers (IEEE Cat. No.99EX512)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123029412","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}
引用次数: 1
Robust ABR control for uncertainties in long-range dependent traffic 远程依赖流量不确定性的鲁棒ABR控制
Sven A. M. Östring, H. Sirisena, I. Hudson
{"title":"Robust ABR control for uncertainties in long-range dependent traffic","authors":"Sven A. M. Östring, H. Sirisena, I. Hudson","doi":"10.1109/LANMAN.1999.939957","DOIUrl":"https://doi.org/10.1109/LANMAN.1999.939957","url":null,"abstract":"Network performance, for the engineer designing traffic management protocols, is the key issue as it ensures that the network is functioning within its safe operating limits and that users of various applications are satisfied with the service received. Thus, in the face of uncertainty regarding the true nature of the system and traffic traversing the system, robustness entails maximising the performance of the network across the entire range of possibilities. We investigate standard robust prediction techniques for the design of ABR rate control mechanisms, but, while these optimize for the case with the greatest uncertainty, the system performance can suffer significantly for other cases. By introducing a spectral density comparison term to the entropy, we arrive at a performance measure which achieves robustness in the sense of maintaining high performance under uncertainty. Performance also includes computational efficiency, and various long-range dependent models are compared with regards to the robustness of the system, allowing the model with the least computational expense to be selected.","PeriodicalId":122125,"journal":{"name":"10th IEEE Workshop on Local and Metropolitan Area Networks. Selected Papers (IEEE Cat. No.99EX512)","volume":"927 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127014807","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}
引用次数: 0
Distributed contention-free traffic scheduling in IEEE 802.11 multimedia networks IEEE 802.11多媒体网络中的分布式无争用流量调度
Ravindra S. Ranasinghe, L. Andrew, D. Everitt
{"title":"Distributed contention-free traffic scheduling in IEEE 802.11 multimedia networks","authors":"Ravindra S. Ranasinghe, L. Andrew, D. Everitt","doi":"10.1109/LANMAN.1999.939953","DOIUrl":"https://doi.org/10.1109/LANMAN.1999.939953","url":null,"abstract":"Wireless local area networks are a promising solution to support advanced data services in mobile environments. The IEEE 802.11 wireless LAN standard is emerging as a mature technology to support delay sensitive network services. In order to support these services the standard has proposed the use of a polling scheme; however, existing polling schemes require high communication overheads or suffer from unfairness. In this paper, we propose a distributed fair queueing algorithm \"distributed deficit round robin\", which is compatible with the 802.11 medium access control rules. Software simulation of this scheme shows that it can manage a heterogeneous mix of delay sensitive traffic.","PeriodicalId":122125,"journal":{"name":"10th IEEE Workshop on Local and Metropolitan Area Networks. Selected Papers (IEEE Cat. No.99EX512)","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133663627","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
Explicit rate congestion control with binary notifications 带有二进制通知的显式速率拥塞控制
A. C. Almeida, C. Belo
{"title":"Explicit rate congestion control with binary notifications","authors":"A. C. Almeida, C. Belo","doi":"10.1109/LANMAN.1999.939951","DOIUrl":"https://doi.org/10.1109/LANMAN.1999.939951","url":null,"abstract":"This paper presents a new rate-based source adaptation algorithm for packet-switching networks. The proposed scheme relies on binary notifications from the network to avoid congestion. The network nodes are supposed to estimate a fair share of source rate either based on a stored per-flow information or using a stateless approach. Binary notifications are sent to the sources, reflecting a positive or negative difference between the source rate and the estimated fair share at the nodes. Based on these notifications, sources increase/decrease the current rates using an adaptive algorithm that performs better than the classical additive increase multiplicative decrease strategy. In particular, oscillations on the source rates are much smaller, even with large network delays. Simulation results are presented both for ATM ABR and Internet environments.","PeriodicalId":122125,"journal":{"name":"10th IEEE Workshop on Local and Metropolitan Area Networks. Selected Papers (IEEE Cat. No.99EX512)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133315842","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}
引用次数: 7
A handover protocol and network architecture for wireless extensions of ATM networks ATM网络无线扩展的切换协议和网络架构
J. Indulska, Weiping Zhu
{"title":"A handover protocol and network architecture for wireless extensions of ATM networks","authors":"J. Indulska, Weiping Zhu","doi":"10.1109/LANMAN.1999.939967","DOIUrl":"https://doi.org/10.1109/LANMAN.1999.939967","url":null,"abstract":"ATM protocols are connection oriented and migration of a mobile computer can therefore require rerouting of ATM connections while minimizing violation of Quality of Service specified for these connections. This implies that the handover process needs to be performed with small delay, minimal cell loss and no change in cell sequence. The problem is magnified by the fact that high-speed networks such as ATM will often deliver services to real time multimedia applications, such as video and audio, which have stringent Quality of Service requirements. In this paper, we describe a handover protocol that preprocesses partial connections for cells incurring long handover delays. In this protocol, cells are clustered and the clusters are divided into crust and core cells which are handled differently during handovers. The protocol minimizes the degradation of Quality of Service during handovers.","PeriodicalId":122125,"journal":{"name":"10th IEEE Workshop on Local and Metropolitan Area Networks. Selected Papers (IEEE Cat. No.99EX512)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124834308","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}
引用次数: 0
Matching differentiated services PHBs to ATM service categories-the AF to VBR case 将不同的业务phb匹配到ATM业务类别(AF到VBR)
G. Rogers, R. Liu, M. Minhazuddin, J. Argyros
{"title":"Matching differentiated services PHBs to ATM service categories-the AF to VBR case","authors":"G. Rogers, R. Liu, M. Minhazuddin, J. Argyros","doi":"10.1109/LANMAN.1999.939955","DOIUrl":"https://doi.org/10.1109/LANMAN.1999.939955","url":null,"abstract":"An important component of the differentiated services concept being developed by the IETF is traffic conditioning which includes the shaping of traffic at the boundaries of differentiated services domains, and also at interior nodes in order to match the requirements of particular link layer technologies. However shaping alters the characteristics of a traffic flow and is in danger of degrading individual flow's QoS, particularly where no per flow connection admission control is used, unless the source is able to respond to the shaping operation. The IETF's Assured Forwarding Specification defines a multi precedence level, probabilistic packet dropping mechanism to give controlled sources such as TCP the ability to respond to congestion. In this paper we propose combining this with a suitable shaping mechanism to enable controlled sources to respond to shaping operations. While we believe this to be generally applicable, we develop the idea in the specific context of differentiated services over an ATM link where traffic shaping at the ATM level is required to exploit ATM's QoS capability, for example using VBR. An experimental implementation is described, based on commercial equipment, which is used to demonstrate the essential features of an Assured Forwarding PHB with three levels of drop precedence. In particular we show that sources of traffic with different precedence levels can, simultaneously, be in different modes of the TCP control algorithm.","PeriodicalId":122125,"journal":{"name":"10th IEEE Workshop on Local and Metropolitan Area Networks. Selected Papers (IEEE Cat. No.99EX512)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114069183","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}
引用次数: 3
Performance evaluation of new fair queuing algorithm based on CSFQ architecture 基于CSFQ架构的新型公平排队算法的性能评价
T. Kurimoto, T. Shimizu
{"title":"Performance evaluation of new fair queuing algorithm based on CSFQ architecture","authors":"T. Kurimoto, T. Shimizu","doi":"10.1109/LANMAN.1999.939960","DOIUrl":"https://doi.org/10.1109/LANMAN.1999.939960","url":null,"abstract":"A new algorithm called core-stateless random-early-detection (CS-RED) is described. This algorithm can improve the fairness characteristics under a wide range of network conditions and is robust in terms of the setting of its control parameters. It can be used in a distributed architecture, as can the core-stateless fair-queuing (CSFQ) algorithm, so it is applicable to large-capacity backbone routers. Through a detailed evaluation, this paper identifies and clarifies the fairness degradation problem in the CSFQ algorithm. CS-RED was derived to solve this problem by incorporating congestion notification in the RED algorithm. Evaluation of the CS-RED algorithm by computer simulation and comparison of the fairness characteristics in networks using either the CS-RED or the CSFQ algorithm showed that a higher level of fairness is achieved with the CS-RED algorithm under a wide variety of network conditions without degrading link utilization. The treatment necessary to prevent unresponsive flows in best effort networks is also discussed. We have found that a more general treatment, rather than the penalty box, can be used with the CS-RED algorithm.","PeriodicalId":122125,"journal":{"name":"10th IEEE Workshop on Local and Metropolitan Area Networks. Selected Papers (IEEE Cat. No.99EX512)","volume":"588 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116550436","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}
引用次数: 1
ASHMEN-an approach to ATM services over shared media networks ashmen——通过共享媒体网络实现ATM服务的一种方法
B. Stiller
{"title":"ASHMEN-an approach to ATM services over shared media networks","authors":"B. Stiller","doi":"10.1109/LANMAN.1999.939964","DOIUrl":"https://doi.org/10.1109/LANMAN.1999.939964","url":null,"abstract":"The resource management for ASHMEN (ATM over Shared Media Networks) is concerned with Quality-of-Service (QoS) support and QoS provision in the local area networking environment in order to offer wide area ATM (Asynchronous Transfer Mode) services over shared media networks. Based on a prototypical implementation, including the design of a highly flexible resource management scheme, empirical values in terms of statistical QoS guarantees for delay and throughput have been investigated. The approach developed determines that in-advance performance assumptions can be maintained during the operation of ATM connections between an ATM backbone and ASHMEN-capable end systems attached to a shared media network via an Attachment Device.","PeriodicalId":122125,"journal":{"name":"10th IEEE Workshop on Local and Metropolitan Area Networks. Selected Papers (IEEE Cat. No.99EX512)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126397186","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}
引用次数: 0
Network reliability enhancement by a self-healing algorithm 一种自愈算法增强网络可靠性
A. Greca, K. Nakagawa
{"title":"Network reliability enhancement by a self-healing algorithm","authors":"A. Greca, K. Nakagawa","doi":"10.1109/LANMAN.1999.939958","DOIUrl":"https://doi.org/10.1109/LANMAN.1999.939958","url":null,"abstract":"The steady increase in the volume of data transmitted over ATM networks suggest that even a single link failure will seriously impact many service users. Thus, it is very important to develop restoration mechanisms that minimize the impact on the affected services. Self-healing algorithm can be used to automatically restore failed VPs (virtual paths) in backbone ATM networks. In this environment, a major research challenge is to understand the fundamental tradeoff between the capacity of the failed links and importance of the last calls with the reliability level of VPs, and to create a self-healing algorithm for VP capacity allocation that achieves an optimal network operating point. This paper focuses on evaluating the efficiency of the self-healing algorithm, C-TRUS, under the multi-failure scenario for different network topologies and loads and, compares its behavior to that of the combination method. The simulation results show that our approach can build survivable networks with improved reliability that meet different service class requirements.","PeriodicalId":122125,"journal":{"name":"10th IEEE Workshop on Local and Metropolitan Area Networks. Selected Papers (IEEE Cat. No.99EX512)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127909631","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}
引用次数: 0
Enforcing fairness with explicit network feedback in the Internet 在互联网上通过明确的网络反馈来加强公平
M. Gerla, W. Weng, R. Cigno
{"title":"Enforcing fairness with explicit network feedback in the Internet","authors":"M. Gerla, W. Weng, R. Cigno","doi":"10.1109/LANMAN.1999.939952","DOIUrl":"https://doi.org/10.1109/LANMAN.1999.939952","url":null,"abstract":"Fairness in the Internet is becoming a major obstacle for the introduction of commercial services. In this paper we address the problem of fairness with a slightly non-standard approach: we show that, in order to achieve fairness in the Internet, it is enough to provide good congestion control, without the need for explicit computation of fairness indexes. We first introduce a TCP-based congestion scheme that takes into account available bandwidth resources on links, describing how this scheme can be easily introduced as a TCP option in end-systems; it requires neither a centralized approach in routers, nor a per-flow management of traffic. Then several scenarios are analyzed via simulation, showing how and to what degree fairness is achieved. Results are compared with a traditional TCP-Reno implementation with RED routers. Finally, the coexistence of the new TCP version with traditional implementations is discussed.","PeriodicalId":122125,"journal":{"name":"10th IEEE Workshop on Local and Metropolitan Area Networks. Selected Papers (IEEE Cat. No.99EX512)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117260507","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}
引用次数: 2
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学术文献互助群
群 号:604180095
Book学术官方微信