Pub Date : 2002-11-07DOI: 10.1109/HPSR.2002.1024200
C. Boworntummarat, P. Thanakomsakorn, W. Tirasirikul, L. Wuttisittikulkij, S. Segkhoonthod
This paper presents a comprehensive investigation of a wide range of protection strategies against all single link failures in all-optical WDM networks based on mesh and multi-ring architectures. In the mesh architecture, three protection strategies, namely, minimal cost, single link basis and disjoint path protection strategies are investigated. In the multi-ring architecture, the distribution and non-distribution traffic multi-ring design strategies are extensively examined. Although, the concepts of mesh and multi-ring designs have previously been perceived to be fundamentally different, in this paper we explain and show that these two architectures can be systematically related and viewed as a unified concept. This new way of looking at the fully survivable network design helps understand clearly the mechanisms and performance of each protection strategy. To minimize the system cost of 100% protection WDM networks, mathematical models based on the integer linear programming (ILP) are derived as the tool for achieving optimal path placement, wavelength assignment and ring selection simultaneously. Apart from the mathematical model, the main contributions of this paper are the analysis and comparison in aspects of the spare capacity requirement and ease of operation and practical feasibility amongst these protection strategies. However, the emphasis is on the multi-ring protection schemes. In addition, the influence of the number of multiplexed wavelengths per fiber to design outcomes and the benefit of having wavelength conversion capability in WDM network environment are also studied.
{"title":"Design and analysis of 100% resilient all-optical WDM networks based on mesh and multi-ring approaches using joint optimization technique","authors":"C. Boworntummarat, P. Thanakomsakorn, W. Tirasirikul, L. Wuttisittikulkij, S. Segkhoonthod","doi":"10.1109/HPSR.2002.1024200","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024200","url":null,"abstract":"This paper presents a comprehensive investigation of a wide range of protection strategies against all single link failures in all-optical WDM networks based on mesh and multi-ring architectures. In the mesh architecture, three protection strategies, namely, minimal cost, single link basis and disjoint path protection strategies are investigated. In the multi-ring architecture, the distribution and non-distribution traffic multi-ring design strategies are extensively examined. Although, the concepts of mesh and multi-ring designs have previously been perceived to be fundamentally different, in this paper we explain and show that these two architectures can be systematically related and viewed as a unified concept. This new way of looking at the fully survivable network design helps understand clearly the mechanisms and performance of each protection strategy. To minimize the system cost of 100% protection WDM networks, mathematical models based on the integer linear programming (ILP) are derived as the tool for achieving optimal path placement, wavelength assignment and ring selection simultaneously. Apart from the mathematical model, the main contributions of this paper are the analysis and comparison in aspects of the spare capacity requirement and ease of operation and practical feasibility amongst these protection strategies. However, the emphasis is on the multi-ring protection schemes. In addition, the influence of the number of multiplexed wavelengths per fiber to design outcomes and the benefit of having wavelength conversion capability in WDM network environment are also studied.","PeriodicalId":180090,"journal":{"name":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132355706","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 : 2002-11-07DOI: 10.1109/HPSR.2002.1024253
T. Suzuki, A. Miura, K. Yoshihara, R. Matsumura, M. Inoue, H. Kawano
As the i-mode service grows in popularity, the i-mode traffic carried by the Personal Digital Cellular-Packet (PDC-P) mobile communication network is increasing rapidly. To meet this growing demand, the switching systems currently in place are being either increased in capacity or replaced by more powerful ones. To plan this effectively, it is necessary to make an accurate evaluation of the i-mode processing capacity. We have developed a new method of evaluating processing capacity using a formula for estimating the CPU occupancy by regression analysis, which takes account of the characteristics specific to the PDC-P network. The formula is to be applied to the commercial environment. It is important to maintain the accuracy of the evaluation above a certain level even when the traffic pattern changes greatly as a result of the future introduction of diverse services. This paper discusses the method of evaluating the processing capacity of switching systems used in the PDC-Packet mobile network. The discussion includes how to deal with differences between the CPU occupancy calculated using this technique and the actual CPU occupancy measured on a commercial switching system.
随着i-mode业务的日益普及，pc - p (Personal Digital cellular packet)移动通信网承载的i-mode业务量迅速增长。为了满足这种不断增长的需求，现有的交换系统要么增加容量，要么被更强大的系统取代。为了有效地进行规划，有必要对i-mode处理能力进行准确的评估。我们开发了一种利用回归分析估算CPU占用的公式来评估处理能力的新方法，该方法考虑了PDC-P网络的特定特征。这个公式将适用于商业环境。即使在未来引入各种服务导致流量模式发生巨大变化的情况下，保持评估的准确性在一定水平以上也是很重要的。本文讨论了PDC-Packet移动网络中交换系统处理能力的评估方法。讨论包括如何处理使用该技术计算的CPU占用率与在商业交换系统上测量的实际CPU占用率之间的差异。
{"title":"Evaluation of the performance of the mobile packet communications network","authors":"T. Suzuki, A. Miura, K. Yoshihara, R. Matsumura, M. Inoue, H. Kawano","doi":"10.1109/HPSR.2002.1024253","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024253","url":null,"abstract":"As the i-mode service grows in popularity, the i-mode traffic carried by the Personal Digital Cellular-Packet (PDC-P) mobile communication network is increasing rapidly. To meet this growing demand, the switching systems currently in place are being either increased in capacity or replaced by more powerful ones. To plan this effectively, it is necessary to make an accurate evaluation of the i-mode processing capacity. We have developed a new method of evaluating processing capacity using a formula for estimating the CPU occupancy by regression analysis, which takes account of the characteristics specific to the PDC-P network. The formula is to be applied to the commercial environment. It is important to maintain the accuracy of the evaluation above a certain level even when the traffic pattern changes greatly as a result of the future introduction of diverse services. This paper discusses the method of evaluating the processing capacity of switching systems used in the PDC-Packet mobile network. The discussion includes how to deal with differences between the CPU occupancy calculated using this technique and the actual CPU occupancy measured on a commercial switching system.","PeriodicalId":180090,"journal":{"name":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130606819","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 : 2002-11-07DOI: 10.1109/HPSR.2002.1024243
Kang Xi, N. Ge, C. Feng
A high-performance multicast solution is proposed for a shared memory packet switch. In this solution, multicast packets are organized in a single queue and the switching information of the first K packets is processed by a multicast preprocessing arbiter (MPA) to determine the transmission data of each output port. The solution yields high throughput since head-of-line (HOL) blocking can be resolved with a moderate arbiter stage K. Besides, the arbiter also enables packet dropping from the head of the queue in the case of memory overflow, which can eliminate port starvation especially in the case of imbalanced load. This solution can greatly improve multicast throughput without introducing speed and capacity bottlenecks of address memory. The solution can be implemented with moderate complexity. Performance improvement was verified by simulation under balanced and imbalanced load, respectively.
{"title":"High throughput multicast solution for shared memory packet switch","authors":"Kang Xi, N. Ge, C. Feng","doi":"10.1109/HPSR.2002.1024243","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024243","url":null,"abstract":"A high-performance multicast solution is proposed for a shared memory packet switch. In this solution, multicast packets are organized in a single queue and the switching information of the first K packets is processed by a multicast preprocessing arbiter (MPA) to determine the transmission data of each output port. The solution yields high throughput since head-of-line (HOL) blocking can be resolved with a moderate arbiter stage K. Besides, the arbiter also enables packet dropping from the head of the queue in the case of memory overflow, which can eliminate port starvation especially in the case of imbalanced load. This solution can greatly improve multicast throughput without introducing speed and capacity bottlenecks of address memory. The solution can be implemented with moderate complexity. Performance improvement was verified by simulation under balanced and imbalanced load, respectively.","PeriodicalId":180090,"journal":{"name":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121838845","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 : 2002-11-07DOI: 10.1109/HPSR.2002.1024208
Myongsu Choe, J. Wybenga, B. Kang, A. Boukerche
In this paper, we present an efficient routing coordination based protocol which makes use of a scalable high-performance router based upon a cluster of autonomous routers to handle the routing problems raised by the current Internet growth. We also discuss a novel proprietary protocol, which we refer to as Galaxy/spl trade/ Loosely-coupled Unified Environment (or GLUE). This protocol is based upon the idea of the open shortest path first (OSPF) routing protocol. It helps the autonomous routers to maintain a consistent routing table, and monitors the status of each router using an efficient message exchange mechanism.
{"title":"A routing coordination protocol in a loosely-coupled massively parallel router","authors":"Myongsu Choe, J. Wybenga, B. Kang, A. Boukerche","doi":"10.1109/HPSR.2002.1024208","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024208","url":null,"abstract":"In this paper, we present an efficient routing coordination based protocol which makes use of a scalable high-performance router based upon a cluster of autonomous routers to handle the routing problems raised by the current Internet growth. We also discuss a novel proprietary protocol, which we refer to as Galaxy/spl trade/ Loosely-coupled Unified Environment (or GLUE). This protocol is based upon the idea of the open shortest path first (OSPF) routing protocol. It helps the autonomous routers to maintain a consistent routing table, and monitors the status of each router using an efficient message exchange mechanism.","PeriodicalId":180090,"journal":{"name":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121376118","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 : 2002-11-07DOI: 10.1109/HPSR.2002.1024240
K. Chandrayana, B. Sikdar, S. Kalyanaraman
Current TCP implementations employ additive increase multiplicative decrease (AIMD) as the congestion control mechanism. Previously, a new set of schemes called binomial congestion control schemes (BCCS) were proposed and a section of these schemes is TCP compliant. In this paper we evaluate the performance of these TCP compliant binomial schemes and show through simulations that AIMD performs better than the other BCCS policies in a wide range networking environments. Specifically, we study the performance of these schemes with respect to throughput, fairness, losses, timeouts and self-similarity. We show that the superior performance of AIMD can be attributed to its more conservative attitude in the presence of losses when it reduces its transmission rate much faster than the other schemes. This results in smaller congestion periods thereby reducing the losses and timeouts which in turn increases the throughput and decreases the degree of self-similarity of the traffic. We also evaluated the performance of TCP Compatible BCCS when they compete with TCP flows. It was found that with sufficiently large number of flows, BCCS competes fairly with TCP. However, with a smaller number of flows in the network TCP flows get a smaller share of the bottleneck and disproportionately higher losses and timeouts.
{"title":"Comparative study of TCP compatible binomial congestion control schemes","authors":"K. Chandrayana, B. Sikdar, S. Kalyanaraman","doi":"10.1109/HPSR.2002.1024240","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024240","url":null,"abstract":"Current TCP implementations employ additive increase multiplicative decrease (AIMD) as the congestion control mechanism. Previously, a new set of schemes called binomial congestion control schemes (BCCS) were proposed and a section of these schemes is TCP compliant. In this paper we evaluate the performance of these TCP compliant binomial schemes and show through simulations that AIMD performs better than the other BCCS policies in a wide range networking environments. Specifically, we study the performance of these schemes with respect to throughput, fairness, losses, timeouts and self-similarity. We show that the superior performance of AIMD can be attributed to its more conservative attitude in the presence of losses when it reduces its transmission rate much faster than the other schemes. This results in smaller congestion periods thereby reducing the losses and timeouts which in turn increases the throughput and decreases the degree of self-similarity of the traffic. We also evaluated the performance of TCP Compatible BCCS when they compete with TCP flows. It was found that with sufficiently large number of flows, BCCS competes fairly with TCP. However, with a smaller number of flows in the network TCP flows get a smaller share of the bottleneck and disproportionately higher losses and timeouts.","PeriodicalId":180090,"journal":{"name":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132577269","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 : 2002-11-07DOI: 10.1109/HPSR.2002.1024203
S. Okamoto, K. Shimano, A. Sahara
A photonic multiprotocol label switching (MPLS) router was developed to integrate IP/MPLS router functions and MP/spl lambda/S switching function. The developed system achieved a distributed optical path set-up/tear-down protocol with an extended CR-LDP protocol. Fast self-healing through automatic protection switching and a new restoration scheme were also realized. These functions were successfully implemented and the performance was verified on a demonstration network. Less than 20 ms was achieved in the protection switching scheme, less than 500 ms was achieved in the optical path restoration scheme. The performance is sufficiently quick for fast recovery in IP over photonic networks.
{"title":"Development of the photonic MPLS router to integrate optical and IP networks","authors":"S. Okamoto, K. Shimano, A. Sahara","doi":"10.1109/HPSR.2002.1024203","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024203","url":null,"abstract":"A photonic multiprotocol label switching (MPLS) router was developed to integrate IP/MPLS router functions and MP/spl lambda/S switching function. The developed system achieved a distributed optical path set-up/tear-down protocol with an extended CR-LDP protocol. Fast self-healing through automatic protection switching and a new restoration scheme were also realized. These functions were successfully implemented and the performance was verified on a demonstration network. Less than 20 ms was achieved in the protection switching scheme, less than 500 ms was achieved in the optical path restoration scheme. The performance is sufficiently quick for fast recovery in IP over photonic networks.","PeriodicalId":180090,"journal":{"name":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131256393","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 : 2002-11-07DOI: 10.1109/HPSR.2002.1024210
R. Manivasakan, M. Hamdi, D. Tsang
Virtual output queueing (VoQ) in conjunction with matching algorithms have been proposed to overcome the HOL problem in input queued (IQ) high-speed switches. The dual round-robin matching (DRRM) scheme, has been shown to achieve good performance while being easy to build to high-speed and scalable switches. In this paper, we present a variant and improved version of the DRRM scheme, termed the pseudo-grant dual round-robin matching (PDRRM) algorithm. The PDRRM gives a pseudo-grant to a needy input to increase the number of matches per time slot. We have evaluated the PDRRM using extensive simulations. Our results demonstrate that using the "pseudo-grant" concept results in significant improvement in the performance of DRRM under different networking scenarios. In addition, PDRRM is conjectured to achieve an asymptotic 100% throughput for any arrival pattern.
{"title":"The dual round robin pseudo-grant matching for high-speed packet switches","authors":"R. Manivasakan, M. Hamdi, D. Tsang","doi":"10.1109/HPSR.2002.1024210","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024210","url":null,"abstract":"Virtual output queueing (VoQ) in conjunction with matching algorithms have been proposed to overcome the HOL problem in input queued (IQ) high-speed switches. The dual round-robin matching (DRRM) scheme, has been shown to achieve good performance while being easy to build to high-speed and scalable switches. In this paper, we present a variant and improved version of the DRRM scheme, termed the pseudo-grant dual round-robin matching (PDRRM) algorithm. The PDRRM gives a pseudo-grant to a needy input to increase the number of matches per time slot. We have evaluated the PDRRM using extensive simulations. Our results demonstrate that using the \"pseudo-grant\" concept results in significant improvement in the performance of DRRM under different networking scenarios. In addition, PDRRM is conjectured to achieve an asymptotic 100% throughput for any arrival pattern.","PeriodicalId":180090,"journal":{"name":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126796338","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 : 2002-11-07DOI: 10.1109/HPSR.2002.1024226
Bin Pang, Huai-Rong Shao, Wenwu Zhu, Wen Gao
This paper presents an edge-based admission control scheme for Differentiated Services (DiffServ) networks. In our scheme, admission control decisions are performed at the edge routers according to the core router's available resource information obtained by sending probing packets along the selected routing path. The scheme consists of four elements: (1) local measurement, (2) available bandwidth estimation based on the second moment property of the aggregate traffic and QoS constraints, (3) admission control decisions, and (4) a stateless resource probing protocol to collect the network status. The experimental results show that the proposed scheme can effectively improve the utilization of network resources and provide QoS guarantees for an aggregate.
{"title":"An edge-based admission control for differentiated services network","authors":"Bin Pang, Huai-Rong Shao, Wenwu Zhu, Wen Gao","doi":"10.1109/HPSR.2002.1024226","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024226","url":null,"abstract":"This paper presents an edge-based admission control scheme for Differentiated Services (DiffServ) networks. In our scheme, admission control decisions are performed at the edge routers according to the core router's available resource information obtained by sending probing packets along the selected routing path. The scheme consists of four elements: (1) local measurement, (2) available bandwidth estimation based on the second moment property of the aggregate traffic and QoS constraints, (3) admission control decisions, and (4) a stateless resource probing protocol to collect the network status. The experimental results show that the proposed scheme can effectively improve the utilization of network resources and provide QoS guarantees for an aggregate.","PeriodicalId":180090,"journal":{"name":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122998836","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 : 2002-11-07DOI: 10.1109/HPSR.2002.1024239
Y. Hamaoka, J. Murayama, K. Matsuda
This paper proposes and evaluates an optimized feedback design for a backpressure-based fairness control scheme in best-effort networks. UDP applications can continuously waste shared bandwidth on undeliverable packets that are dropped in the networks before reaching the receiving end hosts. Undeliverable packets of heavily loaded receivers cause unfairness when they block deliverable packets of other receivers in the networks. The scheme can prevent the unfairness by detecting undeliverable packets at egress boundary nodes of the network, and by regulating subsequent ones at ingress boundary nodes through backpressure signals sent from egress to ingress boundary nodes. In order to minimize the number of feedback packets that contain the backpressure signals, this paper proposes a scalable backpressure scheme, in which feedback packets are sent only for undeliverable packets detected at a regular interval. Increasing the detection interval reduces the number of feedback packets, but also reduces the effectiveness of the fairness control since it weakens regulation on heavily loaded receivers. This paper also proposes an optimized design of the detection interval that can minimize the number of feedback packets while keeping fairness. Simulation results show that the proposed design achieves the expected optimization.
{"title":"Optimized feedback design for backpressure-based fairness control","authors":"Y. Hamaoka, J. Murayama, K. Matsuda","doi":"10.1109/HPSR.2002.1024239","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024239","url":null,"abstract":"This paper proposes and evaluates an optimized feedback design for a backpressure-based fairness control scheme in best-effort networks. UDP applications can continuously waste shared bandwidth on undeliverable packets that are dropped in the networks before reaching the receiving end hosts. Undeliverable packets of heavily loaded receivers cause unfairness when they block deliverable packets of other receivers in the networks. The scheme can prevent the unfairness by detecting undeliverable packets at egress boundary nodes of the network, and by regulating subsequent ones at ingress boundary nodes through backpressure signals sent from egress to ingress boundary nodes. In order to minimize the number of feedback packets that contain the backpressure signals, this paper proposes a scalable backpressure scheme, in which feedback packets are sent only for undeliverable packets detected at a regular interval. Increasing the detection interval reduces the number of feedback packets, but also reduces the effectiveness of the fairness control since it weakens regulation on heavily loaded receivers. This paper also proposes an optimized design of the detection interval that can minimize the number of feedback packets while keeping fairness. Simulation results show that the proposed design achieves the expected optimization.","PeriodicalId":180090,"journal":{"name":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122826406","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 : 2002-11-07DOI: 10.1109/HPSR.2002.1024222
S. Yamano, T. Okabe, Y. Oshima, K. Sato, T. Kanoh, S. Takeuchi, C. Onuma, T. Yagyu
The ubiquitous network is, in a sense, the ultimate goal of communication services. As the desire for ubiquitous network becomes increasingly clear, network service providers are anticipated to develop a high performance network infrastructure for providing larger capacity and more flexible communication services. If such a communication infrastructure can be constructed inexpensively while retaining scalability, it should present a new business opportunity for network service providers. This paper presents a new network infrastructure that merges optics with IP, and then studies how to realize the infrastructure and what the component technologies are. In addition, this paper takes a look at the network elements that comprise an optical-IP merged network and services.
{"title":"High performance network with merged optical and IP","authors":"S. Yamano, T. Okabe, Y. Oshima, K. Sato, T. Kanoh, S. Takeuchi, C. Onuma, T. Yagyu","doi":"10.1109/HPSR.2002.1024222","DOIUrl":"https://doi.org/10.1109/HPSR.2002.1024222","url":null,"abstract":"The ubiquitous network is, in a sense, the ultimate goal of communication services. As the desire for ubiquitous network becomes increasingly clear, network service providers are anticipated to develop a high performance network infrastructure for providing larger capacity and more flexible communication services. If such a communication infrastructure can be constructed inexpensively while retaining scalability, it should present a new business opportunity for network service providers. This paper presents a new network infrastructure that merges optics with IP, and then studies how to realize the infrastructure and what the component technologies are. In addition, this paper takes a look at the network elements that comprise an optical-IP merged network and services.","PeriodicalId":180090,"journal":{"name":"Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128921443","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
扫码关注我们
求助内容：
应助结果提醒方式：