{"title":"The vMatrix: server switching","authors":"A. Awadallah, M. Rosenblum","doi":"10.1109/FTDCS.2004.1316601","DOIUrl":"https://doi.org/10.1109/FTDCS.2004.1316601","url":null,"abstract":"Today most Internet services are pre-assigned to servers statically, hence preventing us from doing real-time sharing of a pool of servers across as group of services with dynamic load. Fluidly copying services in and out of servers remains a challenge due to the many dependencies that such services have on software, hardware, and most importantly, people. In this paper we present a novel solution, which builds on top of the classic operating systems concept of a virtual machine monitor (VMM). A VMM allows us to encapsulate the state of the machine in a virtual machine file, which could then be activated on any real machine running the VHM software. This eliminates the software dependencies problem by allowing us to move the whole machine around including the operating system, libraries, and third party modules that the service depends on. It eliminates the hardware dependencies problem by allowing us to mimic the hardware that the service expects regardless of the real hardware of the hosting machine. It also solves the people dependency problem by presenting the developers and system administrators with the same isolation model that they are used too with statically allocated servers. We describe our vMatrix framework in detail and address how to load balance the virtual machine services across the real-machines to maximize utilization efficiency (in terms of machines and people costs) such that total cost of the system is reduced without degrading the service performance and without requiring cost prohibitive code and architectural changes to existing legacy services. Our solution also offers additional side benefits like on-demand replication for absorbing flash crowds (in case of a newsworthy event like a major catastrophe) and faster failure recovery times.","PeriodicalId":243020,"journal":{"name":"Proceedings. 10th IEEE International Workshop on Future Trends of Distributed Computing Systems, 2004. FTDCS 2004.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123312154","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 fuzzy data mining based intrusion detection model","authors":"Hai Jin, Jianhua Sun, Hao Chen, Zongfen Han","doi":"10.1109/FTDCS.2004.1316613","DOIUrl":"https://doi.org/10.1109/FTDCS.2004.1316613","url":null,"abstract":"With explosively increasing information, data mining techniques are frequently employed to identify trends in the warehouse that may not be readily apparent. In this paper we apply fuzzy data mining techniques to a security system and build a fuzzy data mining based intrusion detection model. Through normalizing the data set and building a fuzzy similar matrix of the network connections in the data set, network connections are clustered into different classes.","PeriodicalId":243020,"journal":{"name":"Proceedings. 10th IEEE International Workshop on Future Trends of Distributed Computing Systems, 2004. FTDCS 2004.","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122055435","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 an integrated architecture for peer-to-peer and ad hoc overlay network applications","authors":"Lu Yan, K. Sere, Xinrong Zhou, Jun Pang","doi":"10.1109/FTDCS.2004.1316632","DOIUrl":"https://doi.org/10.1109/FTDCS.2004.1316632","url":null,"abstract":"Peer-to-peer (P2P) networks and mobile ad hoc networks (MANET) share some key characteristics: self-organization and decentralization, and both need to solve the same fundamental problem: connectivity. We motivate a study for the convergence of the two overlay network technologies and sketch an evolving architecture towards integrating the two technologies in building overlay network applications.","PeriodicalId":243020,"journal":{"name":"Proceedings. 10th IEEE International Workshop on Future Trends of Distributed Computing Systems, 2004. FTDCS 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129922870","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 complexity measure for ontology based on UML","authors":"Dazhou Kang, Baowen Xu, Jianjiang Lu, W. Chu","doi":"10.1109/FTDCS.2004.1316620","DOIUrl":"https://doi.org/10.1109/FTDCS.2004.1316620","url":null,"abstract":"UML is a good tool to represent ontologies. When using UML for ontology development, one of the principal goals is to assure the quality of ontologies. UML class diagrams provide a static modeling capability that is well suited for representing ontologies, so the structural complexity of a UML class diagram is one of the most important measures to evaluate the quality of the ontologies. This paper uses weighted class dependence graphs to represent given class diagrams, and then presents a structure complexity measure for the UML class diagrams based on entropy distance. It considers complexity of both classes and relationships between the classes, and presents rules for transforming complexity value of classes and different kinds of relations into weighted class dependence graphs. This method can measure the structure complexity of class diagrams objectively.","PeriodicalId":243020,"journal":{"name":"Proceedings. 10th IEEE International Workshop on Future Trends of Distributed Computing Systems, 2004. FTDCS 2004.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126786925","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}
K. Kalapriya, S. Nandy, V. Satish, R. Maheshwari, Deepti Srinivas
{"title":"An architectural view of the entities required for execution of task in pervasive space","authors":"K. Kalapriya, S. Nandy, V. Satish, R. Maheshwari, Deepti Srinivas","doi":"10.1109/FTDCS.2004.1316591","DOIUrl":"https://doi.org/10.1109/FTDCS.2004.1316591","url":null,"abstract":"Aiming to provide computation ubiquitously, pervasive computing is perceived as a means to provide a user with the transparency of anywhere, any place, anytime computing. Pervasive computing is characterized by execution of task in heterogeneous environments that use invisible and ubiquitously distributed computational devices. It relies on service composition that creates customized services from existing services by process of dynamic discovery, integration and execution of those services. In such an environment, seamlessly providing resource for the execution of the tasks with limited networked capabilities is further complicated by continuously changing context due to mobility of the user. To the best of our knowledge no prior work to provide such a pervasive space has been reported in the literature. In this paper we propose an architectural perspective for pervasive computing by defining entities required for execution of tasks in pervasive space. In particular we address the following issues, namely entities required for execution of the task, architecture for providing seamless access to resources in the face of changing context in wireless and wireline infrastructure, and dynamic aggregation of resources under heterogeneous environment. We also evaluate the architectural requirements of a pervasive space through a case study.","PeriodicalId":243020,"journal":{"name":"Proceedings. 10th IEEE International Workshop on Future Trends of Distributed Computing Systems, 2004. FTDCS 2004.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131827607","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 adaptive, lightweight and energy-efficient context discovery protocol for ubiquitous computing environments","authors":"S. Yau, Deepak Chandraseka, Dazhi Huang","doi":"10.1109/FTDCS.2004.1316625","DOIUrl":"https://doi.org/10.1109/FTDCS.2004.1316625","url":null,"abstract":"In ubiquitous computing (ubicomp) environments, it is often necessary for the applications to have situation-awareness capability. Current research on situation-aware applications is mainly based on situations with a predefined set of contexts. To achieve more flexible situation-awareness, situation-aware applications should have the ability to discover and collect contexts in a timely and organized fashion. Due to the dynamic and ephemeral nature of ubicomp environments, a context discovery protocol (CDP) that defines the entire process of discovering, acquiring, aggregating and storing contexts, is needed. Because of the serious resource constraints on ubicomp devices, the CDP must be adaptive, lightweight and energy-efficient. In this paper, a CDP with such characteristics for ubicomp environments is presented. The experimental results to show that our CDP is more energy-efficient and has a small increase in latency, compared to a simple context discovery protocol, are also presented.","PeriodicalId":243020,"journal":{"name":"Proceedings. 10th IEEE International Workshop on Future Trends of Distributed Computing Systems, 2004. FTDCS 2004.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132706323","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}
Zheng Zhang, M. Mahalingam, Zhichen Xu, Wenting Tang
{"title":"Scalable, structured data placement over P2P storage utilities","authors":"Zheng Zhang, M. Mahalingam, Zhichen Xu, Wenting Tang","doi":"10.1109/FTDCS.2004.1316623","DOIUrl":"https://doi.org/10.1109/FTDCS.2004.1316623","url":null,"abstract":"P2P overlays offer a convenient way to host an infrastructure that can scale to the size of the Internet and yet be manageable. Current proposals, however, do not offer support for structuring data, other than assuming a distributed hash table. In reality, both applications and users typically organize data in a structured form. One such popular structure is the tree as employed in a file system, and a database. A naive approach such as hashing the pathname not only ignores locality in important operations such as file/directory lookup, but also results in uncontrollable, massive object relocations when rename on a path component occur. In this paper, we investigate policies and strategies that place a tree onto the flat storage space of P2P systems. We found that, in general, there exists a tradeoff between lookup performance and balanced storage utilization, and attempt to balance these two requirements calls for an intelligent placement decision.","PeriodicalId":243020,"journal":{"name":"Proceedings. 10th IEEE International Workshop on Future Trends of Distributed Computing Systems, 2004. FTDCS 2004.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114950812","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 dynamic trust model for mobile ad hoc networks","authors":"Zhaoyu Liu, A. Joy, Robert A. Thompson","doi":"10.1109/FTDCS.2004.1316597","DOIUrl":"https://doi.org/10.1109/FTDCS.2004.1316597","url":null,"abstract":"This paper introduces a trust model for mobile ad hoc networks. Initially each node is assigned a trust level. Then we use several approaches to dynamically update trust levels by using reports from threat detection tools, such as intrusion detection systems (IDS), located on all nodes in the network. The nodes neighboring to a node exhibiting suspicious behavior initiate trust reports. These trust reports are propagated through the network using one of our proposed methods. A source node can use the trust levels it establishes for other nodes to evaluate the security of routes to destination nodes. Using these trust levels as a guide, the source node can then select a route that meets the security requirements of the message to be transmitted. This paper demonstrates important concepts for establishing a collaborative, dynamic trust model and for using this model as an example to enhance the security of message routing in mobile ad hoc networks.","PeriodicalId":243020,"journal":{"name":"Proceedings. 10th IEEE International Workshop on Future Trends of Distributed Computing Systems, 2004. FTDCS 2004.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128833595","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}
E. Bertino, P. Mazzoleni, B. Crispo, S. Sivasubramanian, E. Ferrari
{"title":"Towards supporting fine-grained access control for Grid resources","authors":"E. Bertino, P. Mazzoleni, B. Crispo, S. Sivasubramanian, E. Ferrari","doi":"10.1109/FTDCS.2004.1316594","DOIUrl":"https://doi.org/10.1109/FTDCS.2004.1316594","url":null,"abstract":"The heterogeneous nature and independent administration of geographically dispersed resources in a Grid demand the need for access control using fine-grained policies. In this paper, we investigate the problem of fine-grained access control in the context of resource allocation in the Grid, as we believe it is the first and key step in developing access control methods specifically tailored for Grid systems. To perform this access control, we design a security component (to be part of a meta-scheduler service) that finds the list of nodes where a user is authorized to run his/her jobs. The security component is designed in an effort to reduce the number of rules that need to be evaluated for each user request. We believe such a fine-grained policy-based access control would help the adoption of the Grid to a higher extent into new avenues such as desktop Grids, as the resource owners are given higher flexibility in controlling access to their resources. Similarly, Grid users get a higher flexibility in choosing the resources in which their jobs must execute.","PeriodicalId":243020,"journal":{"name":"Proceedings. 10th IEEE International Workshop on Future Trends of Distributed Computing Systems, 2004. FTDCS 2004.","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133249009","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}
J. P. Almeida, M. V. Sinderen, L. F. Pires, M. Wegdam
{"title":"Platform-independent dynamic reconfiguration of distributed applications","authors":"J. P. Almeida, M. V. Sinderen, L. F. Pires, M. Wegdam","doi":"10.1109/FTDCS.2004.1316628","DOIUrl":"https://doi.org/10.1109/FTDCS.2004.1316628","url":null,"abstract":"The aim of dynamic reconfiguration is to allow a system to evolve incrementally from one configuration to another at run-time, without restarting it or taking it offline. In recent years, support for transparent dynamic reconfiguration has been added to middleware platforms, shifting the complexity required to enable dynamic reconfiguration to the supporting infrastructure. These approaches to dynamic reconfiguration are mostly platform-specific and depend on particular implementation approaches suitable for particular platforms. In this paper, we propose an approach to dynamic reconfiguration of distributed applications that is suitable for application implemented on top of different platforms. This approach supports a platform-independent view of an application that profits from reconfiguration transparency. In this view, requirements on the ability to reconfigure components are expressed in an abstract manner. These requirements are then satisfied by platform-specific realizations.","PeriodicalId":243020,"journal":{"name":"Proceedings. 10th IEEE International Workshop on Future Trends of Distributed Computing Systems, 2004. FTDCS 2004.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133880531","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}