首页 > 最新文献

The Fourth IEEE Workshop on High-Performance Communication Systems最新文献

英文 中文
Achievable QoS in a shared wireless channel 共享无线信道中可实现的QoS
Pub Date : 1997-06-23 DOI: 10.1109/HPCS.1997.864031
J.M. Capone, I. Stavrakakis
In this work, call admission and transmis sion scheduling policies are studied for a TDMA system servicing Variable Bit Rate (VBR) applications with distinct QoS requirements and traf fic characteristics. In this environment. packets which experience excess delays are dropped (due to delay violations) at the source. In addition, packets are dropped at the receiver due to channel induced errors (interference) in the wireless link. The focus of the research is to determine the region of achievable QoS vectors for heterogeneous VBR applications in this shared resource environment and study the impact that channel quality has on the achievable performance. The region of achievable QoS vectors is central to the call admission problem and in this work, it is used to identify a class of scheduling policies capable of delivering any achievable performance.
本文研究了服务于具有不同QoS要求和业务特性的可变比特率(VBR)应用的TDMA系统的呼叫接纳和传输调度策略。在这种环境下。经历过多延迟的数据包将在源处被丢弃(由于违反延迟)。此外,由于无线链路中的信道诱导错误(干扰),数据包在接收端被丢弃。研究的重点是在共享资源环境下确定异构VBR应用可实现QoS矢量的范围,并研究信道质量对可实现性能的影响。可实现QoS矢量的区域是呼叫接纳问题的核心,在本工作中,它用于识别一类能够提供任何可实现性能的调度策略。
{"title":"Achievable QoS in a shared wireless channel","authors":"J.M. Capone, I. Stavrakakis","doi":"10.1109/HPCS.1997.864031","DOIUrl":"https://doi.org/10.1109/HPCS.1997.864031","url":null,"abstract":"In this work, call admission and transmis sion scheduling policies are studied for a TDMA system servicing Variable Bit Rate (VBR) applications with distinct QoS requirements and traf fic characteristics. In this environment. packets which experience excess delays are dropped (due to delay violations) at the source. In addition, packets are dropped at the receiver due to channel induced errors (interference) in the wireless link. The focus of the research is to determine the region of achievable QoS vectors for heterogeneous VBR applications in this shared resource environment and study the impact that channel quality has on the achievable performance. The region of achievable QoS vectors is central to the call admission problem and in this work, it is used to identify a class of scheduling policies capable of delivering any achievable performance.","PeriodicalId":178651,"journal":{"name":"The Fourth IEEE Workshop on High-Performance Communication Systems","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123350711","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
Issues in fast simulation of networks of queues by use of effective and decoupling bandwidths 利用有效和解耦带宽快速模拟队列网络中的问题
Pub Date : 1997-06-23 DOI: 10.1109/HPCS.1997.864035
M. Falkner, M. Devetsiklotis, I. Larnbadaris
A significant difficulty arising when using Monte Carlo (MC) simulation for the performance-analysis of communication networks is the long run times required to obtain accurate statistical estimates. Under the proper conditions, Importance Sampling (IS) is a technique that can speed up simulations involving rare events in network (queueing) systems [1, 2, 3, 4, 5]. Large speed-up factors in simulation run time can be obtained by using IS if the modification or bias of the underlying probability measures of certain random processes is carefully chosen. Fast simulation methods based on Large Deviation Theory [1, 3] have been successfully applied in many cases (recently, most notably in [51].
使用蒙特卡罗(MC)模拟进行通信网络性能分析时出现的一个重大困难是需要很长的运行时间才能获得准确的统计估计。在适当的条件下,重要性采样(IS)是一种可以加速网络(排队)系统中涉及罕见事件的模拟的技术[1,2,3,4,5]。如果仔细选择某些随机过程的潜在概率度量的修正或偏差,利用IS可以获得较大的仿真运行时间加速因子。基于大偏差理论(Large Deviation Theory)的快速仿真方法[1,3]已经成功应用于许多案例(最近,最著名的是[51])。
{"title":"Issues in fast simulation of networks of queues by use of effective and decoupling bandwidths","authors":"M. Falkner, M. Devetsiklotis, I. Larnbadaris","doi":"10.1109/HPCS.1997.864035","DOIUrl":"https://doi.org/10.1109/HPCS.1997.864035","url":null,"abstract":"A significant difficulty arising when using Monte Carlo (MC) simulation for the performance-analysis of communication networks is the long run times required to obtain accurate statistical estimates. Under the proper conditions, Importance Sampling (IS) is a technique that can speed up simulations involving rare events in network (queueing) systems [1, 2, 3, 4, 5]. Large speed-up factors in simulation run time can be obtained by using IS if the modification or bias of the underlying probability measures of certain random processes is carefully chosen. Fast simulation methods based on Large Deviation Theory [1, 3] have been successfully applied in many cases (recently, most notably in [51].","PeriodicalId":178651,"journal":{"name":"The Fourth IEEE Workshop on High-Performance Communication Systems","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126703754","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
An experimental implementation of traffic control for IP networks IP网络流量控制的实验实现
Pub Date : 1997-06-23 DOI: 10.1109/HPCS.1997.864021
M. May, C. Diot
The Integrated Services Packet Networks are designed to offer new network services to a wide variety of applications. The architecture behind the new services consists primarily of a packet scheduler, a packet classifier, admission control, and a reservation establishment protocol. This paper describes a complete implementation of this Traffic Control extensions. We also designed and implemented a kernel interface which permits to send Quality of Service (QoS) requests to the network layer. We explain how the elements of the architecture work in concert and which mechanisms we use to guarantee a requested amount of bandwidth. Our scheduler uses a variant of the Class Based Queuing mechanism (CBQ) of Sally Floyd and Van Jacobsen [6]. For the reservation signaling and establishment we use RSVP [2]. Finally this paper provides a performance evaluation of the proposed mechanisms.
综合业务包网络旨在为各种各样的应用提供新的网络服务。新服务背后的体系结构主要由数据包调度器、数据包分类器、准入控制和预约建立协议组成。本文描述了这个流量控制扩展的完整实现。我们还设计并实现了一个允许向网络层发送服务质量(QoS)请求的内核接口。我们解释了架构的元素是如何协同工作的,以及我们使用哪些机制来保证请求的带宽量。我们的调度器使用Sally Floyd和Van Jacobsen bb0的基于类的队列机制(CBQ)的一种变体。对于预订信号和建立,我们使用RSVP[2]。最后,本文对所提出的机制进行了性能评估。
{"title":"An experimental implementation of traffic control for IP networks","authors":"M. May, C. Diot","doi":"10.1109/HPCS.1997.864021","DOIUrl":"https://doi.org/10.1109/HPCS.1997.864021","url":null,"abstract":"The Integrated Services Packet Networks are designed to offer new network services to a wide variety of applications. The architecture behind the new services consists primarily of a packet scheduler, a packet classifier, admission control, and a reservation establishment protocol. This paper describes a complete implementation of this Traffic Control extensions. We also designed and implemented a kernel interface which permits to send Quality of Service (QoS) requests to the network layer. We explain how the elements of the architecture work in concert and which mechanisms we use to guarantee a requested amount of bandwidth. Our scheduler uses a variant of the Class Based Queuing mechanism (CBQ) of Sally Floyd and Van Jacobsen [6]. For the reservation signaling and establishment we use RSVP [2]. Finally this paper provides a performance evaluation of the proposed mechanisms.","PeriodicalId":178651,"journal":{"name":"The Fourth IEEE Workshop on High-Performance Communication Systems","volume":"6 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120855406","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
On defining, computing and guaranteeing transient loss in high-performance packet networks 高性能分组网络中瞬态损耗的定义、计算与保证
Pub Date : 1997-06-23 DOI: 10.1109/HPCS.1997.864037
Guang-Liang Li, Jun-hong Cui, Fang-Ming Li
In this paper, we discuss defining, computing, and guaranteeing transient loss performance in future high performance packet networks. The results apply to any fluid-type traffic model and do not rely on assumptions such as infinite connection duration, infinite buffer size, and Markov traffic processes.
本文讨论了在未来的高性能分组网络中瞬态丢失性能的定义、计算和保证。结果适用于任何流体类型的流量模型,并且不依赖于无限连接持续时间、无限缓冲区大小和马尔可夫流量过程等假设。
{"title":"On defining, computing and guaranteeing transient loss in high-performance packet networks","authors":"Guang-Liang Li, Jun-hong Cui, Fang-Ming Li","doi":"10.1109/HPCS.1997.864037","DOIUrl":"https://doi.org/10.1109/HPCS.1997.864037","url":null,"abstract":"In this paper, we discuss defining, computing, and guaranteeing transient loss performance in future high performance packet networks. The results apply to any fluid-type traffic model and do not rely on assumptions such as infinite connection duration, infinite buffer size, and Markov traffic processes.","PeriodicalId":178651,"journal":{"name":"The Fourth IEEE Workshop on High-Performance Communication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128790313","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
Supporting multimedia with bandwidth reservation multiple access protocol 支持多媒体带宽预留多址协议
Pub Date : 1997-06-23 DOI: 10.1109/HPCS.1997.864028
Z. Zhang, I. Habib, T. Saadawi
Supporting multimedia traffic over wireless chan nels in a cellular network requires effective control of the channel's limited capacity. The challenge is to guarantee different quality of service (QoS) parameters for different types of traffic while achieving high throughput. We propose and study the performance of a bandwidth reservation multiple access (BRMA) protocol in micro (or pico) cellular networks where the propagation delays are insignificant. The admission and bandwidth allocation functionality is realized through a neural network (NN) according the available bandwidth, traffic patterns and QoS parameters of the new calls. An optimal frame length that controls the scheduling of packets transmission from multiple users is determined such that a worst-case packet loss rate or delay limit can be guaranteed while the throughput is maximized. A service ratio is determined such that the number of transmission slots/frame allocated to each user (group of users) guarantees an "minimum" service rate. This protocol achieves satisfactory performance due to the bandwidth allocation on a call level and the efficient collision-free transmission scheduling.
在蜂窝网络中通过无线信道支持多媒体业务需要有效地控制信道的有限容量。面临的挑战是在实现高吞吐量的同时,保证不同类型流量的不同服务质量(QoS)参数。我们提出并研究了一种带宽保留多址(BRMA)协议在微(或pico)蜂窝网络中传播延迟不显著的性能。根据新呼叫的可用带宽、流量模式和QoS参数,通过神经网络实现接入和带宽分配功能。确定控制多用户数据包传输调度的最优帧长度,以便在吞吐量最大化的同时保证最坏情况下的丢包率或延迟限制。服务比率是这样确定的:分配给每个用户(用户组)的传输槽/帧数保证了“最小”服务速率。该协议基于呼叫级的带宽分配和高效的无冲突传输调度,取得了令人满意的性能。
{"title":"Supporting multimedia with bandwidth reservation multiple access protocol","authors":"Z. Zhang, I. Habib, T. Saadawi","doi":"10.1109/HPCS.1997.864028","DOIUrl":"https://doi.org/10.1109/HPCS.1997.864028","url":null,"abstract":"Supporting multimedia traffic over wireless chan nels in a cellular network requires effective control of the channel's limited capacity. The challenge is to guarantee different quality of service (QoS) parameters for different types of traffic while achieving high throughput. We propose and study the performance of a bandwidth reservation multiple access (BRMA) protocol in micro (or pico) cellular networks where the propagation delays are insignificant. The admission and bandwidth allocation functionality is realized through a neural network (NN) according the available bandwidth, traffic patterns and QoS parameters of the new calls. An optimal frame length that controls the scheduling of packets transmission from multiple users is determined such that a worst-case packet loss rate or delay limit can be guaranteed while the throughput is maximized. A service ratio is determined such that the number of transmission slots/frame allocated to each user (group of users) guarantees an \"minimum\" service rate. This protocol achieves satisfactory performance due to the bandwidth allocation on a call level and the efficient collision-free transmission scheduling.","PeriodicalId":178651,"journal":{"name":"The Fourth IEEE Workshop on High-Performance Communication Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129509428","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
ATLAS I: building block for ATM networks with credit-based flow control 基于信用流量控制的ATM网络的构建模块
Pub Date : 1997-06-23 DOI: 10.1109/HPCS.1997.864038
D. Serpanos, M. Katevenis, E. Spyridakis
ATLAS I is a single-chip, high-performance ATM switch that implements an innovative, advanced ar chitecture with optional multilane (per VC) credit based (backpressure) flow control for data (e.g., ABR) traffic, while allowing use of rate-based flow control wherever desired. The chip is being developed as a next generation gigabit ATM switch under ACTS project "ASICCOM" of the European Union. We describe the architecture of ATLAS I with emphasis on its use as a building block for universal high-speed networking, i.e. for use as a general purpose ATM switch core for the wide, local, and system area. Its single-chip fabrication targets low cost, which will enable wider deployment of ATM technology in all areas of interconnection. Adoption of the optional credit-based flow control can result inefficient, high-speed data networks, that provide improved performance characteristics when compared to wormhole networks. We present simulation re sults indicating that ATLAS I based networks can provide significantly improved delay and through put characteristics over wormhole networks, especiatly under bursty and hot-spot traffic, which is very common in distributed and parallel processing applications.
ATLAS I是一款单芯片高性能ATM交换机,实现了一种创新、先进的ar架构,可选多车道(每个VC)信用(背压)流量控制数据(如ABR)流量,同时允许在任何需要的地方使用基于速率的流量控制。该芯片是在欧盟的ACTS“ASICCOM”项目下作为下一代千兆ATM交换机开发的。我们描述了ATLAS I的体系结构,重点介绍了它作为通用高速网络的构建块的用途,即用作广域、本地和系统区域的通用ATM交换核心。它的单芯片制造目标是低成本,这将使ATM技术在所有互联领域得到更广泛的部署。采用可选的基于信用的流量控制可以导致效率低下的高速数据网络,与虫洞网络相比,它提供了更好的性能特征。我们给出的仿真结果表明,基于ATLAS I的网络可以显著改善虫洞网络的延迟和透放特性,特别是在突发和热点流量下,这在分布式和并行处理应用中非常常见。
{"title":"ATLAS I: building block for ATM networks with credit-based flow control","authors":"D. Serpanos, M. Katevenis, E. Spyridakis","doi":"10.1109/HPCS.1997.864038","DOIUrl":"https://doi.org/10.1109/HPCS.1997.864038","url":null,"abstract":"ATLAS I is a single-chip, high-performance ATM switch that implements an innovative, advanced ar chitecture with optional multilane (per VC) credit based (backpressure) flow control for data (e.g., ABR) traffic, while allowing use of rate-based flow control wherever desired. The chip is being developed as a next generation gigabit ATM switch under ACTS project \"ASICCOM\" of the European Union. We describe the architecture of ATLAS I with emphasis on its use as a building block for universal high-speed networking, i.e. for use as a general purpose ATM switch core for the wide, local, and system area. Its single-chip fabrication targets low cost, which will enable wider deployment of ATM technology in all areas of interconnection. Adoption of the optional credit-based flow control can result inefficient, high-speed data networks, that provide improved performance characteristics when compared to wormhole networks. We present simulation re sults indicating that ATLAS I based networks can provide significantly improved delay and through put characteristics over wormhole networks, especiatly under bursty and hot-spot traffic, which is very common in distributed and parallel processing applications.","PeriodicalId":178651,"journal":{"name":"The Fourth IEEE Workshop on High-Performance Communication Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131953225","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
An efficient polling MAC for wireless LANs 一种用于无线局域网的高效轮询MAC
Pub Date : 1997-06-23 DOI: 10.1109/HPCS.1997.864029
O. Sharon, E. Altman
Polling schemes are an important class of MAC protocols for Wireless LANs. A major drawback of these schemes is their inefficiency when only a small number of mobile stations have packets to transmit. In this paper we suggest a new polling TVIAC which exploits the capture phenomena and enables simultaneous polling and information packets transmissions. Simulation results show that the new TMAC overcomes the above inefficiency considerably.
轮询方案是无线局域网中一类重要的MAC协议。这些方案的一个主要缺点是,当只有少数移动站有数据包要传输时,它们的效率低下。本文提出了一种新的轮询TVIAC,它利用捕获现象,使轮询和信息包传输同时进行。仿真结果表明,该算法较好地克服了上述缺点。
{"title":"An efficient polling MAC for wireless LANs","authors":"O. Sharon, E. Altman","doi":"10.1109/HPCS.1997.864029","DOIUrl":"https://doi.org/10.1109/HPCS.1997.864029","url":null,"abstract":"Polling schemes are an important class of MAC protocols for Wireless LANs. A major drawback of these schemes is their inefficiency when only a small number of mobile stations have packets to transmit. In this paper we suggest a new polling TVIAC which exploits the capture phenomena and enables simultaneous polling and information packets transmissions. Simulation results show that the new TMAC overcomes the above inefficiency considerably.","PeriodicalId":178651,"journal":{"name":"The Fourth IEEE Workshop on High-Performance Communication Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114211833","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}
引用次数: 120
Efficient routing table lookup for IPv6 有效的路由表查找IPv6
Pub Date : 1997-06-23 DOI: 10.1109/HPCS.1997.864020
M. Zitterbart, T. Harbaum, D. Meier, D. Brokelmann
High performance internetworking units, such as routers and bridges are key building blocks of current and emerging high performance networks. The aggregate data rate flowing through a router can be in the range of gigabits per second. In order to keep up with very high data rates, processing within the internetworking unit needs to be optimized. This paper concentrates on routing table look up. It presents a design for a routing table look up for gigabit routers running the new version of IP, EPv6. The proposed approach, HeaRT, is viewed as the core engine of an IM router.
高性能互连网络单元,如路由器和网桥,是当前和新兴高性能网络的关键组成部分。流经路由器的总数据速率可以达到每秒千兆位。为了跟上非常高的数据速率,需要优化互连网络单元内的处理。本文主要研究路由表的查找问题。提出了一种千兆路由器路由表查找的设计方案,该路由表查找适用于运行新版本IP协议EPv6的千兆路由器。所提出的方法HeaRT被视为IM路由器的核心引擎。
{"title":"Efficient routing table lookup for IPv6","authors":"M. Zitterbart, T. Harbaum, D. Meier, D. Brokelmann","doi":"10.1109/HPCS.1997.864020","DOIUrl":"https://doi.org/10.1109/HPCS.1997.864020","url":null,"abstract":"High performance internetworking units, such as routers and bridges are key building blocks of current and emerging high performance networks. The aggregate data rate flowing through a router can be in the range of gigabits per second. In order to keep up with very high data rates, processing within the internetworking unit needs to be optimized. This paper concentrates on routing table look up. It presents a design for a routing table look up for gigabit routers running the new version of IP, EPv6. The proposed approach, HeaRT, is viewed as the core engine of an IM router.","PeriodicalId":178651,"journal":{"name":"The Fourth IEEE Workshop on High-Performance Communication Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114279603","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}
引用次数: 11
The applications of a toolkit for virtual network creation and management 一个用于虚拟网络创建和管理的应用工具包
Pub Date : 1997-06-23 DOI: 10.1109/HPCS.1997.864023
B. Rossi, L. Delgrossi, D. Ferrari
This paper considers potential applications of a toolkit for the creation and management of virtual networks by their users. First, it shows the need for such a toolkit, and introduces the notion of supranet as the result that the application of the toolkit may yield. Then, it briefly examines the characteristics of the groups that may find the adoption of a supranet useful and convenient. Finally, it presents a complete supranet application scenario.
本文考虑了由用户创建和管理虚拟网络的工具包的潜在应用。首先,它展示了对这样一个工具包的需求,并介绍了超级网络的概念,作为工具包应用可能产生的结果。然后,它简要地检查了可能发现采用超网有用和方便的群体的特征。最后,给出了一个完整的超级网络应用场景。
{"title":"The applications of a toolkit for virtual network creation and management","authors":"B. Rossi, L. Delgrossi, D. Ferrari","doi":"10.1109/HPCS.1997.864023","DOIUrl":"https://doi.org/10.1109/HPCS.1997.864023","url":null,"abstract":"This paper considers potential applications of a toolkit for the creation and management of virtual networks by their users. First, it shows the need for such a toolkit, and introduces the notion of supranet as the result that the application of the toolkit may yield. Then, it briefly examines the characteristics of the groups that may find the adoption of a supranet useful and convenient. Finally, it presents a complete supranet application scenario.","PeriodicalId":178651,"journal":{"name":"The Fourth IEEE Workshop on High-Performance Communication Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121614105","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
Error correction strategies for wireless ATM 无线ATM的纠错策略
Pub Date : 1997-06-23 DOI: 10.1109/HPCS.1997.864044
C. Schuler
Forward error correction coding (FEC) is a widely used method to improve transmission quality in modern communication systems. This paperpresents some aspects on the application of advanced error correction con cepts to recent wireless ATM developments. The target bit error rate and the mapping of the wireless connection quality to the ATM service classes are discussed. Some considerations on the issue of code selection with respect to block size, scalability, complexity and performance are presented. We propose methodsfor comparing the performance of codes at the example of various convolutional codes and Reed-Solomon codes. The impact of the radio environment on the FEC codes is addressed and the code performance is evaluated by simulations using a Gilbert Elliott channel model.
前向纠错编码(FEC)是现代通信系统中广泛采用的一种提高传输质量的方法。本文介绍了先进纠错技术在近年来无线ATM发展中的应用。讨论了目标误码率和无线连接质量到ATM服务类别的映射。本文从块大小、可扩展性、复杂性和性能等方面对代码选择问题进行了考虑。我们以各种卷积码和Reed-Solomon码为例,提出了比较码的性能的方法。讨论了无线电环境对FEC码的影响,并利用吉尔伯特·艾略特信道模型对编码性能进行了仿真评估。
{"title":"Error correction strategies for wireless ATM","authors":"C. Schuler","doi":"10.1109/HPCS.1997.864044","DOIUrl":"https://doi.org/10.1109/HPCS.1997.864044","url":null,"abstract":"Forward error correction coding (FEC) is a widely used method to improve transmission quality in modern communication systems. This paperpresents some aspects on the application of advanced error correction con cepts to recent wireless ATM developments. The target bit error rate and the mapping of the wireless connection quality to the ATM service classes are discussed. Some considerations on the issue of code selection with respect to block size, scalability, complexity and performance are presented. We propose methodsfor comparing the performance of codes at the example of various convolutional codes and Reed-Solomon codes. The impact of the radio environment on the FEC codes is addressed and the code performance is evaluated by simulations using a Gilbert Elliott channel model.","PeriodicalId":178651,"journal":{"name":"The Fourth IEEE Workshop on High-Performance Communication Systems","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116826850","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
期刊
The Fourth IEEE Workshop on High-Performance Communication Systems
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
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