Pub Date : 2005-12-27DOI: 10.1109/DRCN.2005.1563894
Csaba Antal, J. Harmatos, Gábor Tóth
This paper presents a novel resource provisioning method for virtual private networks. Trunk and hose models are well known bandwidth provisioning models for VPNs but both have significant disadvantages if applied to large scale networks. The management complexity of the trunk model highly increases with the size of the network, while bandwidth efficiency of the hose model is often excessively low. The authors proposed an intermediate solution between hose and trunk models. By dividing the network into clusters and using cluster-based traffic description an appropriate equilibrium between management complexity and over provisioning could be found. A method for computing the necessary links capacities for a traffic given by cluster-based description is also presented, which makes it possible to design congestion free networks. Routing strategies were also suggested to further improve the performance of the new provisioning method. The applicability and limitations of the method and the effect of different routing strategies and fault tolerance are examined by simulating several test scenarios.
{"title":"A cluster-based resource provisioning model in virtual private networks","authors":"Csaba Antal, J. Harmatos, Gábor Tóth","doi":"10.1109/DRCN.2005.1563894","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563894","url":null,"abstract":"This paper presents a novel resource provisioning method for virtual private networks. Trunk and hose models are well known bandwidth provisioning models for VPNs but both have significant disadvantages if applied to large scale networks. The management complexity of the trunk model highly increases with the size of the network, while bandwidth efficiency of the hose model is often excessively low. The authors proposed an intermediate solution between hose and trunk models. By dividing the network into clusters and using cluster-based traffic description an appropriate equilibrium between management complexity and over provisioning could be found. A method for computing the necessary links capacities for a traffic given by cluster-based description is also presented, which makes it possible to design congestion free networks. Routing strategies were also suggested to further improve the performance of the new provisioning method. The applicability and limitations of the method and the effect of different routing strategies and fault tolerance are examined by simulating several test scenarios.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114214465","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 : 2005-12-27DOI: 10.1109/DRCN.2005.1563914
Gerald Kunzmann, R. Nagel, J. Eberspächer
Third generation P2P networks try to reduce the high signaling overhead observed in unstructured P2P networks by means of proactive routing. Therefore, a deterministically structured overlay network is established between the participating peers by making use of distributed hash tables (DHT). To ensure the correct execution of lookups it is crucial to keep up the network structure. The Chord protocol already proposes an efficient stabilize algorithm that works well in networks with low churn rates. However, as nodes join and leave the network more frequently, inconsistencies within the network structure appear, because the network is not capable of reacting fast enough to all changes in the topology. In this paper the authors proposed a modified stabilize algorithm that is based on available token techniques from ring networks. While decreasing the overhead in the network, a more stable overlay structure is established.
{"title":"Increasing the reliability of structured P2P networks","authors":"Gerald Kunzmann, R. Nagel, J. Eberspächer","doi":"10.1109/DRCN.2005.1563914","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563914","url":null,"abstract":"Third generation P2P networks try to reduce the high signaling overhead observed in unstructured P2P networks by means of proactive routing. Therefore, a deterministically structured overlay network is established between the participating peers by making use of distributed hash tables (DHT). To ensure the correct execution of lookups it is crucial to keep up the network structure. The Chord protocol already proposes an efficient stabilize algorithm that works well in networks with low churn rates. However, as nodes join and leave the network more frequently, inconsistencies within the network structure appear, because the network is not capable of reacting fast enough to all changes in the topology. In this paper the authors proposed a modified stabilize algorithm that is based on available token techniques from ring networks. While decreasing the overhead in the network, a more stable overlay structure is established.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"331 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116646942","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 : 2005-12-27DOI: 10.1109/DRCN.2005.1563875
W. Bigos, H. Nakajima
In this paper we study various options for the survivability implementation in MPLS over optical transport networks (OTN) in terms of the network resource usage and configuration cost. We investigate two approaches to the survivability deployment: single layer and multilayer survivability and present different methods for spare capacity allocation (SCA) to reroute disrupted traffic. The comparative analysis shows the influence of the traffic granularity on the survivability cost: for high bandwidth LSPs, close to the optical channel capacity, the multilayer survivability outperforms the single layer one in terms of the configuration cost, whereas for low bandwidth LSPs the single layer survivability is more cost-efficient. For the multilayer survivability we demonstrate that by mapping efficiently the spare capacity of the MPLS layer onto the resources of the optical layer one can achieve up to 22% savings in the total configuration cost and up to 37% in the optical layer cost. These results are based on a cost model with actual technology pricing and were obtained for networks targeted to a nationwide coverage.
{"title":"Survivable MPLS over optical transport networks: cost and network resource usage analysis","authors":"W. Bigos, H. Nakajima","doi":"10.1109/DRCN.2005.1563875","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563875","url":null,"abstract":"In this paper we study various options for the survivability implementation in MPLS over optical transport networks (OTN) in terms of the network resource usage and configuration cost. We investigate two approaches to the survivability deployment: single layer and multilayer survivability and present different methods for spare capacity allocation (SCA) to reroute disrupted traffic. The comparative analysis shows the influence of the traffic granularity on the survivability cost: for high bandwidth LSPs, close to the optical channel capacity, the multilayer survivability outperforms the single layer one in terms of the configuration cost, whereas for low bandwidth LSPs the single layer survivability is more cost-efficient. For the multilayer survivability we demonstrate that by mapping efficiently the spare capacity of the MPLS layer onto the resources of the optical layer one can achieve up to 22% savings in the total configuration cost and up to 37% in the optical layer cost. These results are based on a cost model with actual technology pricing and were obtained for networks targeted to a nationwide coverage.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124729765","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 : 2005-12-27DOI: 10.1109/DRCN.2005.1563893
G. Fiaschi, D. Caviglia, D. Bramanti
Efficient resource usage is an essential part in service availability, because more usable spare resources mean more space for restoration. Temporary outages in the control plane may represent a cause of waste of resource, if during a path deletion procedure the signal flow is interrupted and some nodes may fail to receive the proper resource release commands. This paper presents a "safe deletion" procedure to preserve efficiency in resource usage even in presence of temporary node isolation. Index Terms control plane, signalling protocol, resource usage, service availability.
{"title":"Fault-tolerant path teardown signalling for broken-link resource collection","authors":"G. Fiaschi, D. Caviglia, D. Bramanti","doi":"10.1109/DRCN.2005.1563893","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563893","url":null,"abstract":"Efficient resource usage is an essential part in service availability, because more usable spare resources mean more space for restoration. Temporary outages in the control plane may represent a cause of waste of resource, if during a path deletion procedure the signal flow is interrupted and some nodes may fail to receive the proper resource release commands. This paper presents a \"safe deletion\" procedure to preserve efficiency in resource usage even in presence of temporary node isolation. Index Terms control plane, signalling protocol, resource usage, service availability.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124934264","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 : 2005-12-27DOI: 10.1109/DRCN.2005.1563853
C. Charnsripinyo, D. Tipper
In this paper, we propose an optimization based model for the design of survivable third generation wireless access backhaul networks using a mesh topology. The network design model seeks to minimize the cost of the backhaul network while meeting quality of service and survivability requirements. The design model includes the packet based nature of network traffic and incorporates the effects of user mobility after a failure. We adopt a two-phase design methodology. The first phase provides a minimum-cost, initial network design meeting QoS requirements. The second phase augments the network topology from phase one in order to satisfy survivability requirements. In order to scale the design with network size a computationally efficient heuristic based on iterative minimum cost routing is proposed. Numerical results are given illustrating the network design approach and the quality of the heuristic solution method.
{"title":"Topological design of 3G wireless backhaul networks for service assurance","authors":"C. Charnsripinyo, D. Tipper","doi":"10.1109/DRCN.2005.1563853","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563853","url":null,"abstract":"In this paper, we propose an optimization based model for the design of survivable third generation wireless access backhaul networks using a mesh topology. The network design model seeks to minimize the cost of the backhaul network while meeting quality of service and survivability requirements. The design model includes the packet based nature of network traffic and incorporates the effects of user mobility after a failure. We adopt a two-phase design methodology. The first phase provides a minimum-cost, initial network design meeting QoS requirements. The second phase augments the network topology from phase one in order to satisfy survivability requirements. In order to scale the design with network size a computationally efficient heuristic based on iterative minimum cost routing is proposed. Numerical results are given illustrating the network design approach and the quality of the heuristic solution method.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126777902","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 : 2005-12-27DOI: 10.1109/DRCN.2005.1563885
Oana Brinzanescu, S. Schnitter
In this paper the authors demonstrated how a routing tool can improve the operation of a complex transport network. The tool's two main objectives are to improve the interaction of network planning and operation and to improve the reliability of provisioned circuits. The calculation of routings for customer demands is the main link between network planning and operation. A central routing tool can be implemented to optimize the interworking of planning and operation for an efficient use of network resources, high reliability and fast provisioning times of customer demands. Network labeling was introduced to document the network structure and a routing algorithm that incorporates this structure as well as the physical disjointness of 1 + 1 protected demands. The details are exemplified for a SDH network but the methods themselves can be applied to other kinds of transport networks as well.
{"title":"Interworking of planning and operation for reliable and cost-effective transport networks","authors":"Oana Brinzanescu, S. Schnitter","doi":"10.1109/DRCN.2005.1563885","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563885","url":null,"abstract":"In this paper the authors demonstrated how a routing tool can improve the operation of a complex transport network. The tool's two main objectives are to improve the interaction of network planning and operation and to improve the reliability of provisioned circuits. The calculation of routings for customer demands is the main link between network planning and operation. A central routing tool can be implemented to optimize the interworking of planning and operation for an efficient use of network resources, high reliability and fast provisioning times of customer demands. Network labeling was introduced to document the network structure and a routing algorithm that incorporates this structure as well as the physical disjointness of 1 + 1 protected demands. The details are exemplified for a SDH network but the methods themselves can be applied to other kinds of transport networks as well.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124608015","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 : 2005-12-27DOI: 10.1109/DRCN.2005.1563847
D. Mello, D. Schupke, M. Scheffel, H. Waldman
The provisioning of services in optical networks demands reliable transmission paths. This paper investigates the availability of optical connections with respect to the failure probability of the involved network components. Outages of the fiber links as well as potential hardware failures for different opaque and transparent node architectures are analyzed. The results are presented in terms of map diagrams which allow to determine the availability of a wavelength connection subject to the transmission distance and the number of traversed hops.
{"title":"Availability maps for connections in WDM optical networks","authors":"D. Mello, D. Schupke, M. Scheffel, H. Waldman","doi":"10.1109/DRCN.2005.1563847","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563847","url":null,"abstract":"The provisioning of services in optical networks demands reliable transmission paths. This paper investigates the availability of optical connections with respect to the failure probability of the involved network components. Outages of the fiber links as well as potential hardware failures for different opaque and transparent node architectures are analyzed. The results are presented in terms of map diagrams which allow to determine the availability of a wavelength connection subject to the transmission distance and the number of traversed hops.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123717142","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 : 2005-12-27DOI: 10.1109/DRCN.2005.1563900
R. Clemente, M. Bartoli, M. Bossi, G. D'Orazio, Giuseppe Cosmo
Availability SLA is the availability value that a Network Operator guarantees to its customers when offering a communication service. This paper investigates the linkage between network/connection availability and availability SLA, suggests a method to define availability SLA and to control the associated non-complying risk, and provides some examples of availability SLA reckoning.
{"title":"Risk management in availability SLA","authors":"R. Clemente, M. Bartoli, M. Bossi, G. D'Orazio, Giuseppe Cosmo","doi":"10.1109/DRCN.2005.1563900","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563900","url":null,"abstract":"Availability SLA is the availability value that a Network Operator guarantees to its customers when offering a communication service. This paper investigates the linkage between network/connection availability and availability SLA, suggests a method to define availability SLA and to control the associated non-complying risk, and provides some examples of availability SLA reckoning.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125069843","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 : 2005-12-27DOI: 10.1109/DRCN.2005.1563871
A. Kodian, W. Grover, J. Doucette
Recent work has proposed the concept of failure-independent path-protecting (FIPP) p-cycles as a pre-connected, failure independent, path-protecting network architecture [A. Kodian, W. D. Grover (2005)]. FIPP p-cycles extend p-cycles by adding the property, like shared backup path protection (SBPP), of providing end-to-end failure independent path switching against either span or node failures. Especially in a transparent or translucent optical network, the property of pre-cross-connection of protection paths can be even more important than just increasing restoration-speed: when optical protection paths are pre-cross-connected, they can be guaranteed in advance to work when required. FIPP p-cycles therefore offer a fully pre-connected, alternative to SBPP in which protection paths must be assembled on the fly from spare wavelength channels. Design results from small networks in [A. Kodian, W. D. Grover (2005)] showed that FIPP p-cycle designs can be as efficient as SBPP but it is very difficult to design larger networks using the ILP design model in [A. Kodian, W. D. Grover (2005)]. We now develop a new ILP model and a related heuristic method for FIPP p-cycle design that produces network designs with much faster runtimes. Results indicate that the heuristic generates FIPP p-cycle designs that have total capacity costs within 10-18% of optimally designed SBPP solutions.
最近的研究提出了故障无关路径保护(FIPP) p环的概念，作为一种预连接的、故障无关的路径保护网络架构[a]。Kodian, W. D. Grover[2005]。FIPP p-cycles通过添加属性(如共享备份路径保护(SBPP))来扩展p-cycles，提供端到端故障独立的路径切换，以防止跨度或节点故障。特别是在透明或半透明光网络中，保护路径的预交联性能比仅仅提高恢复速度更为重要:当光保护路径进行预交联时，可以保证它们在需要时提前工作。因此，FIPP p周期提供了一个完全预连接的替代方案，在SBPP中，保护路径必须从备用波长通道动态组装。[A]小型网络的设计结果。Kodian, W. D. Grover(2005)]表明FIPP p-cycle设计可以像SBPP一样有效，但使用[A.]中的ILP设计模型设计更大的网络非常困难。Kodian, W. D. Grover[2005]。我们现在开发了一种新的ILP模型和一种相关的启发式方法，用于FIPP p周期设计，从而产生运行时间更快的网络设计。结果表明，启发式生成的FIPP p循环设计的总容量成本在优化设计的SBPP解决方案的10-18%以内。
{"title":"A disjoint route-sets approach to design of path-protecting p-cycle networks","authors":"A. Kodian, W. Grover, J. Doucette","doi":"10.1109/DRCN.2005.1563871","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563871","url":null,"abstract":"Recent work has proposed the concept of failure-independent path-protecting (FIPP) p-cycles as a pre-connected, failure independent, path-protecting network architecture [A. Kodian, W. D. Grover (2005)]. FIPP p-cycles extend p-cycles by adding the property, like shared backup path protection (SBPP), of providing end-to-end failure independent path switching against either span or node failures. Especially in a transparent or translucent optical network, the property of pre-cross-connection of protection paths can be even more important than just increasing restoration-speed: when optical protection paths are pre-cross-connected, they can be guaranteed in advance to work when required. FIPP p-cycles therefore offer a fully pre-connected, alternative to SBPP in which protection paths must be assembled on the fly from spare wavelength channels. Design results from small networks in [A. Kodian, W. D. Grover (2005)] showed that FIPP p-cycle designs can be as efficient as SBPP but it is very difficult to design larger networks using the ILP design model in [A. Kodian, W. D. Grover (2005)]. We now develop a new ILP model and a related heuristic method for FIPP p-cycle design that produces network designs with much faster runtimes. Results indicate that the heuristic generates FIPP p-cycle designs that have total capacity costs within 10-18% of optimally designed SBPP solutions.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129995029","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 : 2005-12-27DOI: 10.1109/DRCN.2005.1563878
M. Menth, Rüdiger Martin
In this paper we propose the use of multi-topology (MT) routing for network resilience against link and node failures. We describe the multi-topologies by an n-dimensional vector of different link costs for all links in the network. It is the base for the calculation of n shortest path trees from any node to all other destinations, i.e. for n virtual routing topologies. We define the link costs in such a way that the routing topologies complement each other in the sense that at least one valid route remains in a single link or node failure scenario for each pair of nodes in at least one routing topology. In such a failure case, packets are rather deviated over the intact routing topology than discarded. The recovery speed of the presented mechanism is very fast and can be compared to fast rerouting mechanisms in MPLS, which reduce packet drops to a minimum. In contrast to MPLS, MT routing is still a pure IP-based solution that retains the scalability and the robustness of IP routing.
{"title":"Network resilience through multi-topology routing","authors":"M. Menth, Rüdiger Martin","doi":"10.1109/DRCN.2005.1563878","DOIUrl":"https://doi.org/10.1109/DRCN.2005.1563878","url":null,"abstract":"In this paper we propose the use of multi-topology (MT) routing for network resilience against link and node failures. We describe the multi-topologies by an n-dimensional vector of different link costs for all links in the network. It is the base for the calculation of n shortest path trees from any node to all other destinations, i.e. for n virtual routing topologies. We define the link costs in such a way that the routing topologies complement each other in the sense that at least one valid route remains in a single link or node failure scenario for each pair of nodes in at least one routing topology. In such a failure case, packets are rather deviated over the intact routing topology than discarded. The recovery speed of the presented mechanism is very fast and can be compared to fast rerouting mechanisms in MPLS, which reduce packet drops to a minimum. In contrast to MPLS, MT routing is still a pure IP-based solution that retains the scalability and the robustness of IP routing.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121169594","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
扫码关注我们
求助内容：
应助结果提醒方式：