Pub Date : 2014-12-29DOI: 10.1109/APNOMS.2014.6996527
Younsun Ahn, Jieun Choi, Sol Jeong, Yoonhee Kim
Scientists can ease to conduct large-scale scientific computational experiments over cloud environment according to an appearance of Science Clouds. Cloud computing enables applications to apply on-demand and scalable resources dynamically. It is necessary for Many Task Computing (MTC) to offer high performance resources in a long phase and certificate stable executions of applications even dramatic changes of vital status of physical resources. Auto-scaling on virtual machines provides integrated and efficient utilization of cloud resources. VM Auto-scaling schemes have been actively studied as effective resource management in order to utilize large-scale data center in a good shape. However, most of the existing auto-scaling methods just simply support CPU utilization and data transfer latency. It is needed to consider execution deadline or characteristics of an application. We propose an auto-scaling method, guaranteeing the execution of an application within deadline. It can handle two types of job patterns; Bag-of-Tasks jobs or workflow jobs. We simulate a variable index computation application in hybrid cloud environment. The results of the simulation show the method can dynamically allocate resources considering deadline.
{"title":"Auto-scaling method in hybrid cloud for scientific applications","authors":"Younsun Ahn, Jieun Choi, Sol Jeong, Yoonhee Kim","doi":"10.1109/APNOMS.2014.6996527","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996527","url":null,"abstract":"Scientists can ease to conduct large-scale scientific computational experiments over cloud environment according to an appearance of Science Clouds. Cloud computing enables applications to apply on-demand and scalable resources dynamically. It is necessary for Many Task Computing (MTC) to offer high performance resources in a long phase and certificate stable executions of applications even dramatic changes of vital status of physical resources. Auto-scaling on virtual machines provides integrated and efficient utilization of cloud resources. VM Auto-scaling schemes have been actively studied as effective resource management in order to utilize large-scale data center in a good shape. However, most of the existing auto-scaling methods just simply support CPU utilization and data transfer latency. It is needed to consider execution deadline or characteristics of an application. We propose an auto-scaling method, guaranteeing the execution of an application within deadline. It can handle two types of job patterns; Bag-of-Tasks jobs or workflow jobs. We simulate a variable index computation application in hybrid cloud environment. The results of the simulation show the method can dynamically allocate resources considering deadline.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"26 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":"121213452","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}
Growing real-time services require discovering transient customer needs in CDRs. In this paper, we propose a CDR analytics system architecture for event-based analytics processing in real time. This system is expected to allow marketing staff to inject analytics-based rules to trigger marketing campaigns. We also propose two implementations which are based on off-the-shelf computing tools.
{"title":"Building a CDR analytics platform for real-time services","authors":"Chia-Chun Shih, Chi-Chang Huang, Bo-Ting Lin, Chao-Wen Huang, Wan-Hsun Hu, Chien-Wei Cheng","doi":"10.1109/APNOMS.2014.6996538","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996538","url":null,"abstract":"Growing real-time services require discovering transient customer needs in CDRs. In this paper, we propose a CDR analytics system architecture for event-based analytics processing in real time. This system is expected to allow marketing staff to inject analytics-based rules to trigger marketing campaigns. We also propose two implementations which are based on off-the-shelf computing tools.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"131 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":"127039770","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.6996577
In Lee
The traffic information is a big data comes from varying sources, such as, social sites, mobile phone GPS signals and so on. The Hadoop and HBase can store and analyze real-time collision data in a distributed processing framework. This framework can be designed as flexible and scalable framework using distributed CEP that process massive real-time traffic data and ESB that integrates other services. In this paper, we propose a new architecture for distributed processing that enables big data processing on the road traffic data and its related information analysis. We tested the proposed framework on road traffic data on 400km from Seoul to Busan freeway section in Korea. By integrating freeway traffic big data and collision data over a seven-year period (1TB Size), we obtained the collision probability data.
{"title":"Big data processing framework of road traffic collision using distributed CEP","authors":"In Lee","doi":"10.1109/APNOMS.2014.6996577","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996577","url":null,"abstract":"The traffic information is a big data comes from varying sources, such as, social sites, mobile phone GPS signals and so on. The Hadoop and HBase can store and analyze real-time collision data in a distributed processing framework. This framework can be designed as flexible and scalable framework using distributed CEP that process massive real-time traffic data and ESB that integrates other services. In this paper, we propose a new architecture for distributed processing that enables big data processing on the road traffic data and its related information analysis. We tested the proposed framework on road traffic data on 400km from Seoul to Busan freeway section in Korea. By integrating freeway traffic big data and collision data over a seven-year period (1TB Size), we obtained the collision probability data.","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":"125492485","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.6996591
Hyeonwoo Kim, Dongwoo Kwon, Hongtaek Ju
The method of inferring firewall policy, using Active Probing repeats the process of transmitting TCP/UDP/ICMP packets and receiving ICMP response packets. However, if ICMP response packets cannot be received normally, the accuracy of inferring the firewall policy decreases, and it is necessary to verify the feasibility in real conditions. In this paper, we collect Autonomous System (AS) information to investigate the tolerance of ICMP intended for all AS across the world in addition to DNS server information, which is operational within AS. We confirm whether ICMP response packets are received or not by transmitting probing packets to the DNS server. Finally, we propose the AS information that received ICMP packets as the result of the test.
{"title":"Analysis of ICMP policy for edge firewalls using active probing","authors":"Hyeonwoo Kim, Dongwoo Kwon, Hongtaek Ju","doi":"10.1109/APNOMS.2014.6996591","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996591","url":null,"abstract":"The method of inferring firewall policy, using Active Probing repeats the process of transmitting TCP/UDP/ICMP packets and receiving ICMP response packets. However, if ICMP response packets cannot be received normally, the accuracy of inferring the firewall policy decreases, and it is necessary to verify the feasibility in real conditions. In this paper, we collect Autonomous System (AS) information to investigate the tolerance of ICMP intended for all AS across the world in addition to DNS server information, which is operational within AS. We confirm whether ICMP response packets are received or not by transmitting probing packets to the DNS server. Finally, we propose the AS information that received ICMP packets as the result of the test.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"12 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":"124046116","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.6996579
Shota Tajima, T. Asaka, Tatsuro Takahashi
DTN (delay/disruption-tolerant networking) is a network enabling data to be carried end-to-end without continuous connection. DTN uses a store and forward method, in which a node stores the data when no other nodes exist in a communicable range and forwards a copy of the data when they do. Since the buffer has a limited buffering capacity, the data often need to be dropped. When there are data that have different priorities, the high priority data may be pushed out from the buffer by the low priority data. Thus the high priority data arrival rate lowered by pushing data out needs to be increased. In this paper, we propose and evaluate a buffer control system to raise the high priority data arrival rate without decreasing the total arrival rate when the buffer has a limit. The priority control system avoids the high priority data dropping caused by low priority data by choosing the dropped data in reference to the data priority when the new data are sent to the full node. We show that the priority control system increases the high priority data arrival rate and maintains the high priority data drop rate at no more than the desired value.
{"title":"Priority control using multi-buffer for DTN","authors":"Shota Tajima, T. Asaka, Tatsuro Takahashi","doi":"10.1109/APNOMS.2014.6996579","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996579","url":null,"abstract":"DTN (delay/disruption-tolerant networking) is a network enabling data to be carried end-to-end without continuous connection. DTN uses a store and forward method, in which a node stores the data when no other nodes exist in a communicable range and forwards a copy of the data when they do. Since the buffer has a limited buffering capacity, the data often need to be dropped. When there are data that have different priorities, the high priority data may be pushed out from the buffer by the low priority data. Thus the high priority data arrival rate lowered by pushing data out needs to be increased. In this paper, we propose and evaluate a buffer control system to raise the high priority data arrival rate without decreasing the total arrival rate when the buffer has a limit. The priority control system avoids the high priority data dropping caused by low priority data by choosing the dropped data in reference to the data priority when the new data are sent to the full node. We show that the priority control system increases the high priority data arrival rate and maintains the high priority data drop rate at no more than the desired value.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"2 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":"126345974","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}
Email spam is a critical problem to the Internet for a long time. The average amount of spam mail reached 72.1% of all email traffic in the world in 2012. The greatest threat to the email service providers was the spam mail sent from botnet, because the spam mail sent from botnet was accounting for more than 78% in 2011; therefore appeared many anti-spam solutions and techniques that were focus on the botnet. Owing to these anti-spam techniques, botnet spam is not effective as before. Spammers are finding new way to send the spam mail. One of the effective methods is using compromised accounts (or bot accounts) to send the spam mail because compromised accounts have good reputation IP addresses and compromised accounts send the spam mail with complete SMTP implemented server, such as Gmail, Yahoo!Mail, and Microsoft Live Mail. The spam mail send form compromised accounts are very difficult to be detected by any anti-spam techniques. Hence, we focus on the features spammers cannot easily hide. According to our research we find that normal users usually do not reply to the spam mail. Moreover, our empirical analysis reveals that the compromised account actually have low reply rate. We develop a system called “Hawkeye” that can find the compromised accounts effectively by checking the account's reply rate.
{"title":"Hawkeye: Finding spamming accounts","authors":"Chia-Heng Li, Fu-Hau Hsu, Shih-Jen Chen, Chuan-Sheng Wang, Yao-Hsin Chen, Y. Hwang","doi":"10.1109/APNOMS.2014.6996106","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996106","url":null,"abstract":"Email spam is a critical problem to the Internet for a long time. The average amount of spam mail reached 72.1% of all email traffic in the world in 2012. The greatest threat to the email service providers was the spam mail sent from botnet, because the spam mail sent from botnet was accounting for more than 78% in 2011; therefore appeared many anti-spam solutions and techniques that were focus on the botnet. Owing to these anti-spam techniques, botnet spam is not effective as before. Spammers are finding new way to send the spam mail. One of the effective methods is using compromised accounts (or bot accounts) to send the spam mail because compromised accounts have good reputation IP addresses and compromised accounts send the spam mail with complete SMTP implemented server, such as Gmail, Yahoo!Mail, and Microsoft Live Mail. The spam mail send form compromised accounts are very difficult to be detected by any anti-spam techniques. Hence, we focus on the features spammers cannot easily hide. According to our research we find that normal users usually do not reply to the spam mail. Moreover, our empirical analysis reveals that the compromised account actually have low reply rate. We develop a system called “Hawkeye” that can find the compromised accounts effectively by checking the account's reply rate.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"116 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":"128941153","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}
The tremendous bandwidth demand for content-rich services on service providers initiates new access networks deployment and leads the networks increasingly complex and functional. In general, the commercial access networks are composed of a large number heterogeneous, multi-domain, multi-technology and multi-vendor network devices. In such a network environment, the network migration is a challenging task for any service providers. The process of network migration traditionally involved a series of manual and repetitive steps. The manual process of network migration requires highly skilled staffs and is prone to human error. In this paper, we present the integrated and automated provisioning operational supporting systems (OSSs) for in-service network migration. The developed OSSs provide two kinds of in-service network migration mechanisms and support a diversity of network migration scenarios in heterogeneous networks. Finally, the results show that the proposed efficient provisioning mechanism significantly speeds up the network migration and reduces service providers' operational expenditures (OPEX).
{"title":"An efficient provisioning mechanism for in-service migration in access network","authors":"Ya-Shian Wang, Ya-Ping Huang, Chin-Ping Chuang, Mei-Chun Chen, Kuan-Liang Chen, Jia-Wei Gong, Hong-Jie Chen, Hey-Chyi Young, Been-Hwang Liao","doi":"10.1109/APNOMS.2014.6996566","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996566","url":null,"abstract":"The tremendous bandwidth demand for content-rich services on service providers initiates new access networks deployment and leads the networks increasingly complex and functional. In general, the commercial access networks are composed of a large number heterogeneous, multi-domain, multi-technology and multi-vendor network devices. In such a network environment, the network migration is a challenging task for any service providers. The process of network migration traditionally involved a series of manual and repetitive steps. The manual process of network migration requires highly skilled staffs and is prone to human error. In this paper, we present the integrated and automated provisioning operational supporting systems (OSSs) for in-service network migration. The developed OSSs provide two kinds of in-service network migration mechanisms and support a diversity of network migration scenarios in heterogeneous networks. Finally, the results show that the proposed efficient provisioning mechanism significantly speeds up the network migration and reduces service providers' operational expenditures (OPEX).","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"12 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":"134224580","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.6996594
Y. Akiyama, Tomoki Kozu, Saneyasu Yamaguchi
Over current long fat networks, enough throughput cannot be obtained using TCP Reno, which is the classical standard TCP congestion avoidance algorithm. For this reason, many high performance TCPs have been proposed, such as Compound TCP and CUBIC TCP. Then, these proposals have caused a new issue, which is fairness among these modern TCPs. For this issue, several fairness evaluations and some proposals for improving fairness were published. However, most of these evaluations are executed using a network simulator, so fairness with actual network elements and actual TCP implementations has not been discussed enough yet. In this paper, we focus on performance fairness of modern TCPs and discuss methods for improving performance fairness with actual TCP implementations and network elements. First, we present fairness evaluation among modern TCPs and demonstrate that fairness among modern TCPs is very poor. Second, we propose methods for improving performance fairness, which drop packets of bandwidth-consuming connections in a network bridge. Third, we evaluate our proposed methods and show that our methods can improve performance fairness.
{"title":"Active packet dropping for improving performance fairness among modern TCPs","authors":"Y. Akiyama, Tomoki Kozu, Saneyasu Yamaguchi","doi":"10.1109/APNOMS.2014.6996594","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996594","url":null,"abstract":"Over current long fat networks, enough throughput cannot be obtained using TCP Reno, which is the classical standard TCP congestion avoidance algorithm. For this reason, many high performance TCPs have been proposed, such as Compound TCP and CUBIC TCP. Then, these proposals have caused a new issue, which is fairness among these modern TCPs. For this issue, several fairness evaluations and some proposals for improving fairness were published. However, most of these evaluations are executed using a network simulator, so fairness with actual network elements and actual TCP implementations has not been discussed enough yet. In this paper, we focus on performance fairness of modern TCPs and discuss methods for improving performance fairness with actual TCP implementations and network elements. First, we present fairness evaluation among modern TCPs and demonstrate that fairness among modern TCPs is very poor. Second, we propose methods for improving performance fairness, which drop packets of bandwidth-consuming connections in a network bridge. Third, we evaluate our proposed methods and show that our methods can improve performance fairness.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"11 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":"133954712","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}
Because of the advantages of multi-hop communication, self-organizing, self-healing and reliability, wireless mesh network becomes an ideal choice for data collection. However, wireless mesh network for data collection faces challenge on communication performance of network caused by application layer data traffic. When a large number of data occurs in emergence, some mesh nodes (the last hop nodes) which are in pivotal location will face great communication pressure and probably lead to extremely data congestion, especially in smart grid. For the idea of load balancing, this paper proposes a new random switching traffic scheduling algorithm based on data collection tree. Simulation data show that the new algorithm can create a balanced data collection tree, significantly reduce the packet loss ratio of the burst data and release congestion of system.
{"title":"A random switching traffic scheduling algorithm for data collection in wireless mesh network","authors":"Sujie Shao, Shao-Yong Guo, Xue-song Qiu, Luoming Meng, Cheng Zhong","doi":"10.1109/APNOMS.2014.6996531","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996531","url":null,"abstract":"Because of the advantages of multi-hop communication, self-organizing, self-healing and reliability, wireless mesh network becomes an ideal choice for data collection. However, wireless mesh network for data collection faces challenge on communication performance of network caused by application layer data traffic. When a large number of data occurs in emergence, some mesh nodes (the last hop nodes) which are in pivotal location will face great communication pressure and probably lead to extremely data congestion, especially in smart grid. For the idea of load balancing, this paper proposes a new random switching traffic scheduling algorithm based on data collection tree. Simulation data show that the new algorithm can create a balanced data collection tree, significantly reduce the packet loss ratio of the burst data and release congestion of system.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"1 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":"129173406","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.6996599
H. Huang, T. Su, Jo-Ching Wu, Wan-Du Tsai, Y. Tseng, F. Lin, Bo-Ting Lin, Wan-Hsun Hu
Long Term Evolution (LTE) has been widely adopted by many 4G network operators. Many countries in America, Europe, and Asia have started LTE services since 2010. In the meantime, some countries (such as Taiwan and China) are in the process of transferring from 3G or Worldwide Interoperability for Microwave Access (WiMAX) to 4G services. In this paper, we investigate the tariff plans of the nine telecommunications operators which own top-three market shares in Singapore, Japan, and Hong Kong, respectively. Several issues, such as market share, tariff strategy, and even customs are discussed. Also, Tier-pricing strategies of LTE, such as Fair Use Policy (FUP), monthly data allowance, and data overage allowance, are discussed and compared. Moreover, we compare different charging plans and examine their price-performance ratios.
长期演进(Long Term Evolution, LTE)技术已被许多4G网络运营商广泛采用。自2010年以来，美国、欧洲和亚洲的许多国家都开始了LTE服务。与此同时，一些国家(如台湾和中国)正处于从3G或全球微波接入互操作性(WiMAX)向4G服务转移的过程中。本文研究了新加坡、日本和香港市场份额前三的九家电信运营商的资费计划。讨论了市场份额、关税策略甚至关税等几个问题。此外，还讨论并比较了LTE的分层定价策略，如合理使用政策(FUP)、月度数据补贴和数据超限补贴。此外，我们比较了不同的收费方案，并考察了它们的性价比。
{"title":"A comparison of 4G telecommunications tariff plans in Asia countries","authors":"H. Huang, T. Su, Jo-Ching Wu, Wan-Du Tsai, Y. Tseng, F. Lin, Bo-Ting Lin, Wan-Hsun Hu","doi":"10.1109/APNOMS.2014.6996599","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996599","url":null,"abstract":"Long Term Evolution (LTE) has been widely adopted by many 4G network operators. Many countries in America, Europe, and Asia have started LTE services since 2010. In the meantime, some countries (such as Taiwan and China) are in the process of transferring from 3G or Worldwide Interoperability for Microwave Access (WiMAX) to 4G services. In this paper, we investigate the tariff plans of the nine telecommunications operators which own top-three market shares in Singapore, Japan, and Hong Kong, respectively. Several issues, such as market share, tariff strategy, and even customs are discussed. Also, Tier-pricing strategies of LTE, such as Fair Use Policy (FUP), monthly data allowance, and data overage allowance, are discussed and compared. Moreover, we compare different charging plans and examine their price-performance ratios.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"6 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":"115260398","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
扫码关注我们
求助内容：
应助结果提醒方式：