2009 7th International Workshop on Design of Reliable Communication Networks最新文献_第3页

Network coding for resilient peer-to-peer networks 弹性对等网络的网络编码

2009 7th International Workshop on Design of Reliable Communication Networks Pub Date : 2009-11-20 DOI: 10.1109/DRCN.2009.5339985

D. Hu, Morris M. Z. Wang, F. Lau, Q. Peng

{"title":"Network coding for resilient peer-to-peer networks","authors":"D. Hu, Morris M. Z. Wang, F. Lau, Q. Peng","doi":"10.1109/DRCN.2009.5339985","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5339985","url":null,"abstract":"Peer dynamics (departure or failure) in peer-to-peer (P2P) networks disrupts the downloading process to the peers. Previous works on fault resilience include peer selection and overlay topology organization. Random network coding based on the generation concept is a practical approach to implement network coding for data networks in general. If we model the generations as blocks distributed by a seed in a P2P network and the disruptions caused by peer dynamics as packet losses, random network coding can be applied in P2P networks. In this paper, we propose a network coding scheme using a concept we call generation crossing. We also introduce a full cardinality precode, which enables a peer to reconstruct the original data file when only a subset of data blocks is received. We show that the success rate for the whole file to be delivered to peers increases remarkably with a small number of overlapped packets between successive generations. Computer simulations based on time-parametrized graph are presented. Simulation results confirm that network coding and generation crossing can provide resilience to peer dynamics in a P2P network.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122335433","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

A multi-layer recovery strategy in FAN over WDM architectures 基于WDM架构的FAN多层恢复策略

2009 7th International Workshop on Design of Reliable Communication Networks Pub Date : 2009-11-20 DOI: 10.1109/DRCN.2009.5340012

J. Domżał, R. Wójcik, K. Wajda, A. Jajszczyk, V. López, J.A. Hernandez, J. Aracil, C. Cárdenas, M. Gagnaire

{"title":"A multi-layer recovery strategy in FAN over WDM architectures","authors":"J. Domżał, R. Wójcik, K. Wajda, A. Jajszczyk, V. López, J.A. Hernandez, J. Aracil, C. Cárdenas, M. Gagnaire","doi":"10.1109/DRCN.2009.5340012","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340012","url":null,"abstract":"Network operators are migrating towards IP over WDM architectures. In such multi-layer networks, it is necessary to efficiently use the resources available from both layers in order to provide coordinated recovery strategies. Thanks to the development of the control plane (GMPLS and ASON), it is feasible to set up and tear down lightpaths automatically, so the WDM layer itself can support failure recovery. This paper describes a multi-layer recovery strategy in a FAN/WDM (Flow-Aware Networking/Wavelength Division Multiplexing) architecture. We propose using the EHOT (Enhanced Hold-Off Timer) algorithm to control network operation after link or node failure. Although FAN operates only on the IP level, the presented analysis shows that it is possible to ensure sufficiently low (less than 50 ms) recovery times in FAN working over an intelligent optical layer. Additionally, the paper shows the motivation for FAN networks and presents the results of carefully selected simulation experiments which allow for evaluating the duration of outages in data transmission under various conditions.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132570154","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

Proposal for tutorial at DRCN'2009 DRCN'2009的教学建议

2009 7th International Workshop on Design of Reliable Communication Networks Pub Date : 2009-11-20 DOI: 10.1109/DRCN.2009.5339981

M. Herzberg

引用次数: 0

Exploiting relocation to reduce network dimensions of resilient optical grids 利用重新定位降低弹性光网的网络尺寸

2009 7th International Workshop on Design of Reliable Communication Networks Pub Date : 2009-11-20 DOI: 10.1109/DRCN.2009.5340020

J. Buysse, M. de Leenheer, Chris Develder, B. Dhoedt

引用次数: 27

Two-stage decomposition of SNORT rules towards efficient hardware implementation SNORT规则的两阶段分解，以实现高效的硬件实现

2009 7th International Workshop on Design of Reliable Communication Networks Pub Date : 2009-11-20 DOI: 10.1109/DRCN.2009.5339986

Hao Chen, D. Summerville, Yu Chen

{"title":"Two-stage decomposition of SNORT rules towards efficient hardware implementation","authors":"Hao Chen, D. Summerville, Yu Chen","doi":"10.1109/DRCN.2009.5339986","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5339986","url":null,"abstract":"The performance gap between the execution speed of security software and the amount of data to be processed is ever widening. A common solution is to close the performance gap through hardware implementation of security functions. However, continuously expanding signature databases have become a major impediment to achieving scalable hardware based pattern matching. Additionally, evolutionary rule databases have necessitated real time online updating for reconfigurable hardware implementations. Based on the observation that signature patterns are constructed from combinations of a limited number of primary patterns, we propose to decompose the Snort signature patterns. These smaller primary pattern sets can be stored along with their associations to allow dynamic signature pattern reconstruction. Not only does the matching operation potentially become more scalable, but the real time online updating task is simplified. The approach is verified with patterns from the latest version of the Snort rule database. The experimental results show that after decomposition, a reduction in size of over 77% can be achieved on Snort signature patterns.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"64 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130922310","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}

引用次数: 10

Survivability of P2P multicasting P2P组播的生存性

2009 7th International Workshop on Design of Reliable Communication Networks Pub Date : 2009-11-20 DOI: 10.1109/DRCN.2009.5340019

K. Walkowiak

{"title":"Survivability of P2P multicasting","authors":"K. Walkowiak","doi":"10.1109/DRCN.2009.5340019","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340019","url":null,"abstract":"At the present time there are many Peer-to-Peer (P2P) multicasting systems supporting live streaming, i.e. real-time dissemination of various content issued at a source node towards a set of receivers. The objective of content distributing can be twofold: maximization of the system throughput (i.e. the streaming rate) and minimization of the streaming cost while guaranteeing the particular streaming rate. In this we paper we focus on P2P multicasting applied for delivering very important content, which need delivery guarantees, e.g. weather forecast, hurricane warnings, distribution of security updates, stock exchange data, etc. To protect the system against failures several (at least two) multicasting trees are established. We tackle the question of how additional survivability constraints guaranteeing failure-disjoint trees influence the cost and throughput of the P2P multicasting system. We consider failures of the following network elements: overlay link, upstream node and ISP link. To investigate the problem we use both simulations and offline optimization methods. According to our results, the additional requirements necessary for protection do not have a substantial impact on the P2P multicasting system performance.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116094804","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

Path diversification: A multipath resilience mechanism 路径多样化:多路径弹性机制

2009 7th International Workshop on Design of Reliable Communication Networks Pub Date : 2009-11-20 DOI: 10.1109/DRCN.2009.5339988

Justin P. Rohrer, A. Jabbar, J. Sterbenz

引用次数: 60

Robust routing vs dynamic load-balancing a comprehensive study and new directions 鲁棒路由与动态负载均衡的综合研究与新方向

2009 7th International Workshop on Design of Reliable Communication Networks Pub Date : 2009-11-20 DOI: 10.1109/DRCN.2009.5340015

P. Casas, Federico Larroca, J. Rougier, Sandrine Vaton

{"title":"Robust routing vs dynamic load-balancing a comprehensive study and new directions","authors":"P. Casas, Federico Larroca, J. Rougier, Sandrine Vaton","doi":"10.1109/DRCN.2009.5340015","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340015","url":null,"abstract":"Traffic Engineering (TE) has become a challenging task for network management and resources optimization due to traffic uncertainty and to the difficulty to predict traffic variations. To address this uncertainty in a robust and efficient way, two almost antagonist approaches have emerged during the last years: Robust Routing and Dynamic Load-Balancing. The former copes with traffic uncertainty in an off-line preemptive fashion, computing a stable routing configuration that is optimized for a large set of possible traffic demands. The latter balances traffic among multiple paths in an on-line reactive fashion, adapting to traffic variations in order to optimize a certain cost-function. Much has been said and discussed about the advantages and drawbacks of each approach, but very few works have tried to compare the performance of both mechanisms, particularly in the same network and traffic scenarios. This paper brings insight into several Robust Routing and Dynamic Load-Balancing algorithms, evaluating their virtues and shortcomings and presenting new mechanisms to improve previous proposals. Among others, such a study intends to help network operators in choosing an adequate mechanism to cope with traffic uncertainty.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"205 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114985697","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}

引用次数: 5

Cooperative multi-provider routing optimization and income distribution 协同多提供商路径优化与收益分配

2009 7th International Workshop on Design of Reliable Communication Networks Pub Date : 2009-11-20 DOI: 10.1109/DRCN.2009.5339996

M. Mycek, Stefano Secci, M. Pióro, J. Rougier, A. Tomaszewski, A. Pattavina

引用次数: 14

Folklore of robust network routing 鲁棒网络路由的民俗

2009 7th International Workshop on Design of Reliable Communication Networks Pub Date : 2009-11-20 DOI: 10.1109/DRCN.2009.5340030

R. Perlman

引用次数: 0