Pub Date : 2015-08-01DOI: 10.1109/APNOMS.2015.7275382
Thant Zin Oo, Nguyen H. Tran, Tuan LeAnh, S. M. Ahsan Kazmi, T. Ho, C. Hong
Heterogeneous cellular networks offload the mobile data traffic to small cell base stations to reduce the workload on the macro base stations. Our objective is to maximize the sum rate of the down-links for the whole network under outage QoS constraint. To achieve the objective, we have to jointly solve the user association problem and resource allocation problem. We formulate the two problems into a joint optimization problem and convert it into an equivalent game theoretic formulation. We employ payoff based log linear learning and propose an algorithm that converges to one of the existing Nash equilibrium. We then provide extensive simulation results to verify the performance of our proposed algorithm.
{"title":"Traffic offloading under outage QoS constraint in heterogeneous cellular networks","authors":"Thant Zin Oo, Nguyen H. Tran, Tuan LeAnh, S. M. Ahsan Kazmi, T. Ho, C. Hong","doi":"10.1109/APNOMS.2015.7275382","DOIUrl":"https://doi.org/10.1109/APNOMS.2015.7275382","url":null,"abstract":"Heterogeneous cellular networks offload the mobile data traffic to small cell base stations to reduce the workload on the macro base stations. Our objective is to maximize the sum rate of the down-links for the whole network under outage QoS constraint. To achieve the objective, we have to jointly solve the user association problem and resource allocation problem. We formulate the two problems into a joint optimization problem and convert it into an equivalent game theoretic formulation. We employ payoff based log linear learning and propose an algorithm that converges to one of the existing Nash equilibrium. We then provide extensive simulation results to verify the performance of our proposed algorithm.","PeriodicalId":269263,"journal":{"name":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122751166","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 : 2015-08-01DOI: 10.1109/APNOMS.2015.7275445
S. F. Abedin, Md. Golam Rabiul Alam, Nguyen H. Tran, C. Hong
The revolutionized vision of IoT has united heterogeneous devices to foster the systems of cohesive intelligent things. In addition, Fog computing has also envisioned a new form of cloud computing paradigm. Therefore, Fog provides edge computing to such IoT devices with varied capabilities and resources. However, a balanced and efficient pairing or matching strategy for edge IoT nodes is crucial to achieve the user requisite. Hence, this paper addresses the utility based matching or pairing problem within the same domain of IoT nodes by using Irving's matching algorithm under the node specified preferences to endure a stable IoT node pairing. We studied the performance of the proposed matching algorithm through simulation. The simulation results show the higher utility gain of the node pairs through refined matching algorithm over greedy approach.
{"title":"A Fog based system model for cooperative IoT node pairing using matching theory","authors":"S. F. Abedin, Md. Golam Rabiul Alam, Nguyen H. Tran, C. Hong","doi":"10.1109/APNOMS.2015.7275445","DOIUrl":"https://doi.org/10.1109/APNOMS.2015.7275445","url":null,"abstract":"The revolutionized vision of IoT has united heterogeneous devices to foster the systems of cohesive intelligent things. In addition, Fog computing has also envisioned a new form of cloud computing paradigm. Therefore, Fog provides edge computing to such IoT devices with varied capabilities and resources. However, a balanced and efficient pairing or matching strategy for edge IoT nodes is crucial to achieve the user requisite. Hence, this paper addresses the utility based matching or pairing problem within the same domain of IoT nodes by using Irving's matching algorithm under the node specified preferences to endure a stable IoT node pairing. We studied the performance of the proposed matching algorithm through simulation. The simulation results show the higher utility gain of the node pairs through refined matching algorithm over greedy approach.","PeriodicalId":269263,"journal":{"name":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124813407","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 : 2015-08-01DOI: 10.1109/APNOMS.2015.7275418
Tuan LeAnh, Nguyen H. Tran, S. M. Ahsan Kazmi, Thant Zin Oo, K. Thar, T. Ho, C. Hong
In this paper, we study the relay-aided cooperative modeling that supports the load-sharing in uplink two-tier cellular networks. In our model, users in heavily loaded macrocell are shifted to lightly loaded smallcells with the assistance of relay users to mitigate Signal to Interference plus Noise Ratio (SINR) degradation problem in conventional direct handover. In order to promote relaying data of users which are selfish and rational, a trading exchange model based on Stackelberg game is proposed to optimize strategies of users. Relay users have pricing-based strategies on theirs power unit while shifted heavily loaded macrocell users have strategies to buy power levels of relay users. Optimal strategies are investigated using the backward induction analysis. Specifically, problems of NP-hard combinatorial optimization in relay user selections in the game are solved with a distributed algorithm based on matching theory. We intensively evaluate our proposed model by simulating it in Matlab which shows the efficiency of our proposal.
{"title":"Load-sharing based on relay-aided cooperative modeling in uplink two-tier cellular networks","authors":"Tuan LeAnh, Nguyen H. Tran, S. M. Ahsan Kazmi, Thant Zin Oo, K. Thar, T. Ho, C. Hong","doi":"10.1109/APNOMS.2015.7275418","DOIUrl":"https://doi.org/10.1109/APNOMS.2015.7275418","url":null,"abstract":"In this paper, we study the relay-aided cooperative modeling that supports the load-sharing in uplink two-tier cellular networks. In our model, users in heavily loaded macrocell are shifted to lightly loaded smallcells with the assistance of relay users to mitigate Signal to Interference plus Noise Ratio (SINR) degradation problem in conventional direct handover. In order to promote relaying data of users which are selfish and rational, a trading exchange model based on Stackelberg game is proposed to optimize strategies of users. Relay users have pricing-based strategies on theirs power unit while shifted heavily loaded macrocell users have strategies to buy power levels of relay users. Optimal strategies are investigated using the backward induction analysis. Specifically, problems of NP-hard combinatorial optimization in relay user selections in the game are solved with a distributed algorithm based on matching theory. We intensively evaluate our proposed model by simulating it in Matlab which shows the efficiency of our proposal.","PeriodicalId":269263,"journal":{"name":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121073519","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 : 2015-08-01DOI: 10.1109/APNOMS.2015.7275366
Cinyoung Hur, Jeong-hwan Kim, Heeyoung Jung, Woojik Chun
In current Internet, network API acts as a bridge between application and network and the importance of its role is growing. However, it has inherent limitation of tight-coupling which makes almost indivisible all the network environments, such as transport controls and network-specific addresses. This coupling not only makes it difficult to change one without changing another, but also prevents both sides from evolving. This work presents a novel network API, iPlug and dSocket, which not only decouples identifier and locator, but splits application-specific functions from protocol-specific. Our design enables (1) injection of information-centered applications requirements, (2) encapsulated control of underlying network mechanisms, and (3) dynamic coupling between applications and network. The proposed API is implemented as a shared library that can be easily deployed. Our evaluations on mobility environment showed that applications have the benefits of clear abstraction and easy programmability from decoupled iPlug and dSocket API.
{"title":"IPlug and dSocket: A new network API for decoupling identifier and locator","authors":"Cinyoung Hur, Jeong-hwan Kim, Heeyoung Jung, Woojik Chun","doi":"10.1109/APNOMS.2015.7275366","DOIUrl":"https://doi.org/10.1109/APNOMS.2015.7275366","url":null,"abstract":"In current Internet, network API acts as a bridge between application and network and the importance of its role is growing. However, it has inherent limitation of tight-coupling which makes almost indivisible all the network environments, such as transport controls and network-specific addresses. This coupling not only makes it difficult to change one without changing another, but also prevents both sides from evolving. This work presents a novel network API, iPlug and dSocket, which not only decouples identifier and locator, but splits application-specific functions from protocol-specific. Our design enables (1) injection of information-centered applications requirements, (2) encapsulated control of underlying network mechanisms, and (3) dynamic coupling between applications and network. The proposed API is implemented as a shared library that can be easily deployed. Our evaluations on mobility environment showed that applications have the benefits of clear abstraction and easy programmability from decoupled iPlug and dSocket API.","PeriodicalId":269263,"journal":{"name":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129234563","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 : 2015-08-01DOI: 10.1109/APNOMS.2015.7275432
T. Ryan, Young Choon Lee
Scientific workflows feature complex precedence constraints that are mostly dictated by data dependencies between tasks. The inter-task communication (data staging) in these complex workflow applications incurs significant overheads resulting in a major hindering factor of high performance and effective resource utilization. As the scale of these applications becomes increasingly large due primarily to the recent explosive growth of data, addressing this hindrance is of great practical importance. In this paper, we present a resource multiplexing (RM) technique, which leverages data staging aiming to minimize idle times between execution of tasks due to inter-task communication overheads. In particular, we incorporate RM into our DEWE framework 1 with making a set of extensions to the framework. The rationale behind RM is each slot or core pairs up the actual workflow task and the RM-enabled file loading DEWE extension (File Client) in the way that their resource usage is complementary. We demonstrate the efficacy of our multiplexing technique in a data-intensive computing environment using an astronomy application. Our results from experiments conducted in Amazon EC2 demonstrate that our multiplexing technique is effective with the reduction in resource idle time between jobs by 57% on average and up to 91%.
{"title":"Effective resource multiplexing for scientific workflows","authors":"T. Ryan, Young Choon Lee","doi":"10.1109/APNOMS.2015.7275432","DOIUrl":"https://doi.org/10.1109/APNOMS.2015.7275432","url":null,"abstract":"Scientific workflows feature complex precedence constraints that are mostly dictated by data dependencies between tasks. The inter-task communication (data staging) in these complex workflow applications incurs significant overheads resulting in a major hindering factor of high performance and effective resource utilization. As the scale of these applications becomes increasingly large due primarily to the recent explosive growth of data, addressing this hindrance is of great practical importance. In this paper, we present a resource multiplexing (RM) technique, which leverages data staging aiming to minimize idle times between execution of tasks due to inter-task communication overheads. In particular, we incorporate RM into our DEWE framework 1 with making a set of extensions to the framework. The rationale behind RM is each slot or core pairs up the actual workflow task and the RM-enabled file loading DEWE extension (File Client) in the way that their resource usage is complementary. We demonstrate the efficacy of our multiplexing technique in a data-intensive computing environment using an astronomy application. Our results from experiments conducted in Amazon EC2 demonstrate that our multiplexing technique is effective with the reduction in resource idle time between jobs by 57% on average and up to 91%.","PeriodicalId":269263,"journal":{"name":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127566419","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 : 2015-08-01DOI: 10.1109/APNOMS.2015.7275411
E. Lui, Yu-Sung Wu, Patrick H. Ngai, Tung-Yueh Lin, Hong-Wei Li, Shih-Yi Huang
Software Defined Networking (SDN) allows the construction of virtual networks on top of a datacenter network infrastructure. However, the flexibility also increases the chance of inconsistencies in the network configurations caused by component failures, software bugs, or human errors. The inconsistencies may result in service outage or security policy violation. We propose a model-based verification system to check the consistency of a virtual network. The system models the requirements as logic constraints and extracts the configuration states of a virtual network. The configuration states are checked against the logic constraints by using a SMT solver[1]. The prototype system successfully detects various inconsistencies injected to the testbed and incurs reasonable amount of overheads.
{"title":"Towards consistent software defined networking with logic programming","authors":"E. Lui, Yu-Sung Wu, Patrick H. Ngai, Tung-Yueh Lin, Hong-Wei Li, Shih-Yi Huang","doi":"10.1109/APNOMS.2015.7275411","DOIUrl":"https://doi.org/10.1109/APNOMS.2015.7275411","url":null,"abstract":"Software Defined Networking (SDN) allows the construction of virtual networks on top of a datacenter network infrastructure. However, the flexibility also increases the chance of inconsistencies in the network configurations caused by component failures, software bugs, or human errors. The inconsistencies may result in service outage or security policy violation. We propose a model-based verification system to check the consistency of a virtual network. The system models the requirements as logic constraints and extracts the configuration states of a virtual network. The configuration states are checked against the logic constraints by using a SMT solver[1]. The prototype system successfully detects various inconsistencies injected to the testbed and incurs reasonable amount of overheads.","PeriodicalId":269263,"journal":{"name":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"237 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114996168","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 : 2015-08-01DOI: 10.1109/APNOMS.2015.7275414
Y. Cheng, D. Huang, Cheng-Lin Lee, Mu-Che Lee, Bo-Wei Chuang, Meng-Chen Tsai, Xin Huang, Cheng-Hsin Hsu
Software-Defined Networking (SDN) is an emerging network architecture that enables network programmability. Recent research activities on SDN make it important to develop an emulator that accurately emulates OpenFlow-enabled SDN networks. However, existing emulators and simulators focus on either data plane performance or software switches. This motivates us to develop a network emulator that provides accurate emulation on both control plane and data plane performance of an OpenFlow network and supports all types of OpenFlow switches. In this paper, we design a configurable emulator that allows users to input configurations and performance characteristics of different OpenFlow switches. Based on the performance measurement results from OpenFlow switches, we derive the configurable parameters and propose an accurate control plane performance model. Our implementation is based on a popular opensource OpenFlow emulator, Mininet with OpenvSwitch (OVS). The evaluation results show that the emulator we developed provides better performance fidelity than original Mininet/OVS.
{"title":"Towards a detailed OpenFlow emulator","authors":"Y. Cheng, D. Huang, Cheng-Lin Lee, Mu-Che Lee, Bo-Wei Chuang, Meng-Chen Tsai, Xin Huang, Cheng-Hsin Hsu","doi":"10.1109/APNOMS.2015.7275414","DOIUrl":"https://doi.org/10.1109/APNOMS.2015.7275414","url":null,"abstract":"Software-Defined Networking (SDN) is an emerging network architecture that enables network programmability. Recent research activities on SDN make it important to develop an emulator that accurately emulates OpenFlow-enabled SDN networks. However, existing emulators and simulators focus on either data plane performance or software switches. This motivates us to develop a network emulator that provides accurate emulation on both control plane and data plane performance of an OpenFlow network and supports all types of OpenFlow switches. In this paper, we design a configurable emulator that allows users to input configurations and performance characteristics of different OpenFlow switches. Based on the performance measurement results from OpenFlow switches, we derive the configurable parameters and propose an accurate control plane performance model. Our implementation is based on a popular opensource OpenFlow emulator, Mininet with OpenvSwitch (OVS). The evaluation results show that the emulator we developed provides better performance fidelity than original Mininet/OVS.","PeriodicalId":269263,"journal":{"name":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132736512","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 : 2015-08-01DOI: 10.1109/APNOMS.2015.7275434
Yuusuke Nakano, N. Kamiyama, K. Shiomoto, G. Hasegawa, M. Murata, H. Miyahara
Web performance, the time from clicking a link on a web page to finishing displaying the web page of the link, is becoming increasingly important. Low web performance of web pages tends to result in the loss of customers. In our research, we measured the time for downloading files on popular web pages by running web browsers on four hosts worldwide using PlanetLab and detected the longest portion in download time. We found the longest portion in download time to be Blocked time, which is the waiting time for the start of downloading in web browsers. In this paper, we propose a method for accelerating web performance by reducing such Blocked time with a cache of rendering results. The proposed method uses an in-network rendering function which renders web pages instead of web browsers. The in-network rendering function also stores the rendering results in its cache and reuses them for other web browsers to reduce the Blocked time. To evaluate the proposed method, we calculated the web performance of web pages whose render results are cached by analyzing the measured download time of actual web pages. We found that the proposed method accelerates web performance of long round trip time (RTT) web pages or long RTT clients if the web pages' dynamic file percentages are within 80%.
{"title":"Web performance acceleration by caching rendering results","authors":"Yuusuke Nakano, N. Kamiyama, K. Shiomoto, G. Hasegawa, M. Murata, H. Miyahara","doi":"10.1109/APNOMS.2015.7275434","DOIUrl":"https://doi.org/10.1109/APNOMS.2015.7275434","url":null,"abstract":"Web performance, the time from clicking a link on a web page to finishing displaying the web page of the link, is becoming increasingly important. Low web performance of web pages tends to result in the loss of customers. In our research, we measured the time for downloading files on popular web pages by running web browsers on four hosts worldwide using PlanetLab and detected the longest portion in download time. We found the longest portion in download time to be Blocked time, which is the waiting time for the start of downloading in web browsers. In this paper, we propose a method for accelerating web performance by reducing such Blocked time with a cache of rendering results. The proposed method uses an in-network rendering function which renders web pages instead of web browsers. The in-network rendering function also stores the rendering results in its cache and reuses them for other web browsers to reduce the Blocked time. To evaluate the proposed method, we calculated the web performance of web pages whose render results are cached by analyzing the measured download time of actual web pages. We found that the proposed method accelerates web performance of long round trip time (RTT) web pages or long RTT clients if the web pages' dynamic file percentages are within 80%.","PeriodicalId":269263,"journal":{"name":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132979622","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 : 2015-08-01DOI: 10.1109/APNOMS.2015.7275393
Yeonghun Nam, Jong‐Moon Chung
In this paper, cooperative caching based content delivery management is analyzed in wireless networks. The wireless network consists of mobile devices which can download mobile contents (e.g., e-book, multimedia data, Apps etc.) and share these contents with other devices. Each device can download contents from the content provider (CP) via cellular network by paying network infrastructure cost, or receive support from another device via complementary WLAN or WPAN. In this paper, a cluster-based cooperative content delivery structure in wireless networks is proposed, and the cooperative caching scheme is analyzed to reduce the content delivery cost of each wireless devices.
{"title":"Cooperative content delivery for cost minimization in wireless networks","authors":"Yeonghun Nam, Jong‐Moon Chung","doi":"10.1109/APNOMS.2015.7275393","DOIUrl":"https://doi.org/10.1109/APNOMS.2015.7275393","url":null,"abstract":"In this paper, cooperative caching based content delivery management is analyzed in wireless networks. The wireless network consists of mobile devices which can download mobile contents (e.g., e-book, multimedia data, Apps etc.) and share these contents with other devices. Each device can download contents from the content provider (CP) via cellular network by paying network infrastructure cost, or receive support from another device via complementary WLAN or WPAN. In this paper, a cluster-based cooperative content delivery structure in wireless networks is proposed, and the cooperative caching scheme is analyzed to reduce the content delivery cost of each wireless devices.","PeriodicalId":269263,"journal":{"name":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123663839","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 : 2015-08-01DOI: 10.1109/APNOMS.2015.7275364
A. Gyrard, S. K. Datta, C. Bonnet, K. Boudaoud
Recent challenges in Internet of Things (IoT) include - (i) providing interoperability among IoT data, (ii) interpreting data generated by IoT devices, and (iii) assisting developers in accomplishing these tasks. Current standard development organizations such as oneM2M are designing semantic-based IoT architecture to address such challenges. However, the recent release of oneM2M standards does not provide any concrete tool for the semantic treatment of the IoT data. Previously, we proposed the Machine-to-Machine Measurement (M3) Framework which mitigates the challenges and assist developers in building semantic based IoT applications easily. Considering the usefulness and novel aspects of the M3 framework, the paper proposes to integrate it seamlessly into oneM2M architecture. The semantic requirements from oneM2M are pointed out and the M3 components addressing them are identified. A common service function (CSF) dedicated to semantic engine is introduced to the oneM2M architecture which extends the capabilities of common services entity (CSE) in terms of semantic treatment of IoT data. The new CSF also includes a catalog of semantic based IoT templates which are exploited by Application Entities to easily utilize the semantic engine. Two deployment scenarios of the upgraded oneM2M architecture have been discussed. Finally these extensions have been communicated to the oneM2M Management, Abstraction and Semantics (MAS) Group (Working Group 5).
物联网(IoT)最近面临的挑战包括(i)提供物联网数据之间的互操作性，(ii)解释物联网设备生成的数据，以及(iii)协助开发人员完成这些任务。目前的标准开发组织，如oneM2M，正在设计基于语义的物联网架构来应对这些挑战。然而，最近发布的oneM2M标准并没有为物联网数据的语义处理提供任何具体的工具。之前，我们提出了机器对机器测量(M3)框架，该框架减轻了挑战，并帮助开发人员轻松构建基于语义的物联网应用程序。考虑到M3框架的实用性和新颖性，本文建议将其无缝集成到oneM2M架构中。指出了oneM2M的语义需求，并确定了满足这些需求的M3组件。在oneM2M架构中引入了语义引擎专用的公共服务功能(common service function, CSF)，扩展了公共服务实体(common services entity, CSE)在物联网数据语义处理方面的能力。新的CSF还包括一个基于语义的物联网模板目录，应用实体可以利用这些模板轻松利用语义引擎。讨论了oneM2M架构升级后的两种部署场景。最后，这些扩展已经传达给oneM2M管理、抽象和语义(MAS)组(工作组5)。
{"title":"Integrating machine-to-machine measurement framework into oneM2M architecture","authors":"A. Gyrard, S. K. Datta, C. Bonnet, K. Boudaoud","doi":"10.1109/APNOMS.2015.7275364","DOIUrl":"https://doi.org/10.1109/APNOMS.2015.7275364","url":null,"abstract":"Recent challenges in Internet of Things (IoT) include - (i) providing interoperability among IoT data, (ii) interpreting data generated by IoT devices, and (iii) assisting developers in accomplishing these tasks. Current standard development organizations such as oneM2M are designing semantic-based IoT architecture to address such challenges. However, the recent release of oneM2M standards does not provide any concrete tool for the semantic treatment of the IoT data. Previously, we proposed the Machine-to-Machine Measurement (M3) Framework which mitigates the challenges and assist developers in building semantic based IoT applications easily. Considering the usefulness and novel aspects of the M3 framework, the paper proposes to integrate it seamlessly into oneM2M architecture. The semantic requirements from oneM2M are pointed out and the M3 components addressing them are identified. A common service function (CSF) dedicated to semantic engine is introduced to the oneM2M architecture which extends the capabilities of common services entity (CSE) in terms of semantic treatment of IoT data. The new CSF also includes a catalog of semantic based IoT templates which are exploited by Application Entities to easily utilize the semantic engine. Two deployment scenarios of the upgraded oneM2M architecture have been discussed. Finally these extensions have been communicated to the oneM2M Management, Abstraction and Semantics (MAS) Group (Working Group 5).","PeriodicalId":269263,"journal":{"name":"2015 17th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130370683","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
扫码关注我们
求助内容：
应助结果提醒方式：