6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)最新文献

{"title":"Domain-based virtualized resource management in cloud computing","authors":"Dongwan Shin, Hakan Akkan","doi":"10.4108/ICST.TRUSTCOL.2010.3","DOIUrl":"https://doi.org/10.4108/ICST.TRUSTCOL.2010.3","url":null,"abstract":"Cloud computing has drawn much attention in recent years. One of its delivery models, called infrastructure as a service (IaaS), provides users with infrastructure services such as computation and data storage, heavily dependent upon virtualization techniques that offers benefits such as elasticity and cost efficiency. Most of current IaaS service providers have adopted a user-based service model, where users are directly mapped to virtualized resources that they want to use and they are charged based on usage. Hence, user and resource management are centralized and easily administered at the IaaS provider. However, this also results in the lack of support for scalable management of users and resources, organization-level security policy, let alone flexible pricing model. Considering the increasing popularity of cloud computing, there is a strong need for a more scalable and flexible IaaS model, along with a more fine grained access control mechanism. In this paper we propose a domain-based framework for provisioning and managing users and virtualized resources in IaaS to address this issue. Specifically, an additional layer called domain is introduced to the user-based service model, and the domain layer facilitates the de-centralization of user and virtualized resource management in IaaS. The cloud service provider is able to delegate its administrative works to domains, and domains manage their users and virtualized resources allocated from the cloud service provider. Our framework provides benefits such as scalable user/resource management, domain-based advanced policy support, and flexible pricing.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123134093","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}

{"title":"A comparison study of collaborative strategies for distributed defense against Internet worms based on small-world modeling","authors":"Hao Chen, Yu Chen","doi":"10.4108/ICST.COLLABORATECOM.2010.31","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.31","url":null,"abstract":"The prosperity of the Internet has made it attractive to hackers and malicious attackers. Internet worms have become one type of major threats to the network infrastructure. Distributed defense collaborating with single-point-deployed security applications over multiple network domains are promising. However, most of the reported collaborative schemes for distributed defense are application-specific. There is not much research that studies the general properties of variant collaborative schemes systematically. In this paper explores properties of general collaborative defense strategies from the perspective of complex system. A three-layered network modeling platform has been developed. Taking advantage of small-world network model, the platform consists of two network layers and one application layer. On top of it, an experimental comparison study of collaborative defense schemes has been conducted. Their performance and effectiveness facing signature-embedded worm attacks have been evaluated.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131403688","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}

{"title":"On trust guided collaboration among cloud service providers","authors":"Xin Liu, Anwitaman Datta","doi":"10.4108/ICST.TRUSTCOL.2010.6","DOIUrl":"https://doi.org/10.4108/ICST.TRUSTCOL.2010.6","url":null,"abstract":"Cloud computing has emerged as a popular paradigm that offers computing resources (e.g. CPU, storage, bandwidth, software) as scalable and on-demand services over the Internet. As more players enter this emerging market, a heterogeneous cloud computing market is expected to evolve, where individual players will have different volumes of resources, and will provide specialized services, and with different levels of quality of services. It is expected that service providers will thus, besides competing, also collaborate to complement their resources in order to improve resource utilization and combine individual services to offer more complex value chains and end-to-end solutions required by the customers. It is challenging to select suitable partners in a decentralized setting due to various factors such as lack of global coordination or information, as well as diversity and scale. Trust is known to play an important role in promoting cooperation in many decentralized settings including the society at large, as well as on the Internet, e.g., in e-commerce, etc. In this paper, we explore how trust can promote collaboration among service providers. The novelty of our approach is a framework to combine disparate trust information - from direct interactions and from (indirect) references among service providers, as well as from customer feedbacks, depending on availability of these different kinds of information. Doing so provides decision making guidance to service providers to initialize collaborations by selecting trustworthy partners. Simulation results demonstrate the promise of our approach by showing that compared to random selection, our proposal can help effectively select trustworthy collaborators to achieve better quality of services.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114592226","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}

{"title":"Agiler: A P2P live streaming system with low playback lag","authors":"Dongbo Huang, Jin Zhao, Xin Wang","doi":"10.4108/ICST.COLLABORATECOM.2010.13","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.13","url":null,"abstract":"Short playback lag is preferred in many urgent and interactive scenarios such as live sports and distance education. However, measurement studies have shown that many popular P2P live streaming systems still suffer from long playback lag, say, more than 100 seconds, which makes the live streaming less realtime. Due to the unstructured nature of P2P networks, it is really a challenge to reduce the playback lag in P2P live streaming system under limited server bandwidth. In this paper, we propose a novel P2P live streaming system - Agiler that aims at reducing the playback lag in lag-sensitive applications under limited server bandwidth. In Agiler, we first group the peers into clusters according to the Autonomous System Number (ASN) and then spread the broadcast in ripples that gradually increase in playback lag as we move away from the media server. It adopts synchronous playback within a cluster to accelerate the chunk diffusion and asynchronous playback among different clusters to facilitate the chunk swarming. Combined with the partitioned buffer strategy and the proportional playback lag strategy, the newly generated fresh chunks can be delivered to all peers in time. The proposed system is evaluated through extensive packet-level simulations, which show the bandwidth utilization ratio of the peers is improved and the average playback lag is significantly reduced.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129582744","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}

{"title":"Towards a framework for cyber social status based trusted open collaboration","authors":"Jaehong Park, Yuan Cheng, R. Sandhu","doi":"10.4108/ICST.TRUSTCOL.2010.2","DOIUrl":"https://doi.org/10.4108/ICST.TRUSTCOL.2010.2","url":null,"abstract":"Collaboration takes place in both closed and open environments. While closed collaboration focuses on information or resource sharing amongst selected participants, open collaboration assumes and emphasizes that anyone can participate. In open collaboration, although participation is open to anyone who wishes to contribute or observe, it does not follow that everyone participates on an equal footing. Open collaboration is inherently a social activity. Establishment of trust in this context inevitably requires some form of social computing. Our premise is that such social computing derived trust requires a discriminative approach by utilizing cyber social status so as to enable selective and weighted trustworthiness of users and their activities and resources. In this paper we identify and discuss various kinds of cyber social status that can be used to facilitate trust in open collaboration. More specifically, we focus on social activity-based social status creation and management and articulate how these cyber social statuses of participants and resource can be generated. Furthermore, we show how these cyber social statuses are used in real world open collaboration systems such as Amazon, YouTube and eBay.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132986249","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}

{"title":"SPARTAN: A framework for Smart Phone Assisted Real-Time Health care Network design","authors":"Shinan Wang, Weisong Shi, B. Arnetz, Clairy Wiholm","doi":"10.4108/ICST.COLLABORATECOM.2010.6","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.6","url":null,"abstract":"Leveraging body area sensor network (BASN) for health care is a very promising application domain for wireless sensor networks. In a typical BASN health care application, usually, bio-sensors and environmental-sensors connect to a local Preprocessing Unit (PU) first, e.g., a smartphone or a laptop, which in turn extracts the meaningful data and performs necessary processing before the PU transmits the data to a Central Server (CS). In this procedure, we realized the system designers have to work on many repeated jobs in different BASN systems. Even worse, changing one component of the system usually requires designers to rewrite a large portion of code. In this paper, we present a Smart Phone Assisted Real-Time heAlth care Network framework (SPARTAN), to simplify the development procedure and extend the flexibility of BASN systems. In order to demonstrate the effectiveness and efficiency of SPARTAN, we implement a smartphone assisted stressor examination and warning system. The experimental results show that the SPARTAN framework can reduce the workload with low overhead and simplify several procedures such as replacing the sensor or changing the sensor configuration.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129349863","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}

{"title":"Some basic principles for proxy signature schemes based on ECDLP","authors":"Fengying Li, Qingshui Xue, Z. Cao","doi":"10.4108/ICST.COLLABORATECOM.2010.35","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.35","url":null,"abstract":"Nowadays, most proxy signature schemes are based on the difficulty of DLP (Discrete Logarithm Problem) or ECDLP (Elliptical Curve Discrete Logarithm Problem). As though many proxy signature schemes based on DLP or ECDLP have been proposed, it makes us discouraged that some disadvantages can be found after a new or modified proxy signature scheme was designed after short time. How to solve the question? How to design secure and valid proxy signature scheme? How to prove them secure? Now, it is too difficult for us to prove one scheme secure, but if we can have some principles to conform to when designing some proxy signature schemes based on DLP or ECDLP, it will be helpful. It will be able to make the scheme designer to make few mistakes, that's to say, by these principles, they can judge their schemes meet basic secure conditions. If designers don't conform to these principles, it can easily be seen that their schemes are definitely insecure. It is all known by us that until now there are not these principles in the real life. By some hints from some attacks, especially forgery attacks, it seems to us that we have found three basic principles which should be conformed to when proxy signature schemes are proposed. The first principle is that the existent forms of public parameters in proxy signatures in the proxy signature verification congruence make a key role on the security property of unforgeability. The second principle is that any public parameter in the proxy signature can't lonely exist in the proxy signature verification congruence in the form of bases or exponents. The third principle is that any public parameter in the proxy signature should exist in the proxy signature verification equation in the form of not only exponents and bases, but also hashes. In addition, some examples are given.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125140264","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}

{"title":"A policy-based approach for assuring data integrity in DBMSs","authors":"Hyo-Sang Lim, Chenyun Dai, E. Bertino","doi":"10.4108/ICST.TRUSTCOL.2010.4","DOIUrl":"https://doi.org/10.4108/ICST.TRUSTCOL.2010.4","url":null,"abstract":"Data integrity is crucial for collaborative activities where information is shared among multiple organizations to effectively make cooperative and mission-critical decisions. Assuring data integrity is particularly challenging in the presence of frequent data modifications by collaborative parties, especially for large-scale collaborations. However, data integrity is difficult to grasp with a single concept or a single model since the definition can vary depending on the goals and requirements of the collaboration. To address this multi-faced feature of data integrity, we propose a policy-based approach by which one can specify data integrity policies according to the requirements of collaborations and enforce the policies on DBMSs, an essential software component for large-scale collaboration activities. We first introduce our integrity policy language, which provides comprehensive framework for specifying and enforcing integrity policies based on access control, data validation, and metadata management functions. Next, to make our policy language work with existing off-the-shelf DBMSs, we present an integration strategy which we call language level integration (LLI). The LLI strategy enforces integrity policies by automatically translating high-level integrity policies, expressed in our policy language, onto low-level database operations. Compared to alternative approaches, the LLI strategy can be easily implemented since it does not require modifications to the source code of the DBMS or to the code of the applications running on top of the DBMS. Also, with the LLI strategy, the policies cannot be bypassed regardless of which database interface is used by the applications since the policies are implemented by DBMS functions and objects, and then, automatically enforced by the DBMS itself. We then present a software architecture of implementing the integrity policy language with the LLI strategy for a real DBMS (Oracle) and show that our strategy can easily implement well-known data integrity models.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127293974","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}

{"title":"An architecture design of GPU-accelerated VoD streaming servers with network coding","authors":"Jin Zhao, Xinya Zhang, Xin Wang","doi":"10.4108/ICST.COLLABORATECOM.2010.37","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.37","url":null,"abstract":"Graphics processing unit (GPU) has evolved into a general-purpose computing platform. Inspired by the GPU technology advantage, this paper concerns the design and performance evaluation of practical GPU-accelerated server architecture for Video-on-Demand (VoD) services with network coding. Following the proposal of an optimized network coding algorithm based on parallel threads on GPU, a GPU-Accelerated Server (GAS) for VoD streaming is designed to leverage the workload between GPU and CPU and thus improve the performance of the VoD server. Extensive real-world experimental results have proved that compared with the approaches with network coding performed only on CPU or GPU, the proposed GAS architecture is more advantageous in serving capacity, response time, and CPU usage. Our study has investigated a way of designing high performance VoD streaming servers with network coding and GPU-acceleration incorporated.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123648884","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}

{"title":"Modeling and implementing collaborative editing systems with transactional techniques","authors":"Qinyi Wu, C. Pu","doi":"10.4108/ICST.COLLABORATECOM.2010.10","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.10","url":null,"abstract":"Many collaborative editing systems have been developed for coauthoring documents. These systems generally have different infrastructures and support a subset of interactions found in collaborative environments. In this paper, we propose a transactional framework with two advantages. First, the framework is generic as demonstrated by its capability of modeling four types of existing products: RCS, MediaWiki, Google Docs, and Google Wave. Second, the framework can be layered on the top of a modern database management system to reuse its transaction processing capabilities for data consistency control in both centralized and replicated editing systems. We detail the programming interfaces and the synchronization protocol of our transactional framework and demonstrate its usage through concrete examples. We also describe a prototype implementation of this framework over Oracle Berkeley DB High Availability, a replicated transactional database management system.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131829323","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}