Proceedings of Sixth International Conference on Computer Communications and Networks最新文献_第4页

TWDM multihop lightwave networks based on rotator digraphs 基于旋转有向图的TWDM多跳光波网络

Proceedings of Sixth International Conference on Computer Communications and Networks Pub Date : 1997-09-22 DOI: 10.1109/ICCCN.1997.623306

P. Wan

引用次数: 1

Efficient admission control for EDF scheduler with statistical QoS guarantee 具有统计QoS保证的EDF调度程序的有效准入控制

Proceedings of Sixth International Conference on Computer Communications and Networks Pub Date : 1997-09-22 DOI: 10.1109/ICCCN.1997.623319

Yinggang Xie, Tao Yang

引用次数: 3

Reliability of Internet hosts: a case study from the end user's perspective Internet主机的可靠性:从最终用户角度的案例研究

Proceedings of Sixth International Conference on Computer Communications and Networks Pub Date : 1997-09-22 DOI: 10.1109/ICCCN.1997.623345

Mahesh Kalyanakrishnan, R. Iyer, J. U. Patel

引用次数: 70

Fault tolerance of PCS mobility databases PCS移动数据库容错

Proceedings of Sixth International Conference on Computer Communications and Networks Pub Date : 1997-09-22 DOI: 10.1109/ICCCN.1997.623365

S. Chen, Ming-Feng Chang, Yi-Bing Lin

引用次数: 1

New error recovery structures for reliable multicasting 新的可靠组播错误恢复结构

Proceedings of Sixth International Conference on Computer Communications and Networks Pub Date : 1997-09-22 DOI: 10.1109/ICCCN.1997.623312

Lifan Gu, J. Garcia-Luna-Aceves

{"title":"New error recovery structures for reliable multicasting","authors":"Lifan Gu, J. Garcia-Luna-Aceves","doi":"10.1109/ICCCN.1997.623312","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623312","url":null,"abstract":"To reduce or eliminate the implosion of acknowledgments at the source of a very large multicast group, current reliable multicast protocols either organize the receivers of a group into a tree or ring, or implement negative acknowledgment (NAK) avoidance algorithms based on random timers. All of these approaches have their limitations and advantages. We present a ring-based reliable multicast protocol, called the evenly-loaded ring protocol (ELRP) which removes processing bursts from nodes in the ring. ELRP achieves throughputs as good as those obtained with tree-based protocols and better than those of receiver-initiated protocols with NAK avoidance. We propose a deterministic NAK avoidance (DNKA) algorithm based on ELRP that performs better than the random NAK avoidance scheme (RNKA). Because tree structures are better suited than rings for wide areas involving paths with long delays, we propose the hybrid reliable multicast protocol (HRMP) which organizes receivers into a backbone acknowledgement tree that connects local areas. Any tree-based protocol with positive acknowledgement can be run in the backbone acknowledgement tree, and ELRP is run in the local areas. The maximum achievable throughput in HRMP is analyzed, which shows that it is completely scalable. The delay of DNKA and RNKA schemes are also analyzed which shows that compared with RNKA, DNKA reduces the retransmission delay significantly.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"206 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115021499","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}

引用次数: 8

Pipelined transmission scheduling in all-optical TDM/WDM rings 全光TDM/WDM环中的流水线传输调度

Proceedings of Sixth International Conference on Computer Communications and Networks Pub Date : 1997-09-22 DOI: 10.1109/ICCCN.1997.623304

Xijun Zhang, C. Qiao

引用次数: 17

ATM network interface architectures for low latency 用于低延迟的ATM网络接口架构

Proceedings of Sixth International Conference on Computer Communications and Networks Pub Date : 1997-09-22 DOI: 10.1109/ICCCN.1997.623357

Patrik Sundström, Per Andersson

引用次数: 3

An API for scalable reliable multicast 可扩展的可靠多播API

Proceedings of Sixth International Conference on Computer Communications and Networks Pub Date : 1997-09-22 DOI: 10.1109/ICCCN.1997.623291

J. Gemmell, J. Liebeherr, D. Bassett

引用次数: 3

Explicit rate ABR schemes using traffic load as congestion indicator 以流量负荷为拥塞指标的显式速率ABR方案

Proceedings of Sixth International Conference on Computer Communications and Networks Pub Date : 1997-09-22 DOI: 10.1109/ICCCN.1997.623294

F. Chiussi, A. Arulambalam, Ye Xia, Xiaoqiang Chen

{"title":"Explicit rate ABR schemes using traffic load as congestion indicator","authors":"F. Chiussi, A. Arulambalam, Ye Xia, Xiaoqiang Chen","doi":"10.1109/ICCCN.1997.623294","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623294","url":null,"abstract":"A central issue in congestion control for available bit rate (ABR) services is the computation of the fair share for every connection at each switching node in the network. An important class of algorithms for the switch behavior computes the fair share according to the exact definition of max-min fairness, and uses it as the explicit rate conveyed to the sources. These algorithms may encounter difficulties due to the complex task of keeping track of active connections. In addition, since these schemes treat all connections equally, they lead to under-utilization of the link capacity when on-off sources are present in the network. To obviate these shortcomings, it has been proposed to use the traffic load to correct the computed fair share when setting the explicit rate. In this paper, first we show that using the traffic load as suggested in literature inherently perturbs rate allocation, and makes the schemes sensitive to the round-trip delay of the connections, leading to unfairness. Then, we introduce a scheme called the enhanced fast max-min rate allocation (E-FMMRA) algorithm, which solves the problem by keeping track of the maximum explicit rate over all backward RM cells. The same technique used in E-FMMRA can also be applied to the popular explicit rate indication for congestion avoidance (ERICA) scheme to solve similar problems associated with the use of the traffic load.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124980604","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}

引用次数: 12

A distributed algorithm of delay bounded multicast routing for multimedia applications 多媒体应用中时延有界多播路由的分布式算法

Proceedings of Sixth International Conference on Computer Communications and Networks Pub Date : 1997-09-22 DOI: 10.1109/ICCCN.1997.623314

X. Jia

引用次数: 167