{"title":"Checkpointing Based Fault Tolerance Patterns for Systems with Arbitrary Deadlines","authors":"S. Agrawal, R. S. Yadav, N. Das","doi":"10.1109/ADCOM.2007.54","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.54","url":null,"abstract":"This paper aims to provide a fault tolerant scheduling algorithm that have fault tolerance patterns for periodic task sets with arbitrary deadlines. The fault tolerance is achieved by checkpointing where number of checkpoint is decided on the bases of the lemmas proposed. These patterns provide minimum tolerance to all the releases and an improved tolerance to some releases pertaining to the availability of the slack time. They may be binary (i.e., either provide maximum or minimum tolerance to a release) or greedy (i.e., provide an improved tolerance whenever it is possible) in nature. Theorems have been proposed to ensure that the task set is schedulable with at least minimum fault tolerance. The effectiveness of the proposed patterns have been measured through extensive examples and simulations.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127256732","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}
Brajech Kumar Shrivastava, Gandamallah Bharath Kumar, G. Khataniar, D. Goswami
{"title":"A 3-Tier Hierarchical Peer-to-Peer System with Fair Incentive Scheme to Avoid Free Riders","authors":"Brajech Kumar Shrivastava, Gandamallah Bharath Kumar, G. Khataniar, D. Goswami","doi":"10.1109/ADCOM.2007.5","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.5","url":null,"abstract":"Growing popularity of widely-deployed and decentralized peer-to-peer (P2P) architecture emphasizes on the need to find an emphatic overlay structure that can provide efficient content discovery mechanism, accommodate high churn rate and adapt to failures in the presence of heterogeneity among nodes. We propose a 3-tier hierarchical overlay structure in which nodes are classified into three categories: Trusted Supervisor, Superpeer and Normal Peer and we assign these nodes to first, second and third level of hierarchy, respectively. Our proposed approach provides fair incentive scheme and avoid free riders those are greedy to consume the resources. It also encourages the nodes to contribute more and perform well in P2P network.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129584655","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}
V. C. Raghavendran, T. Gonsalves, Usha Rani, S. Mohan Kumar, Shankar Narasimhan
{"title":"Design and Implementation of a Network Management System for Water Distribution Networks","authors":"V. C. Raghavendran, T. Gonsalves, Usha Rani, S. Mohan Kumar, Shankar Narasimhan","doi":"10.1109/ADCOM.2007.62","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.62","url":null,"abstract":"With growing urbanization, efficient and fair distribution of water to households is critical. A typical water distribution network (WDN) consists of pipes connected by devices such as pumps, valves and tanks. The health of the network is determined by monitoring parameters such as rate of flow, pressure at a point, demand at a point. Drawing parallel with telecommunication networks, we modelled the WDN using network management (NMS) techniques. We then used a commercial NMS, CygNet from NMSWorks, to monitor the WDN. The NMS supports analysis of network performance and control via a plugin interface. This is being implemented in a pilot project at IIT-Madras.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128542820","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 Agile Technique for Agent Based Goal Refinement to Elicit Soft Goals in Goal Oriented Requirements Engineering","authors":"A. Sen, S. K. Jain","doi":"10.1109/ADCOM.2007.36","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.36","url":null,"abstract":"Goal oriented requirements engineering methods have gained significance because they define the requirements in terms of goals which are well understood by the stakeholders. Although the goals are extracted from the stakeholders having good domain knowledge, but extracting these goals is a challenging task in the goal oriented methods, especially the soft goals about which even the stakeholders have very little knowledge. To extract the soft goals, the high level goals are decomposed and a guiding model for goal refinement involving active participation of stakeholders, is essential. We propose a methodology driven approach involving maximum participation of stakeholders for eliciting the soft goals, where the soft goals are elicited by the stakeholders from the high-level goals through the process of Goal Refinement, involving Agents. The elicited goals are compiled through a software program called Activity Card Compiler. The methodology is used for Soft Goal Elicitation for the development of an Web Based News Application. We present an analysis of our results.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127039557","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":"Use of genetic algorithm for software maintainability metrics' conditioning","authors":"S. Singh Dahiya, J. Chhabra, S. Kumar","doi":"10.1109/ADCOM.2007.132","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.132","url":null,"abstract":"The cost of software maintenance phase has always been a crucial issue for software project managers. With increasing complexity of modern software, there is an increased demand of measurement tools for software maintainability, so that it can be estimated in early phases of the project development and corrective measures can be initiated to make it more manageable and maintainable. The importance of measuring maintainability in the starting phases of software evolution has been widely acknowledged by researchers and software managers, but only few metrics have been proposed to measure it. Recently many researchers have proposed some integrated models for maintainability measurement, which need to be calibrated in spite of their reported validations, as no attention has been paid to evaluate and improve the stability of these methods. This paper proposes a methodology to improve the stability of a fuzzy logic based maintainability metrics system. Fuzzy system parameters are tuned using genetic algorithm with system condition number as objective function for optimization.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123988961","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":"Time-Domain Equalization Technique for Intercarrier Interference Suppression in OFDM Systems","authors":"R. Kumar, S. Malarvizhi","doi":"10.3923/ITJ.2008.149.154","DOIUrl":"https://doi.org/10.3923/ITJ.2008.149.154","url":null,"abstract":"Orthogonal frequency division multiplexing (OFDM) is a modern high data rate modulation technique for wireless communication systems. Due to loss of orthogonality of subcarriers intercarrier interference occurs. In this paper the performance of the proposed time-domain equalization technique is compared with the existing frequency domain equalization technique. In frequency domain equalization a correlative polynomial is used in the frequency domain to suppress the ICI. In time domain equalization technique, a window function is proposed in equivalent to the correlative polynomial used in the frequency domain. MATLAB simulation of the proposed technique shows that the time domain windowing scheme achieves better performance in ICI suppression compared to the correlative coding technique. Time domain windowing technique proposed in this paper, offers better carrier to interference ratio (CIR) and BER is reduced compared to the correlative coding method.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133600086","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":"Hardware Controlled and Software Independent Fault Tolerant FPGA Architecture","authors":"N. Goel, K. Paul","doi":"10.1109/ADCOM.2007.76","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.76","url":null,"abstract":"With the increase in complexity of fabrication techniques, yield of the chip production decreases at deep sub-micron technologies. In future fault tolerant techniques will be important to increase the yield of the VLSI chips in advanced fabrication technologies. In regular structure like FPGA, redundancy is commonly used for fault tolerance. Most of the techniques found so far in literature talk about software based changes in the configuration data. In this work we present a solution in which configuration bit stream of FPGA is modified by a hardware controller that is present on the chip itself. The technique uses redundant columns for replacing faulty cells. Experiments on different circuits using VPR tool shows that there is an average 2.6% increase in the critical path delay while no increase in the area per cell due to our approach.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115522324","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":"Traffic Flow Optimization in Networks with Combined OSPF/MPLS Routing","authors":"M. Zagozdzon, M. Dzida, M. Pióro","doi":"10.1109/ADCOM.2007.123","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.123","url":null,"abstract":"In this paper we address intra-domain routing optimization issues in Internet networks related to a combination of open shortest path first (OSPF) and multi protocol label switching (MPLS) routing protocols. Since MPLS can be combined with any routing protocol there has appeared an idea of coupling IP streams routed via the OSPF protocol and MPLS label switched paths (LSPs) in the same network. Such combined routing is potentially more flexible and efficient than OSPF itself from the traffic engineering (TE) viewpoint. In the paper we present the exact approach to the considered hybrid routing design using a strict mathematical formulation of the underlying optimization problem, and also a heuristic approach decomposing the problem into two subproblems solved with evolutionary algorithm and simulated allocation. The effectiveness of both approaches is illustrated by means of a numerical study.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129707994","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":"WebLab: A Generic Architecture for Remote Laboratories","authors":"A. Agrawal, S. Srivastava","doi":"10.1109/ADCOM.2007.140","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.140","url":null,"abstract":"Remote laboratories have earlier been proposed to allow sharing and better utilization of experiment resources. However, wide -scale acceptability depends on, among other things, a framework to manage all the tasks associated with a laboratory. The need for such a laboratory is even more important in developing countries where infrastructural resources are limited and improving the resource utilization is important. We propose a Web based 3-tier architecture (WebLab) that provides shared batch mode access to the experiments over low-bandwidth networks to maximize the laboratory utilization. A generic experiment is modeled as a set of inputs, outputs, and constraints. A laboratory is modeled as a collection of experiments sharing a common administrative and access policy. A lab/experiment registration toolkit is designed to capture the metadata for the labs and experiments with minimal programming involved. This allows for a rapid and standardized integration of the experiments with the WebLab. A proof of concept lab is implemented on this architecture.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128667572","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":"VIHARI: An Ontology Sevice Driven Multi-Agent System for Air Ticket Booking","authors":"Lakshmi Pathi J, Chithra Lekha T","doi":"10.1109/ADCOM.2007.137","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.137","url":null,"abstract":"This paper describes how semantic interoperability among agents could be improved. The FIPA ontology service specification is used as a reference model to achieve that aim. Ontology service agent (OSA) is a mediator agent which provides a set of ontological services (e.g. terms queying) for a community of agents to achieve interoperability. This OSA has access to a set of ontologies stored in ontology repositories. This paper gives an architecture for ontology service driven multi-agent system called VIHARI, which consists of Personal Travel Agents(PTA) of users and various service provider agents(e.g. Spice Jet Agent, Jet Airways Agent), the developed Travel ontology, and the hybrid methodology approach followed in building it.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128984085","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}