Proceedings of IEEE INFOCOM '96. Conference on Computer Communications最新文献_第8页

Fast decoding of tagged message formats 标记消息格式的快速解码

Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.497897

T. Blackwell

引用次数: 7

Asymmetric ATM switch modules with imbalanced traffic ATM交换模块不对称，流量不均衡

Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.493378

A. Chatterjee, V. Konangi

{"title":"Asymmetric ATM switch modules with imbalanced traffic","authors":"A. Chatterjee, V. Konangi","doi":"10.1109/INFCOM.1996.493378","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493378","url":null,"abstract":"This paper analyzes the performance of output channel grouped asymmetric packet switch modules in ATM networks, under geometrically bursty input traffic with input/output traffic imbalance. The switch module considered has n inputs and m outputs. A packet destined for a particular output address (out of g) needs to access only one of the r available physical output ports; m=gr. The motivation for the study of these switch modules is that they are the key building blocks in many large multistage switch architectures. A combination of exact derivation and numerical analysis yields the saturation throughput of input buffered switch modules for a wide range of traffic nonuniformity factors and burstiness. Results show a degradation in the maximum throughput, under input/output imbalance, as the average burst length increases. An interesting observation is that asymmetric switches tend to diminish the throughput advantage of the output-buffered switch module over the input buffered switch module under any traffic nonuniformity and burstiness. Our results also indicate that increasing the number of output ports per output address can significantly improve the switch performance, especially when traffic is highly nonuniform and bursty.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"1 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":"121962866","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

Call admission and resource reservation for multicast sessions 多播会话的呼叫允许和资源预留

Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.497882

V. Firoiu, D. Towsley

{"title":"Call admission and resource reservation for multicast sessions","authors":"V. Firoiu, D. Towsley","doi":"10.1109/INFCOM.1996.497882","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.497882","url":null,"abstract":"Many multicast applications, including audio and video, require quality of service (QoS) guarantees from the network. Hence, multicast admission control and resource reservation procedures will be needed. In this paper we present a general framework for admission control and resource reservation for multicast sessions. Within this framework, efficient and practical algorithms that aim to efficiently utilize network resources are developed. The problem of admission control is decomposed into several subproblems that include: the division of end-to-end QoS requirements into local QoS requirements, the mapping of local QoS requirements into resource requirements, and the reclaiming of the resources allocated in excess. These are solved independently of each other yielding a set of mechanisms and policies that can be used to provide admission control and resource reservation for multicast connection establishment. The resource allocation algorithms we consider specifically accommodate receiver heterogeneity (in both end-to-end and per-hop QoS requirements) by reserving necessary and sufficient resources for a multicast session. An application of these algorithms in the context of packetized voice multicast connections over the Mbone is provided to illustrate their applicability.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"20 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":"125791900","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}

引用次数: 76

Context independent unique sequences generation for protocol testing 协议测试的上下文独立的唯一序列生成

Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.493058

T. Ramalingom, K. Thulasiraman, Anindya Das

引用次数: 10

Reliable concurrent multicast from bursty sources 可靠的突发源并发多播

Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.493092

Y. Ofek, B. Yener

{"title":"Reliable concurrent multicast from bursty sources","authors":"Y. Ofek, B. Yener","doi":"10.1109/INFCOM.1996.493092","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493092","url":null,"abstract":"This paper presents a protocol and design for concurrent and reliable group multicast (many-to-many) from bursty data sources in general networks. In a group multicast, any node can be a multicast source and multiple nodes may start to multicast simultaneously, i.e., an asynchronous access to the network. The reliable multicast protocol presented in this work is window based with a combined sender and receiver initiation of the recovery protocol. In reliable multicasting the necessary requirement is to ensure that data is received correctly by all the active members of the multicast group. The approach taken in this work is to combine the multicast operation with the internal flow control, as a result, it is possible to provide: (1) loss-free multicast routing with a single and immediate acknowledgement message to the sender. Furthermore, in every multicast, (2) a node can access all the capacity allocated to its group with no delay, however, if several nodes are active in the same group then the capacity will be shared fairly. In addition, (3) each sender in the multicast group uses a single timer, and (4) a node can join and leave a multicast group in a transparent fashion, i.e., there is no need to explicitly notify the members of the group. A multiple criteria optimization study of the bandwidth allocation to each multicast group is presented. The optimization problem has two min-max objective functions: (1) for delay, which caused by the number of links needed to connect the group, and (2) for congestion, which is caused by sharing a link among multiple multicast groups. The bandwidth allocation among multicast group sharing the same link are further optimized using the max-min fairness criterion.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"24 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":"130042695","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}

引用次数: 42

The drop from front strategy in TCP and in TCP over ATM TCP协议和基于ATM的TCP协议的前端丢弃策略

Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.493070

T. V. Lakshman, A. Neidhardt, T. Ott

{"title":"The drop from front strategy in TCP and in TCP over ATM","authors":"T. V. Lakshman, A. Neidhardt, T. Ott","doi":"10.1109/INFCOM.1996.493070","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493070","url":null,"abstract":"This paper proposes the use of a \"drop from front\" scheme for improving TCP performance in high bandwidth-delay product networks. In particular, for \"TCP over ATM\" we compare the performance when drop from front is used at the output port of ATM switches with the performance under tail drop, its variations, and with variations of random early detection (RED). In drop from front, when a cell arrives at a full buffer, the cell closest to being transmitted is dropped, thus creating space for the arriving cell. This policy causes duplicate acknowledgements to be sent one whole buffer drain time earlier than is the case under tail drop. These quicker duplicate acknowledgements cause TCP with fast retransmit to recognize losses faster and invoke congestion control actions earlier than would be the case under tail drop. This earlier reaction translates into considerable performance improvement. Hence, drop from front successfully utilizes the ability of TCP with fast retransmit to quickly recognize and react to congestion information (at the third repeat acknowledgement, as opposed to time-out). Roughly, the earlier action by the sources causes the congestion not to grow quite as severe, which prevents later over-reaction by the sources, and thus increases throughput.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"83 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":"129822407","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}

引用次数: 125

Source policing for ATM systems based on peakedness rate 基于峰值率的ATM系统源监管

Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.497915

P. I. Sánchez, R. Mazumdar

引用次数: 0

Time scale analysis of explicit rate allocation in ATM networks ATM网络中显式费率分配的时间尺度分析

Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.493063

A. Charny, K. Ramakrishnan

引用次数: 22

Performance and resource cost comparisons for the CBT and PIM multicast routing protocols in DIS environments DIS环境下CBT和PIM组播路由协议的性能和资源成本比较

Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.497881

T. Billhartz, J. Cain, E. Farrey-Goudreau, D. Fieg, S. Batsell

引用次数: 19

A study of reservation dynamics in integrated services packet networks 综合业务包网络中的预留动态研究

Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.493386

Danny J. Mitzel, D. Estrin, S. Shenker, Lixia Zhang

引用次数: 24