Pub Date : 2009-11-20DOI: 10.1109/DRCN.2009.5339985
D. Hu, Morris M. Z. Wang, F. Lau, Q. Peng
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.
{"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}
Pub Date : 2009-11-20DOI: 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
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.
网络运营商正在向IP over WDM架构迁移。在这种多层网络中，为了提供协调的恢复策略，必须有效地利用两层的可用资源。由于控制平面(GMPLS和ASON)的发展，自动建立和拆除光路是可行的，因此WDM层本身可以支持故障恢复。本文描述了一种基于FAN/WDM(流感知网络/波分复用)架构的多层恢复策略。我们建议使用EHOT (Enhanced Hold-Off Timer)算法来控制链路或节点故障后的网络运行。虽然FAN仅在IP级别上工作，但所提出的分析表明，在智能光学层上工作的FAN可以确保足够低(小于50毫秒)的恢复时间。此外，本文还展示了FAN网络的动机，并给出了精心选择的模拟实验的结果，这些实验允许评估各种条件下数据传输中断的持续时间。
{"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}
Pub Date : 2009-11-20DOI: 10.1109/DRCN.2009.5339981
M. Herzberg
Granted following the Annual Students Survey (obtained top scoring on the various criteria considered).
根据年度学生调查(在考虑的各种标准上获得最高分)授予。
{"title":"Proposal for tutorial at DRCN'2009","authors":"M. Herzberg","doi":"10.1109/DRCN.2009.5339981","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5339981","url":null,"abstract":"Granted following the Annual Students Survey (obtained top scoring on the various criteria considered).","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"93 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":"117174524","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}
Pub Date : 2009-11-20DOI: 10.1109/DRCN.2009.5340020
J. Buysse, M. de Leenheer, Chris Develder, B. Dhoedt
Optical Grids are widely deployed to solve complex problems we are facing today. An important aspect of the supporting network is resiliency i.e. the ability to overcome network failures. In contrast to classical network protection schemes, we will not necessarily provide a back-up path between the source and the original destination. Instead, we will try to relocate the job to another server location if this means that we can provide a backup path which comprises less wavelengths than the one the traditional scheme would suggest. This relocation can be backed up by the Grid specific anycast principle: a user generally does not care where his job is executed and is only interested in its results. We present ILP formulations for both resilience schemes and we evaluate them in a case study on an European network topology.
{"title":"Exploiting relocation to reduce network dimensions of resilient optical grids","authors":"J. Buysse, M. de Leenheer, Chris Develder, B. Dhoedt","doi":"10.1109/DRCN.2009.5340020","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340020","url":null,"abstract":"Optical Grids are widely deployed to solve complex problems we are facing today. An important aspect of the supporting network is resiliency i.e. the ability to overcome network failures. In contrast to classical network protection schemes, we will not necessarily provide a back-up path between the source and the original destination. Instead, we will try to relocate the job to another server location if this means that we can provide a backup path which comprises less wavelengths than the one the traditional scheme would suggest. This relocation can be backed up by the Grid specific anycast principle: a user generally does not care where his job is executed and is only interested in its results. We present ILP formulations for both resilience schemes and we evaluate them in a case study on an European network topology.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"96 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":"132479028","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}
Pub Date : 2009-11-20DOI: 10.1109/DRCN.2009.5339986
Hao Chen, D. Summerville, Yu Chen
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.
{"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}
Pub Date : 2009-11-20DOI: 10.1109/DRCN.2009.5340019
K. Walkowiak
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.
{"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}
Pub Date : 2009-11-20DOI: 10.1109/DRCN.2009.5339988
Justin P. Rohrer, A. Jabbar, J. Sterbenz
We present Path Diversification, a new mechanism that can be used to select multiple paths between a given ingress and egress node pair using a quantified diversity measure to achieve maximum flow reliability. The path diversification mechanism is targeted at the end-to-end layer, but can be applied at any level for which a path discovery service is available, e.g. intra-realm routing or inter-realm routing. Path diversification also takes into account higher level requirements for low-latency or maximal reliability in selecting appropriate paths. Using this mechanism will allow future internetworking architectures to exploit naturally rich physical topologies to a far greater extent than is possible with shortest-path routing or equal-cost load balancing. In this paper we describe the path diversity metric and its application at various aggregation levels. We then apply this metric to the path diversification process in the context of several real-world network graphs to asses the gain in flow reliability.
{"title":"Path diversification: A multipath resilience mechanism","authors":"Justin P. Rohrer, A. Jabbar, J. Sterbenz","doi":"10.1109/DRCN.2009.5339988","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5339988","url":null,"abstract":"We present Path Diversification, a new mechanism that can be used to select multiple paths between a given ingress and egress node pair using a quantified diversity measure to achieve maximum flow reliability. The path diversification mechanism is targeted at the end-to-end layer, but can be applied at any level for which a path discovery service is available, e.g. intra-realm routing or inter-realm routing. Path diversification also takes into account higher level requirements for low-latency or maximal reliability in selecting appropriate paths. Using this mechanism will allow future internetworking architectures to exploit naturally rich physical topologies to a far greater extent than is possible with shortest-path routing or equal-cost load balancing. In this paper we describe the path diversity metric and its application at various aggregation levels. We then apply this metric to the path diversification process in the context of several real-world network graphs to asses the gain in flow reliability.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"26 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":"124285656","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}
Pub Date : 2009-11-20DOI: 10.1109/DRCN.2009.5340015
P. Casas, Federico Larroca, J. Rougier, Sandrine Vaton
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.
{"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}
Pub Date : 2009-11-20DOI: 10.1109/DRCN.2009.5339996
M. Mycek, Stefano Secci, M. Pióro, J. Rougier, A. Tomaszewski, A. Pattavina
We consider the problem of cooperative distributed routing optimization in multi-domain/multi-provider networks. The main object of our investigation are ASON/G-MPLS transport networks, still the results of our investigations could be extended to any multi-domain network where particular domains have limited mutual visibility of intra-domain resources. This paper refines a distributed decomposition mechanism for reliable cooperative optimization of flow reservation levels introduced, by considering the fundamental issue of fair income distribution. The proposed idea of fair income distribution mechanism has been adopted from the theory of cooperative games (Shapley value). We show the benefits of adopting the proposed income distribution scheme by numerical simulations.
{"title":"Cooperative multi-provider routing optimization and income distribution","authors":"M. Mycek, Stefano Secci, M. Pióro, J. Rougier, A. Tomaszewski, A. Pattavina","doi":"10.1109/DRCN.2009.5339996","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5339996","url":null,"abstract":"We consider the problem of cooperative distributed routing optimization in multi-domain/multi-provider networks. The main object of our investigation are ASON/G-MPLS transport networks, still the results of our investigations could be extended to any multi-domain network where particular domains have limited mutual visibility of intra-domain resources. This paper refines a distributed decomposition mechanism for reliable cooperative optimization of flow reservation levels introduced, by considering the fundamental issue of fair income distribution. The proposed idea of fair income distribution mechanism has been adopted from the theory of cooperative games (Shapley value). We show the benefits of adopting the proposed income distribution scheme by numerical simulations.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"24 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":"130150853","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}
Pub Date : 2009-11-20DOI: 10.1109/DRCN.2009.5340030
R. Perlman
This paper describes various types of fragility that can occur in networks, along with various types of defenses that can mitigate these issues. Although some of the techniques suggested in this paper are novel, most of them are “known”, but only as folklore, instead of being written down. Because these issues are not well-documented, many protocols do not implement these well-known techniques. We include technologies that are considered “layer 2” as well as “layer 3”, because we use the term “routing” to include any technology in which paths are dynamically computed and packets are forwarded. This paper focuses on wired networks. Wireless networks face additional challenges.
{"title":"Folklore of robust network routing","authors":"R. Perlman","doi":"10.1109/DRCN.2009.5340030","DOIUrl":"https://doi.org/10.1109/DRCN.2009.5340030","url":null,"abstract":"This paper describes various types of fragility that can occur in networks, along with various types of defenses that can mitigate these issues. Although some of the techniques suggested in this paper are novel, most of them are “known”, but only as folklore, instead of being written down. Because these issues are not well-documented, many protocols do not implement these well-known techniques. We include technologies that are considered “layer 2” as well as “layer 3”, because we use the term “routing” to include any technology in which paths are dynamically computed and packets are forwarded. This paper focuses on wired networks. Wireless networks face additional challenges.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"17 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":"128077532","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：