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

Procedure for multicast tree maintenance based on member time duration 基于成员时间的组播树维护过程

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

K. Mnif, M. Kadoch

引用次数: 1

Experimental evaluations of open-source Linux-based VPN solutions 基于linux的开源VPN解决方案的实验评估

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

Shashank Khanvilkar, A. Khokhar

引用次数: 12

Effective network monitoring 有效的网络监控

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

Y. Breitbart, F. Dragan, Hassan Gobjuka

引用次数: 20

PAGER: a distributed algorithm for the dead-end problem of location-based routing in sensor networks PAGER:一种针对传感器网络中基于位置的路由死角问题的分布式算法

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

Leping Zou, Mi Lu, Zixiang Xiong

{"title":"PAGER: a distributed algorithm for the dead-end problem of location-based routing in sensor networks","authors":"Leping Zou, Mi Lu, Zixiang Xiong","doi":"10.1109/ICCCN.2004.1401720","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401720","url":null,"abstract":"The dead-end problem is an importance issue of location-based routing in sensor networks, which occurs when a message falls into a local minimum using greedy forwarding. Current methods for this problem are insufficient either in eliminating traffic/path memorization or finding satisfied short paths. In this paper, we propose a novel algorithm, named partial-partition avoiding geographic routing (PAGER), to solve the problem. The basic idea of PAGER is to divide a sensor network graph into functional sub-graphs, and provide each sensor node with message forwarding directions based on these sub-graphs. That results in loop-free short paths without memorization of traffics/paths in sensor nodes. We implement our algorithm in a protocol and evaluate it in sensor networks with different parameters. Results show that PAGER generates considerably shorter paths, higher delivery ratio and lower energy consumption than the greedy perimeter stateless routing protocol. At the same time, PAGER achieves better performance in handling large-scale networks than the ad-hoc on-demand distance vector protocol","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"19 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":"126144545","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}

引用次数: 21

Fairness and delay guarantees of the new pipelined-sections buffer management method 新的流水线分段缓冲区管理方法的公平性和延迟保证

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

C. S. Pencea, S. Y. Cheung

引用次数: 0

Evaluating dual-failure restorability in mesh-restorable WDM optical 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.1401655

Michael T. Frederick, P. Datta, Arun Kumar Somani

{"title":"Evaluating dual-failure restorability in mesh-restorable WDM optical networks","authors":"Michael T. Frederick, P. Datta, Arun Kumar Somani","doi":"10.1109/ICCCN.2004.1401655","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401655","url":null,"abstract":"Double link failure models, in which any two links in the network fail in an arbitrary order, are becoming critical in survivable optical network design. A significant finding is that designs offering complete dual-failure restorability require almost triple the amount of spare capacity. In this paper, networks are designed to achieve 100% restorability under single link failures, while maximizing coverage against any second link failure in the network. In the event of a single link failure, the restoration model attempts to dynamically find a second alternate link-disjoint end-to-end path to provide coverage against a sequential overlapping link failure. Sub-graph routing (M. T. Frederick et al., Feb. 2003) is extended to provide dual-failure restorability for a network provisioned to tolerate all single-link failures. This strategy is compared with shared-mesh protection. The results indicate that sub-graph routing can achieve overlapping second link failure restorability for 95-99% of connections. It is also observed that sub-graph routing can inherently provide complete dual-failure coverage for ~72-81% of the connections","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"352 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":"134536311","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}

引用次数: 18

Group switching for DWDM optical networks DWDM光网络的组交换

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

Yuanyuan Yang, S. Zheng, D. Verchère

引用次数: 2

Cross-layer optimized routing for Bluetooth personal area network 蓝牙个人区域网络的跨层优化路由

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

Leping Huang, Hongyuan Chen, T. Sivakumar, K. Sezaki

{"title":"Cross-layer optimized routing for Bluetooth personal area network","authors":"Leping Huang, Hongyuan Chen, T. Sivakumar, K. Sezaki","doi":"10.1109/ICCCN.2004.1401613","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401613","url":null,"abstract":"In this paper, we present some observations and analysis on Bluetooth PAN's performance degradation in multi hop network based on our experiments. We highlight a situation in which control packets can be received properly but not data packets, as well as its effects on scatternet performance. Based on our analysis, we propose a cross-layer optimized routing protocol for Bluetooth (CORB), which outperforms AODV based routing protocols. CORB is a QoS-extended AODV routing protocol that is optimized for Bluetooth MAC. It has two unique characteristics. First, it uses a new load metric (LM) in QoS routing protocol instead of the number of hops as in conventional best effort routing. LM reflects nodes' link bandwidth with respect to Bluetooth nodes' role in the scatternet. This helps the CORB to bypass heavily the loaded nodes, and find routes with larger bandwidth. Second, LM and some MAC layer parameters are dynamically adjusted in response to the changes in radio conditions. These two characteristics of CORB contribute to its improved stability, and rapid response to changing radio conditions","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"1 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":"131264858","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

Comparison of traffic and quality characteristics of rate-controlled wavelet and DCT video 速率控制小波和DCT视频的流量和质量特性比较

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

Beshan Kulapala, P. Seeling, M. Reisslein

{"title":"Comparison of traffic and quality characteristics of rate-controlled wavelet and DCT video","authors":"Beshan Kulapala, P. Seeling, M. Reisslein","doi":"10.1109/ICCCN.2004.1401638","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401638","url":null,"abstract":"Wavelet-based encoding is now emerging as an efficient way to encode video for streaming over the Internet and for wireless applications. \"Wavelet-based video coding has been recently added to the JPEG-2000 video standards. As wavelet encoded video emerges as the next generation video encoding method, it is vital to compare the efficiency of wavelet encoded video against the widely used DCT-based MPEG encoded video. However, due to the lack of long wavelet encoded video streams, most research has so far been based on short video traces. This paper presents a comparison study on MPEG vs wavelet encoded video traces for one hour movie excerpts with rate control. These long video sequences allow for the evaluation of long range dependency and self similarity of the generated video traffic, which has not been studied before in the context of comparing DCT and wavelet-based encoding. We focus on the elementary as well as self-similar traffic characteristics of the encoded video. A hump behavior for the variability of frame sizes is observed for increasing video bit rates for both wavelet and MPEG encoded video. In addition, the quality characteristics of the encoded video is examined and related to the traffic. Our results indicate that the wavelet encoded video results in higher video quality than MPEG encoded video. For the frame size variability we find different characteristics depending on the aggregation level for a given data rate. The results also indicate that the variation of quality resulting from the wavelet encoding is lower than for the MPEG encoded video","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":"132261454","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

Fast restoration of signaling packet transportation in WDM networks under multiple failures

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

Kang Xi, S. Arakawa, M. Murata

引用次数: 0