Pub Date : 2011-10-13DOI: 10.1109/CCIS.2011.6045075
Abdul Wahid Tareen
The phenomenal growth of the Internet during last decade has divided the ICT market in two groups of players, one consisting network operators with significant market power of legacy centralized networks and revenues dependent upon circuit switched voice and others consisting content providers having all Internet users as their potential customers with advertisement based business models. This market division which is the result of Internet adoption has resulted in debate about network neutrality principals and its implication on future of next generation networks and Internet. This paper analyzes migration approaches towards next generation network architecture, tech no-economic effects of network neutrality on market structure of broadband Internet access and its implications on investment incentives for network operators.
{"title":"Next generation broadband access networks evolving market structure and implications of network neutrality regulation","authors":"Abdul Wahid Tareen","doi":"10.1109/CCIS.2011.6045075","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045075","url":null,"abstract":"The phenomenal growth of the Internet during last decade has divided the ICT market in two groups of players, one consisting network operators with significant market power of legacy centralized networks and revenues dependent upon circuit switched voice and others consisting content providers having all Internet users as their potential customers with advertisement based business models. This market division which is the result of Internet adoption has resulted in debate about network neutrality principals and its implication on future of next generation networks and Internet. This paper analyzes migration approaches towards next generation network architecture, tech no-economic effects of network neutrality on market structure of broadband Internet access and its implications on investment incentives for network operators.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122374888","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 : 2011-10-13DOI: 10.1109/CCIS.2011.6045078
Xin Lu, Zilong Gu
Dynamic scheduling cloud resources according to the change of the load are key to improve cloud computing on-demand service capabilities. This paper proposes a load-adaptive cloud resource scheduling model based on ant colony algorithm. By real-time monitoring virtual machine of performance parameters, once judging overload, it schedules fast cloud resources using ant colony algorithm to bear some load on the load-free node. So that it can meet changing load requirements. By analyzing an example result, the model can meet the goals and requirements of self-adaptive cloud resources scheduling and improve the efficiency of the resource utilization.
{"title":"A load-adapative cloud resource scheduling model based on ant colony algorithm","authors":"Xin Lu, Zilong Gu","doi":"10.1109/CCIS.2011.6045078","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045078","url":null,"abstract":"Dynamic scheduling cloud resources according to the change of the load are key to improve cloud computing on-demand service capabilities. This paper proposes a load-adaptive cloud resource scheduling model based on ant colony algorithm. By real-time monitoring virtual machine of performance parameters, once judging overload, it schedules fast cloud resources using ant colony algorithm to bear some load on the load-free node. So that it can meet changing load requirements. By analyzing an example result, the model can meet the goals and requirements of self-adaptive cloud resources scheduling and improve the efficiency of the resource utilization.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122764062","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 : 2011-10-13DOI: 10.1109/CCIS.2011.6045116
S. Wagner, Oliver Kopp, F. Leymann
Choreographies provide means to describe collaborations. Each partner runs its own processes. To reduce the amount of data exchanged and to save resources, part of the choreography can be run on a community cloud. We show how private parts of a choreography can still be run on-premise and how non-private parts can be merged to make use of the cloud infrastructure.
{"title":"Towards choreography-based process distribution in the cloud","authors":"S. Wagner, Oliver Kopp, F. Leymann","doi":"10.1109/CCIS.2011.6045116","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045116","url":null,"abstract":"Choreographies provide means to describe collaborations. Each partner runs its own processes. To reduce the amount of data exchanged and to save resources, part of the choreography can be run on a community cloud. We show how private parts of a choreography can still be run on-premise and how non-private parts can be merged to make use of the cloud infrastructure.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128622724","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 : 2011-10-13DOI: 10.1109/CCIS.2011.6045127
Shaozhong Cao, Yang Li
To study on the non-linear dynamic equation dx(t)/dt = F(x(t), t), the concept of “time-state space” — (t, x(t)) is introduced to obtain the shortest universal analytic solutions at any order series. F(x(t), t) can be expanded as Taylor series on independent variable t at the point of (t = 0, x(0)) in the time-status space. And then, the shortest universal analytic solutions at any order series can be obtained by integrating, and the convergence can also be proven.
{"title":"The shortest universal solutions for non-linear dynamic equation","authors":"Shaozhong Cao, Yang Li","doi":"10.1109/CCIS.2011.6045127","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045127","url":null,"abstract":"To study on the non-linear dynamic equation dx(t)/dt = F(x(t), t), the concept of “time-state space” — (t, x(t)) is introduced to obtain the shortest universal analytic solutions at any order series. F(x(t), t) can be expanded as Taylor series on independent variable t at the point of (t = 0, x(0)) in the time-status space. And then, the shortest universal analytic solutions at any order series can be obtained by integrating, and the convergence can also be proven.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124649936","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 : 2011-10-13DOI: 10.1109/CCIS.2011.6045080
X. Yang, Jianling Sun
MapReduce is a distributed computing framework. Its application in distributed systems is a rapidly emerging field. Although this framework can leverage clusters to improve computing performance, tuning it is still challenging. Most current works related to MapReduce performance are based on system monitoring and simulation, and lack analytical performance models. In this paper, we propose a simple and general MapReduce performance model for better understanding the impact of each component on overall program performance, and verify it in a small cluster. The results indicate that our model can predict the performance of MapReduce system and its relation to the configuration. According to our model, performance can be improved significantly by modifying Map split granularity and number of reducers without modifying the framework. The model also points out potential bottlenecks of the framework and future improvement for better performance.
{"title":"An analytical performance model of MapReduce","authors":"X. Yang, Jianling Sun","doi":"10.1109/CCIS.2011.6045080","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045080","url":null,"abstract":"MapReduce is a distributed computing framework. Its application in distributed systems is a rapidly emerging field. Although this framework can leverage clusters to improve computing performance, tuning it is still challenging. Most current works related to MapReduce performance are based on system monitoring and simulation, and lack analytical performance models. In this paper, we propose a simple and general MapReduce performance model for better understanding the impact of each component on overall program performance, and verify it in a small cluster. The results indicate that our model can predict the performance of MapReduce system and its relation to the configuration. According to our model, performance can be improved significantly by modifying Map split granularity and number of reducers without modifying the framework. The model also points out potential bottlenecks of the framework and future improvement for better performance.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127833131","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 : 2011-10-13DOI: 10.1109/CCIS.2011.6045125
Han‐Yuh Liu, Jie Li, Hongwei Jia
In this paper, a safety evaluation strategy based on context-aware computing and an escaping model based on Analytical Hierarchy Process are designed in the wireless location indoor environment. Safety grade vector is used as an evaluation index and encoded in the “emergency dictionary” to predict emergencies. This strategy takes the initiative to evaluate indoor safety, extending the cycle of safety prevention, improving the strength either. In the escaping model, this paper reforms the AHP method by defining three tiers for escaping allocation, feeding emergency information, geographical information and resource information into allocation standard. This model can provide solutions which are simple and can be easily executed, helpful to schedule in the emergency response. Simulation tests are also run in this paper. The designed system performs well and generates effective solutions.
{"title":"The design of indoor emergency management system based on wireless location","authors":"Han‐Yuh Liu, Jie Li, Hongwei Jia","doi":"10.1109/CCIS.2011.6045125","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045125","url":null,"abstract":"In this paper, a safety evaluation strategy based on context-aware computing and an escaping model based on Analytical Hierarchy Process are designed in the wireless location indoor environment. Safety grade vector is used as an evaluation index and encoded in the “emergency dictionary” to predict emergencies. This strategy takes the initiative to evaluate indoor safety, extending the cycle of safety prevention, improving the strength either. In the escaping model, this paper reforms the AHP method by defining three tiers for escaping allocation, feeding emergency information, geographical information and resource information into allocation standard. This model can provide solutions which are simple and can be easily executed, helpful to schedule in the emergency response. Simulation tests are also run in this paper. The designed system performs well and generates effective solutions.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127995195","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 : 2011-10-13DOI: 10.1109/CCIS.2011.6045122
Peng Zhang, Zheng Yan
With the rapid growth of mobile smart phone users, more and more mobile users are using mobile phones to access Internet services. Meanwhile, cloud computing is changing the landscape of Internet services, so as to affect the mobile services. Cloud computing is regarded as the future of mobile. However, cloud computing still faces a number of challenges, one of which is Quality of Services (QoS), that is, how a service provider can ensure QoS of its cloud services, especially for mobile users. In this paper, we present a QoS framework for mobile cloud computing and an adaptive QoS management process to manage QoS assurance in mobile cloud computing environment. Furthermore, we present a QoS management model based on Fuzzy Cognitive Map (FCM). With an example, we evaluate the proposed system and demonstrate its effectiveness and benefits.
{"title":"A QoS-aware system for mobile cloud computing","authors":"Peng Zhang, Zheng Yan","doi":"10.1109/CCIS.2011.6045122","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045122","url":null,"abstract":"With the rapid growth of mobile smart phone users, more and more mobile users are using mobile phones to access Internet services. Meanwhile, cloud computing is changing the landscape of Internet services, so as to affect the mobile services. Cloud computing is regarded as the future of mobile. However, cloud computing still faces a number of challenges, one of which is Quality of Services (QoS), that is, how a service provider can ensure QoS of its cloud services, especially for mobile users. In this paper, we present a QoS framework for mobile cloud computing and an adaptive QoS management process to manage QoS assurance in mobile cloud computing environment. Furthermore, we present a QoS management model based on Fuzzy Cognitive Map (FCM). With an example, we evaluate the proposed system and demonstrate its effectiveness and benefits.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134292997","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 : 2011-10-13DOI: 10.1109/CCIS.2011.6045101
Yawen Li, Xiangyun Wang, Xue Wang
In this paper, we propose and establish an analysis and decision support system based on smart phone for tourist flows, including smart phone based area traffic monitoring and real-time decision support subsystem, traveling by car passenger analysis and decision support subsystem. We give out the system architecture, software design, and related research and design algorithm. We achieve the tourists flow data acquisition and control, distribution within the tourist area, tourist characteristics and rules of analysis and decision support.
{"title":"Tourist flows analysis and decision support system based on intelligent mobile phone","authors":"Yawen Li, Xiangyun Wang, Xue Wang","doi":"10.1109/CCIS.2011.6045101","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045101","url":null,"abstract":"In this paper, we propose and establish an analysis and decision support system based on smart phone for tourist flows, including smart phone based area traffic monitoring and real-time decision support subsystem, traveling by car passenger analysis and decision support subsystem. We give out the system architecture, software design, and related research and design algorithm. We achieve the tourists flow data acquisition and control, distribution within the tourist area, tourist characteristics and rules of analysis and decision support.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133429392","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 : 2011-10-13DOI: 10.1109/CCIS.2011.6045091
Li Pan
The on-demand service provision model in cloud computing necessitates the use of well-established service level agreements (SLA). A SLA is a part of a service contract between the consumer and provider that formally defines the level of service. In cloud computing, SLAs are necessary to control the use of computing resources. Therefore, a main issue for cloud computing is to build a new layer to support a negotiation phase between service providers and consumers to establish SLAs between them. In this paper, we propose a software agent based automated service negotiation framework for on-demand cloud service provision. In this framework, autonomous agents act on half of service providers and consumers to participate in negotiations in automated and efficient way. We also propose a bilateral multi-step monotonic concession negotiation protocol for service negotiation in cloud computing environments.
{"title":"Towards a ramework for automated service negotiation in cloud computing","authors":"Li Pan","doi":"10.1109/CCIS.2011.6045091","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045091","url":null,"abstract":"The on-demand service provision model in cloud computing necessitates the use of well-established service level agreements (SLA). A SLA is a part of a service contract between the consumer and provider that formally defines the level of service. In cloud computing, SLAs are necessary to control the use of computing resources. Therefore, a main issue for cloud computing is to build a new layer to support a negotiation phase between service providers and consumers to establish SLAs between them. In this paper, we propose a software agent based automated service negotiation framework for on-demand cloud service provision. In this framework, autonomous agents act on half of service providers and consumers to participate in negotiations in automated and efficient way. We also propose a bilateral multi-step monotonic concession negotiation protocol for service negotiation in cloud computing environments.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115346442","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 : 2011-10-13DOI: 10.1109/CCIS.2011.6045135
Xiao Xia, Songlin Sun, Xiaojun Jing, Hai Huang
The proportionate affine projection algorithm (APA) was developed for echo cancellation. To further improve the convergence rate and tracking ability, in this paper, a variable parameter μ of the μ-law compression is applied to a recently μ-law “memory”-improved proportionate APA (MMIPAPA). In proposed algorithm, the parameter μ is not constant, but time varying and adaptive. Compared with MMIPAPA, simulation results show that the proposed algorithm, termed the adaptive μ-law “memory”-improved proportionate APA (AMMIPAPA), achieves better convergence performance and owns better tracking ability.
{"title":"A variable parameter efficient μ-law improved proportionate affine projection algorithm","authors":"Xiao Xia, Songlin Sun, Xiaojun Jing, Hai Huang","doi":"10.1109/CCIS.2011.6045135","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045135","url":null,"abstract":"The proportionate affine projection algorithm (APA) was developed for echo cancellation. To further improve the convergence rate and tracking ability, in this paper, a variable parameter μ of the μ-law compression is applied to a recently μ-law “memory”-improved proportionate APA (MMIPAPA). In proposed algorithm, the parameter μ is not constant, but time varying and adaptive. Compared with MMIPAPA, simulation results show that the proposed algorithm, termed the adaptive μ-law “memory”-improved proportionate APA (AMMIPAPA), achieves better convergence performance and owns better tracking ability.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125871435","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
扫码关注我们
求助内容：
应助结果提醒方式：