{"title":"An Adaptive Polling Scheme Supporting Audio/Video Streaming in Wireless LANs","authors":"Yaw-Chung Chen, Han-Ru Yeh","doi":"10.1109/FTDCS.2008.38","DOIUrl":"https://doi.org/10.1109/FTDCS.2008.38","url":null,"abstract":"Nowadays IEEE 802.11 family is the most popular technology amongst wireless protocols including Bluetooth, UWB and WiMAX for wireless services, among which media streaming such as voice over Internet Protocol (VoIP) and IPTV are most demanded with high challenge. To accommodate the QoS issues, EDCA and HCCA functions are defined in IEEE 802.11e. However, EDCA provides QoS based on probability, so it is still unable to fulfill the requirements of time sensitive applications such as VoIP. In this study, we focus on HCCA polling scheme. We design a new time-based polling scheduler called Adaptive Time-Stamp Polling (ATSP) scheme for QoS improvement, as well as design a mechanism that detects silence mode of a VoIP conversation so as to reduce the frequency of polling silent stations. When the station comes back to talk-spurt mode, we revert to the original frequency to poll. Simulation results show that our scheme improves the QoS on throughput, jitter, and access delay significantly.","PeriodicalId":414800,"journal":{"name":"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116454451","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 Extended MM-Path Approach to Component-Based Web Application Testing","authors":"Jingxian Gu, Lei Xu, Baowen Xu, Hongji Yang","doi":"10.1109/FTDCS.2008.29","DOIUrl":"https://doi.org/10.1109/FTDCS.2008.29","url":null,"abstract":"At present, most of Web applications have multi-tier architectures. The Web application contains many components, which makes it become component-based Web application. This paper focuses on this kind of Web applications and constructs three dependency graphs based on structure relations and message call relations. Then we improve the path-based integration testing method, propose an extended MM-path approach and use this approach to find out testing paths of component-based Web application.","PeriodicalId":414800,"journal":{"name":"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121888009","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":"Event-Based Data Dissemination on Inter-Administrative Domains: Is it Viable?","authors":"R. Baldoni, Leonardo Querzoni, S. Scipioni","doi":"10.1109/FTDCS.2008.14","DOIUrl":"https://doi.org/10.1109/FTDCS.2008.14","url":null,"abstract":"Middleware for timely and reliable data dissemination is a fundamental building block of the event driven architecture (EDA), an ideal platform for developing air traffic control, defense systems, etc. Many of these middlewares are compliant to the data distribution service (DDS) specification and they have been traditionally designed to be deployed on managed environments where they show predictable behaviors. However, the enterprise setting can be unmanaged and characterized by geographic inter-domain scale and heterogeneous resources. In this paper we present a study aimed at assessing the strengths and weaknesses of a commercial DDS implementation deployed on an unmanaged setting. Our experiments campaign outlines that, if the application manages a small number of homogeneous resources, this middleware perform timely and reliably. In a more general setting with fragmentation and heterogeneous resources, reliability and timeliness rapidly degenerate pointing out a need of research in self-configuring scalable event dissemination with QoS guarantee on unmanaged settings.","PeriodicalId":414800,"journal":{"name":"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128122727","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}
Ramesh Bharadwaj, S. Mukhopadhyay, Manuel Peralta, K. Shenai, S. Majumder
{"title":"Cognitive Distributed Networks in Environmental e-Science","authors":"Ramesh Bharadwaj, S. Mukhopadhyay, Manuel Peralta, K. Shenai, S. Majumder","doi":"10.1109/FTDCS.2008.41","DOIUrl":"https://doi.org/10.1109/FTDCS.2008.41","url":null,"abstract":"We integrate fundamental principles from formal mathematics, engineering, and information sciences to develop novel distributed sensor-based networks for management of the environment and the natural ecosystem. More precisely, we are developing ENVNET - ENVironmental sensor NETwork, a cognitive wireless sensor network to proactively collect information, monitor, and control the health of our natural environment and ecosystem (that includes, water, soil, air, etc.). It integrates intelligent sensor coordination and data fusion techniques to access, retrieve, process, and communicate with disparate wireless sensors in an ad-hoc manner to deliver dynamic decisions and provide adequate information management. Our approach facilitates large scale deployment and drastically reduces the hardware cost almost by a factor of 10 and removes the main bottleneck in irrigation control arising from wired sensors. Apart from this it provides a smart distributed closed-loop control mechanism with formal reliability guarantees that is rapidly and easily deployable, context-aware, scalable, and dynamically reconfigurable in response to changing requirements.","PeriodicalId":414800,"journal":{"name":"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129003053","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":"The Causal Order is Strict","authors":"Jeremiah James, S. Mukhopadhyay","doi":"10.1109/FTDCS.2008.33","DOIUrl":"https://doi.org/10.1109/FTDCS.2008.33","url":null,"abstract":"The causal order is central to many algorithms in both the message-passing and shared memory models. In the message-passing model, the causal order is clearly a strict, or irreflexive partial, order. However, some shared memory models are defined without reference to time. In those models, the causal order can fail to be a strict order. Existing works have either declared that all non-strict orders are not causal, or assumed that the causal order is strict without proof. We prove that, under a small number of reasonable assumptions about systems, the causal order is strict. In particular, we assume neither a global time model nor that processes issue a single shared memory operation at a time.","PeriodicalId":414800,"journal":{"name":"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132871773","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 Simple Secured Searching Protocol for Future RFID Applications","authors":"M. S. Hossain, Sheikh Iqbal Ahamed","doi":"10.1109/FTDCS.2008.21","DOIUrl":"https://doi.org/10.1109/FTDCS.2008.21","url":null,"abstract":"RFID has become a predominant technology in supply chain in the past few years. It's becoming so popular that even it's been used for home environment for personal use. But with the increasing popularity there is also a potential rise of security concern. This concern amongst consumer has led the researcher to concentrate on the potential threats of this technology. The main challenge of a secured RFID protocols is developing a well suited authentication and searching protocol for low cost passive tags which does not have high processing power. As authentication has been addressed more rigorously than the searching, we have chosen to concentrate on developing secured searching for RFID. To date there is no secured searching for passive RFID tags which is not prone to tracking violation, sniffing attack etc. In this paper, we have discussed the problem of a secured searching in depth and proposed a solution for low end tags.","PeriodicalId":414800,"journal":{"name":"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133987231","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":"Well-Balanced Allocation Strategy for Multi-Cluster Computing Environments","authors":"Chao-Tung Yang, Hao-Yu Tung, Keng-Yi Chou, W. Chu","doi":"10.1109/FTDCS.2008.36","DOIUrl":"https://doi.org/10.1109/FTDCS.2008.36","url":null,"abstract":"With the rapid proliferation of hardware devices, cluster computing has encountered the problem of heterogeneous resources. We have constructed a multi-cluster system that works with and without storage devices, and evaluated the system performance. We dispatch jobs with the strategy we propose to make the best use of system resources. In this paper we introduce this new scheduling system based on multi-clusters in diskless environments. This work we present is the Well-Balanced Allocation Strategy (WBAS) in which the scheduler dispatches jobs to appropriate resources across multi-clusters. The strategy focuses on dispatching jobs to nodes with similar performance capacities, thus equalizing execution times among all the nodes the jobs require. The WBAS was implemented on a system to evaluate the performance of the scheduling strategy. We use Ganglia to monitor resource statuses, and Condor as the queue system.","PeriodicalId":414800,"journal":{"name":"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130237045","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 Credit Evaluation Model for Computational Grid Nodes","authors":"Tao Wang, Xingshe Zhou, Yunlan Wang, Jianshuo Hu","doi":"10.1109/FTDCS.2008.26","DOIUrl":"https://doi.org/10.1109/FTDCS.2008.26","url":null,"abstract":"Computational grid is a cooperative computing environment which collects all kinds of high performance software and hardware computing resources distributed in WAN and provides networked computing services. The computational grid systems that have been the focus of much research activities in the past years for controlled sharing of resources across institutional boundaries. Credit is one major concern in grid resource management that enables remote scheduling and execution. For the sake of improving the self-adaptability of resource management and accelerating the application and development of computational grid, an evaluation model of a computational grid nodepsilas credit is put forward which is based on the execution results of computational grid jobs on the node. Using this model the resource consumers and resource providers should abandon the vicious evaluating voluntarily. Applied in NPU Campus Computational Grid, this model achieves good effect.","PeriodicalId":414800,"journal":{"name":"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130730200","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":"Design and Evaluation of a Dynamic Continuous Media Streaming Supporting Method on the Basis of Logical Grid Hierarchy for MANETs","authors":"Ihn-Han Bae, Kyung-Sook Lee","doi":"10.1109/FTDCS.2008.11","DOIUrl":"https://doi.org/10.1109/FTDCS.2008.11","url":null,"abstract":"As wireless connectivity is integrated into many handheld devices, streaming multimedia content among mobile ad-hoc peers is becoming a popular application. In this paper, we propose a dynamic service replication algorithm for providing guaranteed continuous streaming services to all nodes in mobile ad-hoc networks (MANETs). First, a MANET is comprised of logical grid hierarchy, and a streaming service is replicated to a lower server region of the logical grid hierarchy by considering the link availability between a mobile node and the streaming server within a server region or the popularity of the streaming service. We evaluate analytically the performance of the proposed algorithm, and compared with that of existing Qin's algorithm. Evaluation results show that our algorithm can achieve better streaming performance than Qin's algorithm. Therefore, the proposed algorithm not only improves the sharing availability of replicated streaming services but also controls efficiently the number of streaming service replications.","PeriodicalId":414800,"journal":{"name":"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129388540","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":"BlueCRM: A New Trend of Customer Relationship Management Systems","authors":"Mohammed Alawairdhi, Hongji Yang, M. Al-Akhras","doi":"10.1109/FTDCS.2008.23","DOIUrl":"https://doi.org/10.1109/FTDCS.2008.23","url":null,"abstract":"In this paper a new proactive customer relationship management system (CRM), BlueCRM, is proposed. The proposed system employs Bluetooth as an automatic identification token in addition to its common use as a communication channel. The system offers a low-cost proactive CRM system which is the future trend of such systems. The implementation of the prototype system comprises two sides: a database management program and an intuitive user interface in the software side. In the hardware side there are a Bluetooth-enabled device and a Bluetooth dongle. The architecture encloses an important advantage over the previous solutions due to its feasibility and ease of deployment. Furthermore, the architecture can be flexibly implemented either as a stand-alone or as integrated part of an existing information system.","PeriodicalId":414800,"journal":{"name":"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116496735","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}