{"title":"Three-Tier Grid Architecture with Policy-Based Resource Selection in Grid","authors":"P. Varalakshmi, S. Selvi, P. Kanchana, S. Waziah","doi":"10.1109/ICSCN.2008.4447166","DOIUrl":"https://doi.org/10.1109/ICSCN.2008.4447166","url":null,"abstract":"Trust management for the selection of resources is a key issue in a grid environment. In most of the trust-based systems, intermediaries, known as brokers, are responsible for the selection of Service Providers (SPs) for consumer requests. In such models, the intermediaries gain monetary benefit for each of the transactions made through them. This may lead to favoritism & bias in the selection of suitable SPs. This challenge may be overcome by the proposed three-tier framework where the Regional Resource Administrators (RRAs), resource brokers and the SPs are arranged into three-tiers. An RRA selects a 'suitable' SP for a consumer request, based on the trust-indices and Quality of Services of the SPs nominated by various brokers. RRAs derive their compensation from registration, renewal, and audit charges paid by the broker community, not from individual transactions. RRAs serve the consumer community in a manner similar to DNS, in an 'unbiased' and 'trustworthy' manner. In this paper, our proposed architecture not only supports a choice of SP based on reputation (trust-index) but also on credentials (policy). Thereby the consumer is assigned with a trustworthy SP and the transaction is free from runtime failure as the policies have been matched with. The concept of de-registration has been introduced in two scenarios, the SPs may deregister themselves by choice and the other is the RRAs force brokers to deregister. In this model, the trust-indices of each of the entities (consumers, SPs and brokers) arc computed based on the feedback provided by other entities after each transaction. These trust-indices of brokers, consumers and SPs are updated dynamically at the RRA's and the broker's sites respectively, to ensure trustworthy services and to quicken the selection of 'suitable' SPs. Our model shows a marked improvement in job-success-rate for various percentages of malicious entities.","PeriodicalId":158011,"journal":{"name":"2008 International Conference on Signal Processing, Communications and Networking","volume":"314 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124451591","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":"Dynamic Online Routing in Optical WDM Networks","authors":"S. Gandhi, V. Vaidehi","doi":"10.1109/ICSCN.2008.4447234","DOIUrl":"https://doi.org/10.1109/ICSCN.2008.4447234","url":null,"abstract":"We try to simulate a new approach to constraint based path selection for dynamic routing in optical networks based on WDM. We are mainly concentrating on shared path protection because it is resource efficient due to the fact that backup paths can share wavelength links when their corresponding working paths are mutually diverse. Considering restoration, our work includes proposal of an online routing algorithm based on link potential value (LPV) to achieve better resource utilization with reduced computational complexity. The main objective is to distribute the traffic evenly across the network in order to reduce the amount of recovery requests under multiple failure scenario. We also arrived recovery time in case of link failure.","PeriodicalId":158011,"journal":{"name":"2008 International Conference on Signal Processing, Communications and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131296884","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":"Highly Resilient Network Elements","authors":"Pathangi N, Janardhanan Gnana, Hari Sekar","doi":"10.1109/ICSCN.2008.4447200","DOIUrl":"https://doi.org/10.1109/ICSCN.2008.4447200","url":null,"abstract":"Current network traffic comprises of operations-critical data from diverse applications like SAP, multimedia over IP, collaboration, and storage. Current network interface speeds are at multiple Gigabits per second. For networks operating at this speed, operation resiliency is very important Disturbances as little as a few seconds can cause significant packet drops, which can lead to lost time and productivity for users. Network operators and administrators are constantly challenged with ensuring high availability of the network, and in the event of a failure, minimizing its impact and restoring services quickly. This is achieved by network planning/design and by using hardened and resilient networking elements. The key principles of resiliency are the (1) elimination of single points of failures, (2) early detection and failover around defective parts, (3) localization of failures and containment of their impact, and (4) restoration of failed components without impacting other subsystems. This paper addresses the architecture and design principles in building next-generation highly resilient networking equipment.","PeriodicalId":158011,"journal":{"name":"2008 International Conference on Signal Processing, Communications and Networking","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114396102","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}
N. V. Marathe, Uday B. Desai, S. Merchant, Bombay Powai
{"title":"Base Station Selection Strategy in Multihop Cellular Networks: A New Approach","authors":"N. V. Marathe, Uday B. Desai, S. Merchant, Bombay Powai","doi":"10.1109/ICSCN.2008.4447227","DOIUrl":"https://doi.org/10.1109/ICSCN.2008.4447227","url":null,"abstract":"Multihop cellular networks (MCN) have been proposed for quite a long time as of now. The major improvements these networks offer over the conventional cellular networks are increase in capacity and coverage area. However the congestion near the base station (BS) happens to be the bottleneck even in the approach of MCN. Therefore approach to reduce this congestion is a potential area of further research in this field. Our proposed architecture is one such attempt in this direction. In the proposed scheme instead of a single cell covered by a particular base station the entire coverage area of the cellular network consisting of many cells is considered as a whole and an attempt has been made to find out the direct links between the source and the destination of a connection without approaching any of the base stations. Since in MCN any mobile terminal (MT) can communicate with another MT directly; much importance should not be attached to the parent or associated base station. Rather the any suitable base station should be the last hop in this network only when an attempt to find out the direct links between the source and the destination of a connection fails. This failure may either because the path is too long or either of source and destination is outside the network. Out of the cluster of parent BS and six neighbouring BSs one base station is to be selected depending upon the distance and the channel occupancy. This approach distributes the traffic load almost uniformly over the entire region and overcomes the problem of localized congestion in an effective manner.","PeriodicalId":158011,"journal":{"name":"2008 International Conference on Signal Processing, Communications and Networking","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121060207","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":"Effect of Stimulus Parameters, Age and Gender on Cubic Difference Distortion Product Otoacoustic Emission Measurement for Hearing Screening and Diagnosis","authors":"Sukesh Kumar","doi":"10.1109/ICSCN.2008.4447191","DOIUrl":"https://doi.org/10.1109/ICSCN.2008.4447191","url":null,"abstract":"Distortion product otoacoustic emissions (DPOAEs) are a series of combination tones generated in the ear when stimulated with two pure tones of frequency f1 and f2 (in audio range). The most prominent distortion product is the cubic difference tone at 2f1-f2. Maximum level of the DPOAE signals are observed when the frequency ratio f2/f1 is chosen to be 1.22. The objective of this study is to determine the DPOAE response characteristics from normal and hearing impaired subjects and to find the influence of stimulus parameters, age and gender on cubic difference DPOAE responses. The DSP platform controls the microphone/speaker system which generates the acoustical stimuli for presentation to the ear canal and collects the acoustic responses recorded in the ear canal. The signal processing problem involves estimation of the weak DPOAE response under two strong stimuli and background noise. A total of 43 DPOAE responses from neonatal to adult subjects (both male and female) are analyzed. The DPOAE data of both adults and children are compared with individual pure tone audiometric data to investigate how DPOAE responses differentiated ears with normal hearing from impaired ears. DPOAE responses are analyzed under different stimulus parameters. Both age and gender difference affects DPOAE response. DPOAE assessment provides detailed frequency specific information on cochlear function. This property of DPOAEs is used for clinical applications to find hearing impairments and hearing screening.","PeriodicalId":158011,"journal":{"name":"2008 International Conference on Signal Processing, Communications and Networking","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123604029","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 Cross-Layer TCP Protocol with Adaptive Modulation for MANETs","authors":"Selvam A, Kathiravan K, Reshmi R","doi":"10.1109/ICSCN.2008.4447232","DOIUrl":"https://doi.org/10.1109/ICSCN.2008.4447232","url":null,"abstract":"TCP optimization in mobile ad hoc networks is a challenging issue because of some unique characteristics of MANETs. Some of the main reasons behind TCP's performance degradation in these networks are lossy channels, frequent route failures, network partitions. In this paper, a cross-layer TCP protocol with adaptive modulation for MANET is proposed. Medium access (MAC) layer is responsible to decide the modulation scheme to be used at the physical layer depending on the signal strength and queue length of the receiver. An ns2.30-based simulation analysis of the proposed protocol which provides better TCP performance with minimum congestion than the existing TCP protocols is described. The effects of mobility of nodes, no. of connections on TCP parameters such as throughput, packet delivery ratio and round trip time are investigated.","PeriodicalId":158011,"journal":{"name":"2008 International Conference on Signal Processing, Communications and Networking","volume":"7 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123685429","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}
C. Calderon, M. R. Elara, Changjiu Zhou, Lingyun Hu, B. Iniya
{"title":"Neural Oscillator for Rhythmic Motion Control of Biped Robot","authors":"C. Calderon, M. R. Elara, Changjiu Zhou, Lingyun Hu, B. Iniya","doi":"10.1109/ICSCN.2008.4447236","DOIUrl":"https://doi.org/10.1109/ICSCN.2008.4447236","url":null,"abstract":"This paper presents a structure of a neural oscillator which is used as Central Pattern Generator for a biped robot locomotion. This architecture is suitable to generate different rhythmic motions, according to the amplitude and frequency of the system. Results of the system on a simulated biped robot show the feasibility of this approach.","PeriodicalId":158011,"journal":{"name":"2008 International Conference on Signal Processing, Communications and Networking","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126337257","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}