Pub Date : 2012-11-26DOI: 10.1109/APNOMS.2012.6356095
Yuichi Sakuraba
In a network management with huge numbers of nodes, network topology is usually displayed in a manner that sub-network is organized as a group and each group is displayed respectively by itself. However, we can't see nodes in plural groups and connections between them simultaneously in this model. To solve the problem, we proposed a hierarchical layout model that expands groups on demand in the same screen keeping connections between nodes in a previous paper [1]. However, when many groups are expanded, they may not fit within the display area. Therefore, we introduce expanding factor by the interest level for more efficient display of the network in this paper. According to the interest level factor, the groups with high interest level are displayed widely, and the groups with low interest level in displayed narrowly or iconized. We model the interest level mathematically, and discuss the model efficacy.
{"title":"Displaying network topology by hierarchical layout with interest level","authors":"Yuichi Sakuraba","doi":"10.1109/APNOMS.2012.6356095","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356095","url":null,"abstract":"In a network management with huge numbers of nodes, network topology is usually displayed in a manner that sub-network is organized as a group and each group is displayed respectively by itself. However, we can't see nodes in plural groups and connections between them simultaneously in this model. To solve the problem, we proposed a hierarchical layout model that expands groups on demand in the same screen keeping connections between nodes in a previous paper [1]. However, when many groups are expanded, they may not fit within the display area. Therefore, we introduce expanding factor by the interest level for more efficient display of the network in this paper. According to the interest level factor, the groups with high interest level are displayed widely, and the groups with low interest level in displayed narrowly or iconized. We model the interest level mathematically, and discuss the model efficacy.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126027472","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 : 2012-11-26DOI: 10.1109/APNOMS.2012.6356076
Shao-Chen Chang, Min-Huang Ku, Han-Ching Tsao, Teh-Sheng Huang
Because of the unique feature of platform-independent and the advantages of easy-to-develop and easy-to-deploy, Java-based applications are widely adopted by large-scale software-intensive information systems, and the monitoring-related functions in such environments are becoming more and more important. One single Application Server can deploy multiple instances of applications in Java EE environments, but the support of Application Server monitor tools does not evolve as the progress of Application Server itself. This paper will propose a new monitor architecture “Thread-based Monitor System Architecture (TMSA)”, which will exercise Thread-based technologies to detect and analyze the conditions of resource-leakage in Application Server, and proactively quarantine and terminate the potential abnormal resource-leakage processes, in order to increase the stability of the whole system dramatically.
{"title":"An architecture on proactive detecting, quarantining, and terminating resource leakage of Java-based applications","authors":"Shao-Chen Chang, Min-Huang Ku, Han-Ching Tsao, Teh-Sheng Huang","doi":"10.1109/APNOMS.2012.6356076","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356076","url":null,"abstract":"Because of the unique feature of platform-independent and the advantages of easy-to-develop and easy-to-deploy, Java-based applications are widely adopted by large-scale software-intensive information systems, and the monitoring-related functions in such environments are becoming more and more important. One single Application Server can deploy multiple instances of applications in Java EE environments, but the support of Application Server monitor tools does not evolve as the progress of Application Server itself. This paper will propose a new monitor architecture “Thread-based Monitor System Architecture (TMSA)”, which will exercise Thread-based technologies to detect and analyze the conditions of resource-leakage in Application Server, and proactively quarantine and terminate the potential abnormal resource-leakage processes, in order to increase the stability of the whole system dramatically.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134373520","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 : 2012-11-26DOI: 10.1109/APNOMS.2012.6356060
Yongfeng Huang, Jin Xiao, J. W. Hong, A. Mehaoua, R. Boutaba
In managing multimedia services, it is important to understand how network performance affects user experience. The model presented in this paper aims to estimate user perception of video quality based on defect events, which are automatically classified by machine learning techniques. The underlying principle of our model is that human experience is event-based and there is a strong correlation between defective events and user MOS. Through experiments, we show that our model can detect different types of defect events with good accuracy even under small data set, and we find that indeed different defect event types affect user experience with different sensitivity.
{"title":"Event-based estimation of user experience for network video streaming","authors":"Yongfeng Huang, Jin Xiao, J. W. Hong, A. Mehaoua, R. Boutaba","doi":"10.1109/APNOMS.2012.6356060","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356060","url":null,"abstract":"In managing multimedia services, it is important to understand how network performance affects user experience. The model presented in this paper aims to estimate user perception of video quality based on defect events, which are automatically classified by machine learning techniques. The underlying principle of our model is that human experience is event-based and there is a strong correlation between defective events and user MOS. Through experiments, we show that our model can detect different types of defect events with good accuracy even under small data set, and we find that indeed different defect event types affect user experience with different sensitivity.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129589226","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 : 2012-11-26DOI: 10.1109/APNOMS.2012.6356090
Yi-Chang Chen, Jeu-Yih Jeng, Teh-Sheng Huang, P. Lin
Today, Internet services are utilized as major service platforms to provide business services. Web-based Internet applications that follow the multi-tier architecture are a well-accepted computation model when providing Internet services. Such a model suffers from interruption caused by software failures, hardware errors or software maintenance. The interruption may incur significant financial loss to Internet service providers. Thus, Service Continuity is one of the main challenges for Web-based Internet applications. Although several service continuity technologies have been developed, many of them focus on a single tier of the applications and do not guarantee end-to-end service continuity. In this paper, we describe the design, implementation, and performance evaluation of our proposed service continuity technology. This technology resolves the long time interruption problem caused by database schema evolution, handles software components upgrade, and achieves end-to-end Service Continuity. We propose a mechanism that contains multiple modules running interactively between each module. This approach only requires minimal amount of code rewriting and a small storage space. Comparing with existing approaches, our approach is more efficient with the least overhead.
{"title":"Design and implementation of database schema evolution for service continuity of web-based internet applications","authors":"Yi-Chang Chen, Jeu-Yih Jeng, Teh-Sheng Huang, P. Lin","doi":"10.1109/APNOMS.2012.6356090","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356090","url":null,"abstract":"Today, Internet services are utilized as major service platforms to provide business services. Web-based Internet applications that follow the multi-tier architecture are a well-accepted computation model when providing Internet services. Such a model suffers from interruption caused by software failures, hardware errors or software maintenance. The interruption may incur significant financial loss to Internet service providers. Thus, Service Continuity is one of the main challenges for Web-based Internet applications. Although several service continuity technologies have been developed, many of them focus on a single tier of the applications and do not guarantee end-to-end service continuity. In this paper, we describe the design, implementation, and performance evaluation of our proposed service continuity technology. This technology resolves the long time interruption problem caused by database schema evolution, handles software components upgrade, and achieves end-to-end Service Continuity. We propose a mechanism that contains multiple modules running interactively between each module. This approach only requires minimal amount of code rewriting and a small storage space. Comparing with existing approaches, our approach is more efficient with the least overhead.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129912502","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 : 2012-11-26DOI: 10.1109/APNOMS.2012.6356074
Jyh-Shyan Huang, Y. Lien, Chih-Lin Hu
When a catastrophic natural disaster occurs, the efficiency of disaster response operation is crucial to life saving. However, communication systems, such as cellular networks, were usually crashed due to various causes that made coordination difficult for many disorganized disaster response workers extremely. Unfortunately, rapid deployment of many existing emergency communication systems relies on a good transportation system, which is usually not available in a catastrophic natural disaster. We propose an emergency communication system, Contingency Cellular Network (CCN), by connecting disconnected base stations together with wireless links and portable power generators. CCN can support existing mobile phone users with limited capability. Such a system can support a large number of voluntary workers in the early hours of a catastrophic natural disaster, thus saving many lives. Design philosophy and high level system architecture of our framework are presented in this paper.
{"title":"Design of Contingency Cellular Network","authors":"Jyh-Shyan Huang, Y. Lien, Chih-Lin Hu","doi":"10.1109/APNOMS.2012.6356074","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356074","url":null,"abstract":"When a catastrophic natural disaster occurs, the efficiency of disaster response operation is crucial to life saving. However, communication systems, such as cellular networks, were usually crashed due to various causes that made coordination difficult for many disorganized disaster response workers extremely. Unfortunately, rapid deployment of many existing emergency communication systems relies on a good transportation system, which is usually not available in a catastrophic natural disaster. We propose an emergency communication system, Contingency Cellular Network (CCN), by connecting disconnected base stations together with wireless links and portable power generators. CCN can support existing mobile phone users with limited capability. Such a system can support a large number of voluntary workers in the early hours of a catastrophic natural disaster, thus saving many lives. Design philosophy and high level system architecture of our framework are presented in this paper.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134263931","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 : 2012-11-26DOI: 10.1109/APNOMS.2012.6356077
Lu Guan, Y. Wang, Yanfei Li
Reducing the number of active nodes is an natural and effective method in energy saving for large scale cloud datacenters. However, the traditional way of consolidating VMs by migration may lead to the impacts on performance as well as costs on power consumption and migration. In this paper, we propose an algorithm named DRAMDT to deploy VMs to servers without the use of migration, which groups VM instances by their deadline runtimes and pack VMs within the same group on the same servers. It is demonstrated in the experiments that DRAMDT is able to shut down more servers in time to save energy when user amount reduces. And the proposed algorithm has small searching space, low complexity and good scalability.
{"title":"A dynamic resource allocation method in IaaS based on deadline time","authors":"Lu Guan, Y. Wang, Yanfei Li","doi":"10.1109/APNOMS.2012.6356077","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356077","url":null,"abstract":"Reducing the number of active nodes is an natural and effective method in energy saving for large scale cloud datacenters. However, the traditional way of consolidating VMs by migration may lead to the impacts on performance as well as costs on power consumption and migration. In this paper, we propose an algorithm named DRAMDT to deploy VMs to servers without the use of migration, which groups VM instances by their deadline runtimes and pack VMs within the same group on the same servers. It is demonstrated in the experiments that DRAMDT is able to shut down more servers in time to save energy when user amount reduces. And the proposed algorithm has small searching space, low complexity and good scalability.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129179314","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 : 2012-11-26DOI: 10.1109/APNOMS.2012.6356102
Te-Chuan Chiu, Yuan-Yao Shih, Ai-Chun Pang, Jeu-Yih Jeng, P. Hsiu
Wireless charging technology is considered as one of the promising solutions to solve the energy limitation problem for large-scale wireless sensor networks. Obviously, charger deployment is a critical issue since the number of chargers would be limited by the network construction budget, which makes the full-coverage deployment of chargers infeasible. In many of the applications targeted by large-scale wireless sensor networks, end-devices are usually equipped by the human and their movement follows some degree of regularity. Therefore in this paper, we utilize this property to deploy chargers with partial coverage, with an objective to maximize the survival rate of end-devices. We prove this problem is NP-hard, and propose an algorithm to tackle it. The simulation results show that our proposed algorithm can significantly increase the survival rate of end-devices. To our knowledge, this is one of very first works that consider charger deployment with partial coverage in wireless rechargeable sensor networks.
{"title":"Mobility-aware charger deployment for wireless rechargeable sensor networks","authors":"Te-Chuan Chiu, Yuan-Yao Shih, Ai-Chun Pang, Jeu-Yih Jeng, P. Hsiu","doi":"10.1109/APNOMS.2012.6356102","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356102","url":null,"abstract":"Wireless charging technology is considered as one of the promising solutions to solve the energy limitation problem for large-scale wireless sensor networks. Obviously, charger deployment is a critical issue since the number of chargers would be limited by the network construction budget, which makes the full-coverage deployment of chargers infeasible. In many of the applications targeted by large-scale wireless sensor networks, end-devices are usually equipped by the human and their movement follows some degree of regularity. Therefore in this paper, we utilize this property to deploy chargers with partial coverage, with an objective to maximize the survival rate of end-devices. We prove this problem is NP-hard, and propose an algorithm to tackle it. The simulation results show that our proposed algorithm can significantly increase the survival rate of end-devices. To our knowledge, this is one of very first works that consider charger deployment with partial coverage in wireless rechargeable sensor networks.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129346653","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 : 2012-11-26DOI: 10.1109/APNOMS.2012.6356072
Tetsuya Uchiumi, S. Kikuchi, Y. Matsumoto
Since many components comprising large scale cloud datacenters have a great number of configuration parameters (e.g. hostnames, languages, and time zones), it is difficult to keep consistencies in the configuration parameters. In such cases, misconfigured parameters can cause service failures. For this reason, we propose a misconfiguration detection method for large-scale cloud datacenters, which can automatically determine possible misconfigurations by identifying the relations existing among majority of the parameters using statistical decision tree analysis. We have also developed a pattern modification method to improve the accuracy of the decision tree approach. We evaluated the misconfiguration detection performance of the proposed method by using both artificial data and actual data. The results show that we can achieve higher accuracy (78.6% in the actual data) in misconfiguration detection by using the pattern modification.
{"title":"Misconfiguration detection for cloud datacenters using decision tree analysis","authors":"Tetsuya Uchiumi, S. Kikuchi, Y. Matsumoto","doi":"10.1109/APNOMS.2012.6356072","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356072","url":null,"abstract":"Since many components comprising large scale cloud datacenters have a great number of configuration parameters (e.g. hostnames, languages, and time zones), it is difficult to keep consistencies in the configuration parameters. In such cases, misconfigured parameters can cause service failures. For this reason, we propose a misconfiguration detection method for large-scale cloud datacenters, which can automatically determine possible misconfigurations by identifying the relations existing among majority of the parameters using statistical decision tree analysis. We have also developed a pattern modification method to improve the accuracy of the decision tree approach. We evaluated the misconfiguration detection performance of the proposed method by using both artificial data and actual data. The results show that we can achieve higher accuracy (78.6% in the actual data) in misconfiguration detection by using the pattern modification.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114240507","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 : 2012-11-26DOI: 10.1109/APNOMS.2012.6356073
Xun Shao, G. Hasegawa, Y. Taniguchi, H. Nakano
Multihoming is widely used by Internet service providers (ISPs) to obtain improved performance and reliability when connecting to the Internet. Recently, the use of overlay routing for network application traffic is rapidly increasing. As a source of both routing oscillation and cost increases, overlay routing is known to bring challenges to ISPs. In this paper, we study the interaction between overlay routing and a multihomed ISP's routing strategy with a Nash game model, and propose a routing strategy for the multihomed ISP to alleviate the negative impact of overlay traffic.We prove that with the proposed routing strategy, the network routing game can always converge to a stable state, and the ISP can reduce costs to a relatively low level. From numerical simulations, we show the efficiency and convergence resulting from the proposed routing strategy. We also discuss the conditions under which the multihomed ISP can realize minimum cost by the proposed strategy.
{"title":"A game-theoretic analysis of interaction between overlay routing and multihoming","authors":"Xun Shao, G. Hasegawa, Y. Taniguchi, H. Nakano","doi":"10.1109/APNOMS.2012.6356073","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356073","url":null,"abstract":"Multihoming is widely used by Internet service providers (ISPs) to obtain improved performance and reliability when connecting to the Internet. Recently, the use of overlay routing for network application traffic is rapidly increasing. As a source of both routing oscillation and cost increases, overlay routing is known to bring challenges to ISPs. In this paper, we study the interaction between overlay routing and a multihomed ISP's routing strategy with a Nash game model, and propose a routing strategy for the multihomed ISP to alleviate the negative impact of overlay traffic.We prove that with the proposed routing strategy, the network routing game can always converge to a stable state, and the ISP can reduce costs to a relatively low level. From numerical simulations, we show the efficiency and convergence resulting from the proposed routing strategy. We also discuss the conditions under which the multihomed ISP can realize minimum cost by the proposed strategy.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133481122","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 : 2012-11-26DOI: 10.1109/APNOMS.2012.6356058
Wunbae Jeon, H. Chong, Han-Wook Jung
M2M (Machine to machine) service has been designed to provide the customer with remote monitoring and control for various sensors and controllers. M2M platform is composed of a bunch of the software and devices equipped with network connectivity providing data manipulation and exchange among devices and applications. It is also required to be equipped with data management and analysis functions independent of the specific services. In this paper, it is proposed a highly scalable and flexible data exchange protocol, named UM3, which is independent to industry and products. The proposed UM3 data exchange protocols with data model and its encoding rules have strong interoperability to the various M2M related industry standards. UM3 data model based on ITU-T ASN.1 specification language has the capability of representing a time varying unstructured data format. The binary encoding rule of UM3 uses T-NL-N-L-V PDU format. It uses character string instead of numerical tag values as its attribute identifier. UM3 encoding rule provides XML and JSON encoding schemes as its text-based encoding methods. The merits of binary and text based encoding rules are more self-descriptive compared to numerical values based BER, XER and BACnet, etc. By the proposed in this paper self-descriptive capability and compatibility to the other industry protocols, integration of various M2M devices with different industry M2M platforms shall be more easer and expandable by modular way resulting general purpose M2M services. Finally, the pros and cons by character string based data exchange protocol and the future directions of M2M platform for different type of sensors and industry would be discussed and suggested.
{"title":"UM3 data exchange model and encoding rules","authors":"Wunbae Jeon, H. Chong, Han-Wook Jung","doi":"10.1109/APNOMS.2012.6356058","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356058","url":null,"abstract":"M2M (Machine to machine) service has been designed to provide the customer with remote monitoring and control for various sensors and controllers. M2M platform is composed of a bunch of the software and devices equipped with network connectivity providing data manipulation and exchange among devices and applications. It is also required to be equipped with data management and analysis functions independent of the specific services. In this paper, it is proposed a highly scalable and flexible data exchange protocol, named UM3, which is independent to industry and products. The proposed UM3 data exchange protocols with data model and its encoding rules have strong interoperability to the various M2M related industry standards. UM3 data model based on ITU-T ASN.1 specification language has the capability of representing a time varying unstructured data format. The binary encoding rule of UM3 uses T-NL-N-L-V PDU format. It uses character string instead of numerical tag values as its attribute identifier. UM3 encoding rule provides XML and JSON encoding schemes as its text-based encoding methods. The merits of binary and text based encoding rules are more self-descriptive compared to numerical values based BER, XER and BACnet, etc. By the proposed in this paper self-descriptive capability and compatibility to the other industry protocols, integration of various M2M devices with different industry M2M platforms shall be more easer and expandable by modular way resulting general purpose M2M services. Finally, the pros and cons by character string based data exchange protocol and the future directions of M2M platform for different type of sensors and industry would be discussed and suggested.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124682076","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
扫码关注我们
求助内容：
应助结果提醒方式：