Pub Date : 2014-12-29DOI: 10.1109/APNOMS.2014.6996548
Jia-Lun Wang, C. Liao, Huang-Tien Lin
In this paper, we propose a new generation of time and frequency transfer system using Global Navigation Satellite System (GNSS) dual frequency receiver for the purpose of both time and frequency synchronization. The system can be used as a timing source, remote time and frequency calibration, and to monitor the characteristic of the telecommunication primary reference clocks (PRC). A series of experiments were conducted to evaluate the performance of the system. The common-view common-clock test was studied for the evaluation of the system noise level. The tests of short-baseline about 20 km between Chunghwa Telecommunication Laboratories (TL) and telecommunication facilities, and long-baseline around 10,000 km between TL and MSL (Measurement Standards Laboratory, New Zealand) were performed. Experimental results indicate that expanded time and frequency uncertainty of the proposed system (with a coverage factor of k=2) are less than 26 ns and 1.1×10-13 (one day averaging), respectively, which can meet ITU-T G.811 standard approximately and requirements for the dominant telecommunication and power system synchronization applications.
{"title":"Time and frequency transfer system for synchronization applications","authors":"Jia-Lun Wang, C. Liao, Huang-Tien Lin","doi":"10.1109/APNOMS.2014.6996548","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996548","url":null,"abstract":"In this paper, we propose a new generation of time and frequency transfer system using Global Navigation Satellite System (GNSS) dual frequency receiver for the purpose of both time and frequency synchronization. The system can be used as a timing source, remote time and frequency calibration, and to monitor the characteristic of the telecommunication primary reference clocks (PRC). A series of experiments were conducted to evaluate the performance of the system. The common-view common-clock test was studied for the evaluation of the system noise level. The tests of short-baseline about 20 km between Chunghwa Telecommunication Laboratories (TL) and telecommunication facilities, and long-baseline around 10,000 km between TL and MSL (Measurement Standards Laboratory, New Zealand) were performed. Experimental results indicate that expanded time and frequency uncertainty of the proposed system (with a coverage factor of k=2) are less than 26 ns and 1.1×10-13 (one day averaging), respectively, which can meet ITU-T G.811 standard approximately and requirements for the dominant telecommunication and power system synchronization applications.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121124582","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 : 2014-12-29DOI: 10.1109/APNOMS.2014.6996597
Jing Lin, Celimuge Wu, S. Ohzahata, Toshihiko Kato
We propose a QoS supporting ad hoc network protocol which employs a hybrid approach utilizing both TDMA and 802.11 DCF. TDMA period provides contention free transmissions for QoS flows, and DCF period is used to provide contention-based access for best effort or low priority flows. TDMA time slots are assigned on admission basis in a distributed manner by utilizing network routing information and considering current assignment situation. In DCF period, frames are transmitted not to disturb the TDMA period. By combing TDMA and 802.11 DCF, the proposed ad hoc network is able to provide an efficient solution for QoS control in ad hoc networks. We use QualNet simulator to evaluate the proposed scheme.
{"title":"A QoS supporting ad hoc network protocol combing admission based TDMA and 802.11 DCF","authors":"Jing Lin, Celimuge Wu, S. Ohzahata, Toshihiko Kato","doi":"10.1109/APNOMS.2014.6996597","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996597","url":null,"abstract":"We propose a QoS supporting ad hoc network protocol which employs a hybrid approach utilizing both TDMA and 802.11 DCF. TDMA period provides contention free transmissions for QoS flows, and DCF period is used to provide contention-based access for best effort or low priority flows. TDMA time slots are assigned on admission basis in a distributed manner by utilizing network routing information and considering current assignment situation. In DCF period, frames are transmitted not to disturb the TDMA period. By combing TDMA and 802.11 DCF, the proposed ad hoc network is able to provide an efficient solution for QoS control in ad hoc networks. We use QualNet simulator to evaluate the proposed scheme.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121385469","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 : 2014-12-23DOI: 10.1109/APNOMS.2014.6996530
Chia-Wei Tseng, Sheue-Ji Chen, Yao-Tsung Yang, Li-Der Chou, C. Shieh, S. Huang
IPv6 is a technology that provides enormous address space and end-to-end communication, features that are required in the context of the device automation integration for future network. The transition to IPv6 holds the future of the internet infrastructure. Software-defined networking (SDN) defines a new concept for computer networks that can separate and provide abstract elements of network devices. IPv6 SDN has the potential to revolutionize the network design, construct and operate networks to achieve more efficient business network agility. In this paper, we will discuss the main architectures of SDN and illustrate how IPv6 can be deployed and integrated in SDN technologies using OpenFlow mechanisms. We will also discuss the IPv6 impact on link performance and deployment scenarios.
{"title":"IPv6 operations and deployment scenarios over SDN","authors":"Chia-Wei Tseng, Sheue-Ji Chen, Yao-Tsung Yang, Li-Der Chou, C. Shieh, S. Huang","doi":"10.1109/APNOMS.2014.6996530","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996530","url":null,"abstract":"IPv6 is a technology that provides enormous address space and end-to-end communication, features that are required in the context of the device automation integration for future network. The transition to IPv6 holds the future of the internet infrastructure. Software-defined networking (SDN) defines a new concept for computer networks that can separate and provide abstract elements of network devices. IPv6 SDN has the potential to revolutionize the network design, construct and operate networks to achieve more efficient business network agility. In this paper, we will discuss the main architectures of SDN and illustrate how IPv6 can be deployed and integrated in SDN technologies using OpenFlow mechanisms. We will also discuss the IPv6 impact on link performance and deployment scenarios.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125025655","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 : 2014-12-23DOI: 10.1109/APNOMS.2014.6996593
Taku Yamazaki, R. Yamamoto, T. Miyoshi, Y. Tanaka
In ad hoc networks, radio interference and terminal' mobility can cause frame losses. When the frame losses occur continuously, general datalink layer protocols regard it as a link failure and then notify it to network layer protocols. In conventional routing protocols, a source terminal initiates route discovery process to recover from the link failures on receiving the notifications even if the source terminal still has a valid route to a destination terminal. However, the route discovery requires a route request flooding and the flooding may consume limited network resources of ad hoc networks and that also degrades transmission efficiency. For solving the problems, several retransmission and relay control methods have been proposed. In these methods, neighbour terminals of a transmission route overhear transmitted frames and retransmit lost frames autonomously by using the overheard frames. However, the conventional retransmission methods have a disadvantage that they degrade the transmission efficiency under bursty frame loss interval. Moreover, conventional relay control methods suffer from a processing overhead and a slow adaptation problem under a sparse frame loss. In this paper, we propose an efficient and lightweight method that neighbour terminals adaptively retransmit lost frames considering a frequency of the losses. Computer simulations clarify the performances and the effectiveness of the proposed method.
{"title":"Autonomous retransmission control with neighbour terminals for ad hoc networks","authors":"Taku Yamazaki, R. Yamamoto, T. Miyoshi, Y. Tanaka","doi":"10.1109/APNOMS.2014.6996593","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996593","url":null,"abstract":"In ad hoc networks, radio interference and terminal' mobility can cause frame losses. When the frame losses occur continuously, general datalink layer protocols regard it as a link failure and then notify it to network layer protocols. In conventional routing protocols, a source terminal initiates route discovery process to recover from the link failures on receiving the notifications even if the source terminal still has a valid route to a destination terminal. However, the route discovery requires a route request flooding and the flooding may consume limited network resources of ad hoc networks and that also degrades transmission efficiency. For solving the problems, several retransmission and relay control methods have been proposed. In these methods, neighbour terminals of a transmission route overhear transmitted frames and retransmit lost frames autonomously by using the overheard frames. However, the conventional retransmission methods have a disadvantage that they degrade the transmission efficiency under bursty frame loss interval. Moreover, conventional relay control methods suffer from a processing overhead and a slow adaptation problem under a sparse frame loss. In this paper, we propose an efficient and lightweight method that neighbour terminals adaptively retransmit lost frames considering a frequency of the losses. Computer simulations clarify the performances and the effectiveness of the proposed method.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123810311","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 : 2014-12-23DOI: 10.1109/APNOMS.2014.6996547
D. Matsubara, S. Okamoto, N. Yamanaka, Tatsuro Takahashi
Information-Centric Networking (ICN) employs communication based on location independent data identifiers (IDs) that enables efficient data dissemination. However, some important challenges still remains in the conventional ICN schemes when they are applied to a highly mobile and distributed environment, such as growth in amount of route information or increased transaction load of name resolution services. To accommodate this, we propose a new ICN scheme where routes are aggregated at aggregation nodes and optimized routes are established during data registration transactions to mitigate the amount of route information, delay, and transaction load. We evaluate the proposed scheme using a nation-wide test bed of 37 intermediate nodes and 336 mobile terminals. We show that the proposed scheme enables efficient data dissemination where the mobile terminals register and retrieve data in widely distributed manner.
{"title":"Evaluation of information-centric networking in mobile and distributed environment using wide-area test bed","authors":"D. Matsubara, S. Okamoto, N. Yamanaka, Tatsuro Takahashi","doi":"10.1109/APNOMS.2014.6996547","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996547","url":null,"abstract":"Information-Centric Networking (ICN) employs communication based on location independent data identifiers (IDs) that enables efficient data dissemination. However, some important challenges still remains in the conventional ICN schemes when they are applied to a highly mobile and distributed environment, such as growth in amount of route information or increased transaction load of name resolution services. To accommodate this, we propose a new ICN scheme where routes are aggregated at aggregation nodes and optimized routes are established during data registration transactions to mitigate the amount of route information, delay, and transaction load. We evaluate the proposed scheme using a nation-wide test bed of 37 intermediate nodes and 336 mobile terminals. We show that the proposed scheme enables efficient data dissemination where the mobile terminals register and retrieve data in widely distributed manner.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126128367","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 : 2014-12-23DOI: 10.1109/APNOMS.2014.6996570
Kenji Kanai, J. Katto, T. Murase
Improving Quality of Service (QoS) in wireless networks is important and necessary for mobile users. We have previously proposed Comfort Route (CR) Navigation, which navigates users to their destinations using high QoS communication areas, such as Wi-Fi APs, rather than the geographical Shortest Route (SR). In this paper, we employ an analytical model to estimate the CR gain in a theoretical manner which assumes that available cellular and Wi-Fi throughputs are uniform within their coverage. The CR gain is computed by using basic parameters, including wireless network bandwidth and transmission time. To validate our model, we compare simulation results and real observation. These results conclude that the CR gain could estimate by using our analytical model.
{"title":"Performance analysis and validation of high QoS route navigation for mobile users","authors":"Kenji Kanai, J. Katto, T. Murase","doi":"10.1109/APNOMS.2014.6996570","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996570","url":null,"abstract":"Improving Quality of Service (QoS) in wireless networks is important and necessary for mobile users. We have previously proposed Comfort Route (CR) Navigation, which navigates users to their destinations using high QoS communication areas, such as Wi-Fi APs, rather than the geographical Shortest Route (SR). In this paper, we employ an analytical model to estimate the CR gain in a theoretical manner which assumes that available cellular and Wi-Fi throughputs are uniform within their coverage. The CR gain is computed by using basic parameters, including wireless network bandwidth and transmission time. To validate our model, we compare simulation results and real observation. These results conclude that the CR gain could estimate by using our analytical model.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121566984","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 : 2014-09-01DOI: 10.1109/APNOMS.2014.6996590
Kento Ikkaku, Yukio Sakaguchi, M. Yamamoto
In wireless multi-hop networks, content servers are generally located outside a wireless multi-hop network and a user accesses these servers through a gateway node. So, content traffic has a tendency to be concentrated at a gateway node, which might cause throughput degradation in a whole wireless multi-hop network. Caching network is one promising way to resolve this technical problem. However, caching network has a limitation of cache availability on a default-path. For wired networks, Breadcrumbs has been proposed as in-network guide for cached contents. In this paper, we evaluate Breadcrumbs in wireless multi-hop networks. Our simulation results show that Breadcrumbs improves total throughput performance of wireless multi-hop networks. And also they surprisingly show that not only popular content throughput but also unpopular content throughput is improved.
{"title":"In-network guide performance in wireless multi-hop cache networks","authors":"Kento Ikkaku, Yukio Sakaguchi, M. Yamamoto","doi":"10.1109/APNOMS.2014.6996590","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996590","url":null,"abstract":"In wireless multi-hop networks, content servers are generally located outside a wireless multi-hop network and a user accesses these servers through a gateway node. So, content traffic has a tendency to be concentrated at a gateway node, which might cause throughput degradation in a whole wireless multi-hop network. Caching network is one promising way to resolve this technical problem. However, caching network has a limitation of cache availability on a default-path. For wired networks, Breadcrumbs has been proposed as in-network guide for cached contents. In this paper, we evaluate Breadcrumbs in wireless multi-hop networks. Our simulation results show that Breadcrumbs improves total throughput performance of wireless multi-hop networks. And also they surprisingly show that not only popular content throughput but also unpopular content throughput is improved.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125185106","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 : 2014-09-01DOI: 10.1109/APNOMS.2014.6996592
Dai Hoang Tran, Tien-Dung Nguyen, E. Huh, C. Hong
In-memory Computing (IMC) is the new trend for enabling high-performance computation and fast data processing. It is currently being used for large enterprises, e-commerce shops who need real-time interactions, low latency responses and instant results. Given the enhancement of the IMC, we apply this new paradigm to the Virtual Desktop Environment (VDE), and look into the performance differences in comparison with traditional VDE. The end results shows positive feedback, but there are trade-offs we need to concern for the In-memory Virtual Desktop Environment.
{"title":"A performance comparison of in-memory Virtual Desktop Environment","authors":"Dai Hoang Tran, Tien-Dung Nguyen, E. Huh, C. Hong","doi":"10.1109/APNOMS.2014.6996592","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996592","url":null,"abstract":"In-memory Computing (IMC) is the new trend for enabling high-performance computation and fast data processing. It is currently being used for large enterprises, e-commerce shops who need real-time interactions, low latency responses and instant results. Given the enhancement of the IMC, we apply this new paradigm to the Virtual Desktop Environment (VDE), and look into the performance differences in comparison with traditional VDE. The end results shows positive feedback, but there are trade-offs we need to concern for the In-memory Virtual Desktop Environment.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"2021 36","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120930270","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 : 2014-09-01DOI: 10.1109/APNOMS.2014.6996555
Zhipeng Gao, Dan-qian Liu, Yang Yang, Jingchen Zheng, Yuwen Hao
MapReduce is an important distributed programming model for large-scale data-parallel applications like web indexing, data mining, and scientific simulation. Hadoop is an open-source implementation of MapReduce and it is often applied to short jobs for which low response time is critical. When the cluster nodes are homogeneous, Hadoop has a good performance. In practice, the homogeneity assumptions do not always hold. In heterogeneous environment, there are various devices which vary greatly in the capacities of computation, communication, architectures, memories and power. When different nodes process the same amount of data, load balancing problem occurs. In this paper we address the problem of how to assign data after Map phase to balance the execution time of each Reduce task by proposing a novel load balancing algorithm based on nodes performance (LBNP), in which the input data of poor performance nodes are decreased. Simulation results indicate that all the Reduce tasks can be completed in the same time which shortens the whole Reduce phase. Thus the efficiency of MapReduce is improved.
{"title":"A load balance algorithm based on nodes performance in Hadoop cluster","authors":"Zhipeng Gao, Dan-qian Liu, Yang Yang, Jingchen Zheng, Yuwen Hao","doi":"10.1109/APNOMS.2014.6996555","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996555","url":null,"abstract":"MapReduce is an important distributed programming model for large-scale data-parallel applications like web indexing, data mining, and scientific simulation. Hadoop is an open-source implementation of MapReduce and it is often applied to short jobs for which low response time is critical. When the cluster nodes are homogeneous, Hadoop has a good performance. In practice, the homogeneity assumptions do not always hold. In heterogeneous environment, there are various devices which vary greatly in the capacities of computation, communication, architectures, memories and power. When different nodes process the same amount of data, load balancing problem occurs. In this paper we address the problem of how to assign data after Map phase to balance the execution time of each Reduce task by proposing a novel load balancing algorithm based on nodes performance (LBNP), in which the input data of poor performance nodes are decreased. Simulation results indicate that all the Reduce tasks can be completed in the same time which shortens the whole Reduce phase. Thus the efficiency of MapReduce is improved.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114729738","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 : 2014-09-01DOI: 10.1109/APNOMS.2014.6996103
Jieun Lee, Byoungkwon Shim
Packet-Optical Transport Network (POTN) technologies and architectures integrate the functional switching capability of WDM wavelengths, Ethernet via various protocols, OTN/ODU as well as TDM. From a telecommunication service provider's view, it is a great advantage to replace various multiple-layer network equipment with the unified equipment using POTN technologies. On the other hand, it is a drawback to increase the complexity to operate highly-integrated equipment and to manage the network fluently. In this paper, we investigate considerations for dimensioning POTN and then we design the POTN Dimensioning System to reduce our operation and configuration complexities. Finally we suggest the result of network capacity in POTN through a test network dimensioning.
{"title":"Network dimensioning methodology in packet-optical transport network","authors":"Jieun Lee, Byoungkwon Shim","doi":"10.1109/APNOMS.2014.6996103","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996103","url":null,"abstract":"Packet-Optical Transport Network (POTN) technologies and architectures integrate the functional switching capability of WDM wavelengths, Ethernet via various protocols, OTN/ODU as well as TDM. From a telecommunication service provider's view, it is a great advantage to replace various multiple-layer network equipment with the unified equipment using POTN technologies. On the other hand, it is a drawback to increase the complexity to operate highly-integrated equipment and to manage the network fluently. In this paper, we investigate considerations for dimensioning POTN and then we design the POTN Dimensioning System to reduce our operation and configuration complexities. Finally we suggest the result of network capacity in POTN through a test network dimensioning.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127997059","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
扫码关注我们
求助内容：
应助结果提醒方式：