Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)最新文献_第6页

Packet reordering, high speed networks and transport protocol performance 数据包重排序，高速网络和传输协议性能

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401591

L. Gharai, C. Perkins, T. Lehman

引用次数: 72

A multicast protection algorithm for optical WDM networks 一种WDM光网络组播保护算法

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401656

Y. Zhang, D. Sidhu

引用次数: 7

Spatial multipath location aided ad hoc routing 空间多路径定位辅助自组织路由

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401731

Soumendra Nanda, R. Gray

引用次数: 9

Analyzing the performance of Internet worm attack approaches 分析了网络蠕虫攻击方法的性能

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401717

Wei Yu

引用次数: 9

Optimal and guaranteed alternative LSP for multiple failures 多故障时最优保证备用LSP

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401587

Lemma Hundessa, J. Domingo-Pascual

{"title":"Optimal and guaranteed alternative LSP for multiple failures","authors":"Lemma Hundessa, J. Domingo-Pascual","doi":"10.1109/ICCCN.2004.1401587","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401587","url":null,"abstract":"Fast rerouting mechanisms are being studied in order to provide fault tolerance for LSP in an MPLS network in case of node or link failure. For QoS provision, protected LSP are handled apart from non-protected LSP. Rerouting mechanisms when applied on protected LSP must take into account QoS requirements. This paper presents a mechanism that is able to handle multiple failures along an LSP while using an optimal alternative LSP. The rerouting decision is taken close to the point of failure that reduces the restoration time. The use of pre-established alternative LSP also reduces the restoration time and avoids blocking when looking for an alternative path. The proposal is based on a hybrid approach of segment repair and path repair and provides a new alternative LSP using dynamic rerouting once the protected one has been rerouted. In this way, there is always an alternative LSP for each protected LSP. The over all performance (recovery time, end-to-end delay, packet losses, and network resource utilization) is compared with existing protection mechanisms by simulation. The proposed hybrid approach, optimal and guaranteed alternative path (OGAP), avoids the possible use of a non-optimal alternative LSP to reroute the protected traffic and provides the flexibility of alternative route selection and setup as well as better resource utilization. Moreover, our proposal guarantees at least one alternative LSF at any time for the traffic on the protected LSP","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129804932","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}

引用次数: 9

Model for series of reconfigurations in wavelength-routed optical networks 波长路由光网络中一系列重构模型

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401695

Passakon Prathombutr, J. Stach, E. Park, S. Tak

引用次数: 1

The impact of UMTS/WCDMA channel round-trip time variations on TCP Vegas throughput UMTS/WCDMA信道往返时间变化对TCP Vegas吞吐量的影响

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401590

A. Lo, G. Heijenk, I. Niemegeers

{"title":"The impact of UMTS/WCDMA channel round-trip time variations on TCP Vegas throughput","authors":"A. Lo, G. Heijenk, I. Niemegeers","doi":"10.1109/ICCCN.2004.1401590","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401590","url":null,"abstract":"Universal Mobile Telecommunications System (UMTS) is a third-generation cellular network that enables high-speed mobile Internet access. This paper evaluates the performance of the transmission control protocol (TCP) Vegas and compares its performance with TCP Reno in a UMTS environment. Bulk data transfer was considered in the simulation with varying radio channel conditions. Data losses were assumed to be only caused by the radio channel. Simulation results show that the performance of Vegas is unexpectedly worse than Reno even though the data losses were completely recovered by the UMTS radio link control layer. This has led us to conduct a detailed investigation on the behavior of Vegas in order to identify the cause of performance degradation in Vegas. The poor performance of Vegas is attributed to the UMTS radio interface characteristics which characterize by large and highly variable TCP round-trip times. The round-trip time variations activated Vegas' congestion avoidance and the sender would interpret the round-trip time variation as a sign of network congestion. Consequently, the sender shrinks its window size which reduces the transmission rate even though no TCP packet losses occur. Furthermore, a sudden increase in the instantaneous round-trip time can trigger spurious timeouts at the TCP sender using Vegas which performs unnecessary retransmissions. Spurious timeouts can lead to significant throughput reduction. Reno, on the other hand, does not show any abnormality and delivers the expected performance","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132659545","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

Admission control for variable bit rate traffic using variable service interval in IEEE 802.11e WLANs IEEE 802.11e无线局域网中使用可变服务间隔的可变比特率流量的接纳控制

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401699

Wing Fai Fan, D. Tsang, B. Bensaou

{"title":"Admission control for variable bit rate traffic using variable service interval in IEEE 802.11e WLANs","authors":"Wing Fai Fan, D. Tsang, B. Bensaou","doi":"10.1109/ICCCN.2004.1401699","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401699","url":null,"abstract":"The IEEE 802.11 working group is currently working on the standard IEEE 802.11e and introduces the hybrid coordination function (HCF) to provide better QoS support to real-time traffic. A reference design of simple scheduling and admission control algorithm is proposed in a TGe consensus proposal. However, this scheduling and admission control unit only consider the mean data rate and mean packet size. The rate and packet size variation are not taken into account. Thus, it is only efficient to CBR traffic and the packet loss rate of VBR traffic may be very high. In W. F. Fan et al. (Aug. 2004), we analyzed the packet loss rate of the reference scheme and proposed a new method to determine the effective TXOP duration for admission control so that the packet loss rate of VBR flows can be guaranteed. In both reference and our proposed scheme, all stations use fixed schedule service interval (SI) which is the minimum of all maximum service interval of all admitted flows. Thus, maximum packet delay of all stations is limited by the most stringent SI and some traffic with larger delay bound may be over-guaranteed. Also, the efficiency of the admission control scheme in W. F. Fan et al. (Aug. 2004), becomes lower than that of the reference one. In this paper, we extend our admission control scheme by using variable service interval to improve the efficiency about 20% - 30% and avoid over guarantee on packet delay. Also, the packet loss rate of VBR traffic can be guaranteed","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129493583","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}

引用次数: 20

Path based routing algorithm for ad hoc networks 基于路径的自组织网络路由算法

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401581

Weilin Zeng, T. Suda

引用次数: 0

A fast rerouting scheme for OSPF/IS-IS networks OSPF/IS-IS网络的快速重路由方案

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401585

Yong Liu, A. Reddy

引用次数: 38