Pub Date : 2012-11-26DOI: 10.1109/APNOMS.2012.6356099
Shuntaro Kashihara, M. Miyazawa, M. Hayashi
The paper proposes a mechanism to generate and improve operational workflows on-the-fly by utilizing work records actually conducted in network operations. To achieve agile and cost effective telecom operations, it is important to have well-defined operational workflows for each operational process. However, defining ultimately-optimized workflows for all operations in-advance is unlikely since new services are frequently created and the relevant infrastructure is renovated on a daily basis. Modifying the predefined workflow often in line with environmental changes incurs considerable operational costs, since manual operation is required to keep all workflows up-to-date. Accordingly, a mechanism to generate workflows automatically is necessary to swiftly and economically adapt to the dynamic environment. In this paper, automatic tagging technology to generate discrete operation records and quantitative evaluation-based workflow trimming technology to extract operational workflows from stored operation records are developed to map operating processes to the business process model. Throughout the scenario demonstrated, an efficiency to analyze actual operations and the capability of generating operational workflows are indicated.
{"title":"OPERAS': Generating and improving network operational workflows on-the-fly","authors":"Shuntaro Kashihara, M. Miyazawa, M. Hayashi","doi":"10.1109/APNOMS.2012.6356099","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356099","url":null,"abstract":"The paper proposes a mechanism to generate and improve operational workflows on-the-fly by utilizing work records actually conducted in network operations. To achieve agile and cost effective telecom operations, it is important to have well-defined operational workflows for each operational process. However, defining ultimately-optimized workflows for all operations in-advance is unlikely since new services are frequently created and the relevant infrastructure is renovated on a daily basis. Modifying the predefined workflow often in line with environmental changes incurs considerable operational costs, since manual operation is required to keep all workflows up-to-date. Accordingly, a mechanism to generate workflows automatically is necessary to swiftly and economically adapt to the dynamic environment. In this paper, automatic tagging technology to generate discrete operation records and quantitative evaluation-based workflow trimming technology to extract operational workflows from stored operation records are developed to map operating processes to the business process model. Throughout the scenario demonstrated, an efficiency to analyze actual operations and the capability of generating operational workflows are indicated.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"27 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":"115228971","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.6356047
Duowei Jin, Peng Yu, Zhaowei Qu, Wenjing Li
For the sake of the increase of energy consumption, the emission of carbide can't be negligible. In this paper, we propose a mathematical model which adjusts the radius of base station, to figure out the problem of energy saving, while the quality of services such as the traffic volume of each base station and the service area should be satisfied. For the model, we use ant colony algorithm as a practical method to solve this problem. By using this mechanism, we can achieve the purpose of energy saving, when the traffic in a service area is low.
{"title":"Optimization of energy saving in celluar networks using ant colony algorithm","authors":"Duowei Jin, Peng Yu, Zhaowei Qu, Wenjing Li","doi":"10.1109/APNOMS.2012.6356047","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356047","url":null,"abstract":"For the sake of the increase of energy consumption, the emission of carbide can't be negligible. In this paper, we propose a mathematical model which adjusts the radius of base station, to figure out the problem of energy saving, while the quality of services such as the traffic volume of each base station and the service area should be satisfied. For the model, we use ant colony algorithm as a practical method to solve this problem. By using this mechanism, we can achieve the purpose of energy saving, when the traffic in a service area is low.","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":"116938297","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.6356081
Bo Wang, Zhili Wang, Xue-song Qiu
The definition of network management interface is generally divided into three phases, requirements, analysis and design. In analysis phase, UML is used as the modeling language to present technology independent models, and these models can be mapped into multiple technology specific models. With the development of Web Services applied in network management domain, it is required to define Web Services-based information models in design phase. This paper applied MDA approach to realize models transformation. As the main work, this paper proposed detailed mapping rules describing how to map the existing source UML models into the target Web Services-based models. An automatic transformation approach using XSLT was proposed to implement the mapping rules, and experiments were made for verification. The proposed mapping rules improved the defects in related work. Furthermore, the work of this paper could help resolve some issues in current models transformation work which is still being accomplished manually by standard developers.
{"title":"MDA-based network management information model transformation from UML to Web Services","authors":"Bo Wang, Zhili Wang, Xue-song Qiu","doi":"10.1109/APNOMS.2012.6356081","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356081","url":null,"abstract":"The definition of network management interface is generally divided into three phases, requirements, analysis and design. In analysis phase, UML is used as the modeling language to present technology independent models, and these models can be mapped into multiple technology specific models. With the development of Web Services applied in network management domain, it is required to define Web Services-based information models in design phase. This paper applied MDA approach to realize models transformation. As the main work, this paper proposed detailed mapping rules describing how to map the existing source UML models into the target Web Services-based models. An automatic transformation approach using XSLT was proposed to implement the mapping rules, and experiments were made for verification. The proposed mapping rules improved the defects in related work. Furthermore, the work of this paper could help resolve some issues in current models transformation work which is still being accomplished manually by standard developers.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"106 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":"125902483","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.6356049
Cuong T. Do, C. Hong, Jinpyo Hong
Recently overlay/underlay framework in Cognitive Radio (CR) have been studied and demonstrated the benefits such as spectrum efficiency and channel capacity maximization. We assume Secondary Users (SUs) can choose to either acquire a dedicated spectrum with constant payment or to use a Primary User (PU) band for free. However, using PU band yields delayed transmission cost. In this paper, we apply M/M/1 queueing model with heterogeneous service rate to derive the explicit expressions for the expected delays of an arbitrary SU data packets. Based on this, the SUs need to decide whether to use the Primary User (PU) band or to acquire the dedicated band. The interaction between selfish SUs is modeled as a noncooperative game. We prove the existence and uniqueness of a symmetric Nash equilibrium, and characterize the equilibrium behavior explicitly. Then an appropriate price of the dedicated band can be defined. Numerical analysis are used to prove a high degree of accuracy for the derived expressions.
{"title":"Pricing control for hybrid overlay/underlay spectrum access in Cognitive Radio networks","authors":"Cuong T. Do, C. Hong, Jinpyo Hong","doi":"10.1109/APNOMS.2012.6356049","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356049","url":null,"abstract":"Recently overlay/underlay framework in Cognitive Radio (CR) have been studied and demonstrated the benefits such as spectrum efficiency and channel capacity maximization. We assume Secondary Users (SUs) can choose to either acquire a dedicated spectrum with constant payment or to use a Primary User (PU) band for free. However, using PU band yields delayed transmission cost. In this paper, we apply M/M/1 queueing model with heterogeneous service rate to derive the explicit expressions for the expected delays of an arbitrary SU data packets. Based on this, the SUs need to decide whether to use the Primary User (PU) band or to acquire the dedicated band. The interaction between selfish SUs is modeled as a noncooperative game. We prove the existence and uniqueness of a symmetric Nash equilibrium, and characterize the equilibrium behavior explicitly. Then an appropriate price of the dedicated band can be defined. Numerical analysis are used to prove a high degree of accuracy for the derived expressions.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"102 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":"122089368","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.6356067
Seung-Hwan Shin, Rossi Kamal, Rim Haw, S. I. Moon, C. Hong, Mi-Jung Choi
Machine to Machine (M2M), communication between the machines without or with the least-human involvement, is going to be an important part of life. Healthcare is one of the areas on which M2M is going to play major roles. At present time, healthcare sensors monitor patient information and notify remote doctors. However, if we can integrate more intelligence in healthcare sensors, then these can sense patient's emergency condition by themselves and can notify doctor before severe condition. In this context, we have developed intelligent mobile sensor agents in a healthcare scenario in a M2M context. This sensor agent can sense blood pressure of a patient and can notify remote doctor, with the help of an intelligent adapter and a manager in a M2M healthcare scenario.
{"title":"Intelligent M2M network using healthcare sensors","authors":"Seung-Hwan Shin, Rossi Kamal, Rim Haw, S. I. Moon, C. Hong, Mi-Jung Choi","doi":"10.1109/APNOMS.2012.6356067","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356067","url":null,"abstract":"Machine to Machine (M2M), communication between the machines without or with the least-human involvement, is going to be an important part of life. Healthcare is one of the areas on which M2M is going to play major roles. At present time, healthcare sensors monitor patient information and notify remote doctors. However, if we can integrate more intelligence in healthcare sensors, then these can sense patient's emergency condition by themselves and can notify doctor before severe condition. In this context, we have developed intelligent mobile sensor agents in a healthcare scenario in a M2M context. This sensor agent can sense blood pressure of a patient and can notify remote doctor, with the help of an intelligent adapter and a manager in a M2M healthcare scenario.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"80 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":"127612019","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.6356083
Bo Yin, Lin Lin
Consolidation virtual machine (VM) on fewer physical servers is an efficient way to reduce energy consumption in data center. However, VMs often have inherent dependencies which bring complex load interactions among the underlying physical servers. Unreasonable migration will lead to a decline in network performance. In this paper, aiming at energy saving, we propose an application-aware policy in VM consolidation process. Moreover, in order to guarantee that the migrated VMs can be efficiently placed on physical servers determined by the application-aware policy, we also propose a multi-dimensional resource allocation algorithm (MDRA). Experiment results show that the proposed application-aware policy can efficiently reduce energy consumption as well as improving network performance. And the proposed MDRA algorithm can ensure the effectiveness of our policy.
{"title":"Energy reducing dynamic multi-dimensional resource allocation in cloud data center","authors":"Bo Yin, Lin Lin","doi":"10.1109/APNOMS.2012.6356083","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356083","url":null,"abstract":"Consolidation virtual machine (VM) on fewer physical servers is an efficient way to reduce energy consumption in data center. However, VMs often have inherent dependencies which bring complex load interactions among the underlying physical servers. Unreasonable migration will lead to a decline in network performance. In this paper, aiming at energy saving, we propose an application-aware policy in VM consolidation process. Moreover, in order to guarantee that the migrated VMs can be efficiently placed on physical servers determined by the application-aware policy, we also propose a multi-dimensional resource allocation algorithm (MDRA). Experiment results show that the proposed application-aware policy can efficiently reduce energy consumption as well as improving network performance. And the proposed MDRA algorithm can ensure the effectiveness of our policy.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"34 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":"115910147","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.6356093
Y. C. Sung, Meng-Hsun Tsai, Hong-Yuh Lee
3rd Generation Partnership Project (3GPP) proposes relay architecture to extend the coverage and enhance the system capacity of Long Term Evolution Advanced (LTE-A). In the relay architecture, the header compression mechanism called RObust Header Compression (ROHC) is introduced to eliminate packet overhead and provide better spectral efficiency for IP packet transmission over the radio. However, the ROHC mechanism specified in the relay architecture causes huge computation load. This paper proposes an efficient ROHC mechanism to improve the header compression performance in the relay architecture. A modeling study is performed to tune the parameters defined in the proposed mechanism to yield better performance. Our study suggests an efficient ROHC mechanism that decreases over 30% header computation load in comparison with the mechanism defined in the specification.
{"title":"An efficient robust header compression mechanism for Long Term Evolution Advanced relay architecture","authors":"Y. C. Sung, Meng-Hsun Tsai, Hong-Yuh Lee","doi":"10.1109/APNOMS.2012.6356093","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356093","url":null,"abstract":"3rd Generation Partnership Project (3GPP) proposes relay architecture to extend the coverage and enhance the system capacity of Long Term Evolution Advanced (LTE-A). In the relay architecture, the header compression mechanism called RObust Header Compression (ROHC) is introduced to eliminate packet overhead and provide better spectral efficiency for IP packet transmission over the radio. However, the ROHC mechanism specified in the relay architecture causes huge computation load. This paper proposes an efficient ROHC mechanism to improve the header compression performance in the relay architecture. A modeling study is performed to tune the parameters defined in the proposed mechanism to yield better performance. Our study suggests an efficient ROHC mechanism that decreases over 30% header computation load in comparison with the mechanism defined in the specification.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"4 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":"127845492","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.6356092
J. Liang, H. Kao, Han-Ching Tsao, Shao-Chen Chang, Meng-Hsun Tsai, Kuan-Hsien Li, Y. C. Sung
Memory leaks generated by a running program may exhaust memory resources and degrade system performance. It is hard to reproduce these kinds of leaks, let alone to identify and fix them early in the development phase. Thus online memory leak detection is required. In this paper we propose a two-phase approach to the online memory leak detection problem for Java programs. In phase one (offline analysis), the user executes the investigated program for a while and analyzes its heap with the proposed agent. The agent then summarizes the total occupied bytes of data structures in the heap offline, and the user is then able to select classes whose object instances seem to be potential leaks by examining the total occupied bytes summary. In phase two (online monitoring), to reduce the space and time overhead at runtime, the agent monitors online the objects of selected classes instead of monitoring all objects in the heap. The approach reports the last accessed time and location (including the source file name and the line number) of each leak candidate, with which the user can identify and fix leaks in the program.
{"title":"Two-phase online memory leak detection","authors":"J. Liang, H. Kao, Han-Ching Tsao, Shao-Chen Chang, Meng-Hsun Tsai, Kuan-Hsien Li, Y. C. Sung","doi":"10.1109/APNOMS.2012.6356092","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356092","url":null,"abstract":"Memory leaks generated by a running program may exhaust memory resources and degrade system performance. It is hard to reproduce these kinds of leaks, let alone to identify and fix them early in the development phase. Thus online memory leak detection is required. In this paper we propose a two-phase approach to the online memory leak detection problem for Java programs. In phase one (offline analysis), the user executes the investigated program for a while and analyzes its heap with the proposed agent. The agent then summarizes the total occupied bytes of data structures in the heap offline, and the user is then able to select classes whose object instances seem to be potential leaks by examining the total occupied bytes summary. In phase two (online monitoring), to reduce the space and time overhead at runtime, the agent monitors online the objects of selected classes instead of monitoring all objects in the heap. The approach reports the last accessed time and location (including the source file name and the line number) of each leak candidate, with which the user can identify and fix leaks in the program.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"55 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":"129529910","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.6356046
Ruozhou Yu, Xudong Yang, Jun Huang, Q. Duan, Yan Ma, Y. Tanaka
Cloud computing is one of the most significant latest efforts in the field of information technology, which may change the way how information services are provisioned. In a Cloud environment, different types of resources need to be virtualized as a collection of Cloud services using virtualization technology. End-users in the Cloud are usually provided with customized Cloud services that involve not only different kinds of computing services but also the networks interconnecting those computing services. Therefore, a set of Cloud computing services and the networking services should be modeled as a composite customized Cloud service. In this paper, we present an improved model for Cloud service provisioning based on our previous Network-Cloud proposal, and propose a procedure with several QoS-aware service selection algorithms for composing different services offered by a Cloud. Our analysis with numerical experiments show that the presented algorithms can select services appropriately that deal with different requirements of service provisioning.
{"title":"QoS-aware service selection in virtualization-based Cloud computing","authors":"Ruozhou Yu, Xudong Yang, Jun Huang, Q. Duan, Yan Ma, Y. Tanaka","doi":"10.1109/APNOMS.2012.6356046","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356046","url":null,"abstract":"Cloud computing is one of the most significant latest efforts in the field of information technology, which may change the way how information services are provisioned. In a Cloud environment, different types of resources need to be virtualized as a collection of Cloud services using virtualization technology. End-users in the Cloud are usually provided with customized Cloud services that involve not only different kinds of computing services but also the networks interconnecting those computing services. Therefore, a set of Cloud computing services and the networking services should be modeled as a composite customized Cloud service. In this paper, we present an improved model for Cloud service provisioning based on our previous Network-Cloud proposal, and propose a procedure with several QoS-aware service selection algorithms for composing different services offered by a Cloud. Our analysis with numerical experiments show that the presented algorithms can select services appropriately that deal with different requirements of service provisioning.","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":"130816077","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.6356050
Sin-Seok Seo, Joon-Myung Kang, Yoonseon Han, J. W. Hong
Large and various amounts of context data related to a user's environment are available from different domains including mobile devices, smarthomes, wearable sensors, and social networking services. These context domains are interconnected and the context data from them can be shared thanks to mobile, pervasive, convergent, and ubiquitous technologies. We can provide user-centric context-aware services by aggregating and associating the diverse types of context data distributed over multiple domains around a user. However, state-of-the-art research efforts have been devoted to managing context only in a single domain. In this paper, for user-centric context management, we propose 1) a flexible and extensible technology-neutral information model that can represent generic concepts of context; 2) a hierarchical context management architecture that can understand and manage complex interactions among multiple contextual entities.
{"title":"Context management for user-centric context-aware services over pervasive networks","authors":"Sin-Seok Seo, Joon-Myung Kang, Yoonseon Han, J. W. Hong","doi":"10.1109/APNOMS.2012.6356050","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356050","url":null,"abstract":"Large and various amounts of context data related to a user's environment are available from different domains including mobile devices, smarthomes, wearable sensors, and social networking services. These context domains are interconnected and the context data from them can be shared thanks to mobile, pervasive, convergent, and ubiquitous technologies. We can provide user-centric context-aware services by aggregating and associating the diverse types of context data distributed over multiple domains around a user. However, state-of-the-art research efforts have been devoted to managing context only in a single domain. In this paper, for user-centric context management, we propose 1) a flexible and extensible technology-neutral information model that can represent generic concepts of context; 2) a hierarchical context management architecture that can understand and manage complex interactions among multiple contextual entities.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"17 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":"121053021","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
扫码关注我们
求助内容：
应助结果提醒方式：