Pub Date : 2011-12-29DOI: 10.1109/AHICI.2011.6113927
M. Asgari, M. Dehghan, M. Salehnamadi
Mobile computing systems consist of different components while Mobile Support Stations (MSSs) act a key role among others. This paper presents an efficient MSS-based non-blocking coordinated checkpointing scheme, in witch checkpointing overheads are forwarded to the MSSs and therefore workload of Mobile Hosts (MHs) would be reduced substantially. We also enhanced the proposed scheme to have much less propagating checkpoint requests and avoid avalanche effect. Simulation results show that compared to other existing algorithms, the scheme's average number of propagating requests and checkpoints are significantly lower so it would be suitable for mobile computing environment.
{"title":"An MSS-based non-blocking coordinated checkpointing approach for mobile computing systems","authors":"M. Asgari, M. Dehghan, M. Salehnamadi","doi":"10.1109/AHICI.2011.6113927","DOIUrl":"https://doi.org/10.1109/AHICI.2011.6113927","url":null,"abstract":"Mobile computing systems consist of different components while Mobile Support Stations (MSSs) act a key role among others. This paper presents an efficient MSS-based non-blocking coordinated checkpointing scheme, in witch checkpointing overheads are forwarded to the MSSs and therefore workload of Mobile Hosts (MHs) would be reduced substantially. We also enhanced the proposed scheme to have much less propagating checkpoint requests and avoid avalanche effect. Simulation results show that compared to other existing algorithms, the scheme's average number of propagating requests and checkpoints are significantly lower so it would be suitable for mobile computing environment.","PeriodicalId":371011,"journal":{"name":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125560387","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}
Pub Date : 2011-12-29DOI: 10.1109/AHICI.2011.6113934
S. C. Jha, Umesh Phuyal, V. Bhargava
Resource wastage due to loss of a packet in a multi-hop wireless network greatly depends on number of hops the packet has already traveled. Hence, consideration of hop-count information is crucial while optimizing overall resource utilization of such network. Therefore, we propose a cross-layer resource allocation approach for an orthogonal frequency division multiple access based multi-hop network which jointly allocates subcarriers and transmit power prioritizing packets with higher hop-counts. Simulation results show that the proposed scheme is capable of minimizing network-wide resource wastage significantly without degradation in goodput and system outage performance.
{"title":"Joint power and subcarrier allocation in multi-hop OFDMA network: A cross-layer approach","authors":"S. C. Jha, Umesh Phuyal, V. Bhargava","doi":"10.1109/AHICI.2011.6113934","DOIUrl":"https://doi.org/10.1109/AHICI.2011.6113934","url":null,"abstract":"Resource wastage due to loss of a packet in a multi-hop wireless network greatly depends on number of hops the packet has already traveled. Hence, consideration of hop-count information is crucial while optimizing overall resource utilization of such network. Therefore, we propose a cross-layer resource allocation approach for an orthogonal frequency division multiple access based multi-hop network which jointly allocates subcarriers and transmit power prioritizing packets with higher hop-counts. Simulation results show that the proposed scheme is capable of minimizing network-wide resource wastage significantly without degradation in goodput and system outage performance.","PeriodicalId":371011,"journal":{"name":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130313791","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}
Pub Date : 2011-12-29DOI: 10.1109/AHICI.2011.6113953
Radhika Srikanth, Suthikshn Kumar, S. A. Junjarampalli
This paper concentrates on the generic automation tool development for automating the process of validation of tools developed by Cisco. Cisco Smart Automation Tool can be used by engineers to automate the process of validating the tools that were developed by them. Cisco Smart Automation Tool reads the validation statements written by the developer or execution engineer from a text file or an excel sheet. These statements are written in plain English language following certain syntax.
{"title":"Cisco Smart Automation Tool","authors":"Radhika Srikanth, Suthikshn Kumar, S. A. Junjarampalli","doi":"10.1109/AHICI.2011.6113953","DOIUrl":"https://doi.org/10.1109/AHICI.2011.6113953","url":null,"abstract":"This paper concentrates on the generic automation tool development for automating the process of validation of tools developed by Cisco. Cisco Smart Automation Tool can be used by engineers to automate the process of validating the tools that were developed by them. Cisco Smart Automation Tool reads the validation statements written by the developer or execution engineer from a text file or an excel sheet. These statements are written in plain English language following certain syntax.","PeriodicalId":371011,"journal":{"name":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133599683","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}
Pub Date : 2011-12-29DOI: 10.1109/AHICI.2011.6113948
Dataset Vasudevan, E. Harshini, S. Selvakumar
In recent years the attack vectors in the network world have increased many fold with the increased usage of Internet and with the exponential growth of various applications. Network Intrusion Detection System (NIDS) is one of the most sought after system by security experts in safeguarding the network from both external and internal attacks. NIDS works mainly in two modes: Online and Offline. Online or real-time NIDS, such as Snort, Bro, etc., examines the packet structure to find intrusions, if any, and alerts the administrator. On the other hand, offline NIDS logs the packets flowing to and from the network, constructs features based on connections, and creates a dataset. Such NIDS datasets are used in research purposes for applying data mining, machine learning, evolutionary algorithms, etc., to detect attacks. KDD CUP 99 is one such widely used popular IDS dataset. KDD CUP 99 dataset is obsolete because many of the attacks performed to create the dataset do not exist now. Moreover, the features constructed do not pertain to network activities. It is a mixture of host based as well as network based features. So, the need for a new dataset, conforming to the present network activities and attack vectors, is inevitable. This motivated us to come out with a NIDS dataset, SSENet-2011 dataset, in this paper. SSENet-2011 dataset was constructed using Tstat tool. A real time experiment was performed, the network packets were captured, features were constructed, and the dataset was created. The created SSENet-2011 dataset was compared with the KDD CUP 99 dataset. From the experiments it is evident that a closed and secluded network such as SSENet and Tstat tool help researchers in developing and analyzing a new dataset which reflects the changing scenario of network activities.
近年来，随着Internet使用量的增加和各种应用程序的指数级增长，网络世界中的攻击向量增加了许多倍。网络入侵检测系统(NIDS)是安全专家为保护网络免受外部和内部攻击而追捧的系统之一。网络入侵防御主要有两种工作模式:在线和离线。在线或实时NIDS(如Snort、Bro等)检查数据包结构以发现入侵(如果有的话)，并向管理员发出警报。另一方面，脱机NIDS记录进出网络的数据包，根据连接构建特征，并创建数据集。这些NIDS数据集用于研究目的，用于应用数据挖掘，机器学习，进化算法等来检测攻击。KDD CUP 99就是这样一个广泛使用的流行IDS数据集。KDD CUP 99数据集已经过时，因为为创建该数据集而执行的许多攻击现在都不存在。此外，所构建的特征与网络活动无关。它混合了基于主机和基于网络的特性。因此，需要一个符合当前网络活动和攻击向量的新数据集是不可避免的。这促使我们在本文中提出了一个NIDS数据集，SSENet-2011数据集。使用Tstat工具构建SSENet-2011数据集。进行了实时实验，捕获了网络数据包，构造了特征，并创建了数据集。将创建的SSENet-2011数据集与KDD CUP 99数据集进行比较。从实验中可以明显看出，封闭和隐蔽的网络，如SSENet和Tstat工具，有助于研究人员开发和分析反映网络活动变化情景的新数据集。
{"title":"SSENet-2011: A Network Intrusion Detection System dataset and its comparison with KDD CUP 99 dataset","authors":"Dataset Vasudevan, E. Harshini, S. Selvakumar","doi":"10.1109/AHICI.2011.6113948","DOIUrl":"https://doi.org/10.1109/AHICI.2011.6113948","url":null,"abstract":"In recent years the attack vectors in the network world have increased many fold with the increased usage of Internet and with the exponential growth of various applications. Network Intrusion Detection System (NIDS) is one of the most sought after system by security experts in safeguarding the network from both external and internal attacks. NIDS works mainly in two modes: Online and Offline. Online or real-time NIDS, such as Snort, Bro, etc., examines the packet structure to find intrusions, if any, and alerts the administrator. On the other hand, offline NIDS logs the packets flowing to and from the network, constructs features based on connections, and creates a dataset. Such NIDS datasets are used in research purposes for applying data mining, machine learning, evolutionary algorithms, etc., to detect attacks. KDD CUP 99 is one such widely used popular IDS dataset. KDD CUP 99 dataset is obsolete because many of the attacks performed to create the dataset do not exist now. Moreover, the features constructed do not pertain to network activities. It is a mixture of host based as well as network based features. So, the need for a new dataset, conforming to the present network activities and attack vectors, is inevitable. This motivated us to come out with a NIDS dataset, SSENet-2011 dataset, in this paper. SSENet-2011 dataset was constructed using Tstat tool. A real time experiment was performed, the network packets were captured, features were constructed, and the dataset was created. The created SSENet-2011 dataset was compared with the KDD CUP 99 dataset. From the experiments it is evident that a closed and secluded network such as SSENet and Tstat tool help researchers in developing and analyzing a new dataset which reflects the changing scenario of network activities.","PeriodicalId":371011,"journal":{"name":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127028935","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}
Pub Date : 2011-12-29DOI: 10.1109/AHICI.2011.6113946
M. Sendil, N. Nagarajan
P2P has become a popular application among the Internet. The searching of the content and file sharing is perhaps the most popular application. An application uses flooding as their prevailing resource location method for content searching and file sharing. The basic problem with the flooding mechanism is that it creates a large volume of unnecessary traffic in the network mainly because a peer may receive the same queries multiple times through different paths. In this paper, the performance of the searching is improved using super peer based search with improved searching technique (A novel approach). When the performance of the search method improves, then automatically the P2P traffic can be reduced.
{"title":"A novel approach for improving search efficiency in unstructured peer to peer network","authors":"M. Sendil, N. Nagarajan","doi":"10.1109/AHICI.2011.6113946","DOIUrl":"https://doi.org/10.1109/AHICI.2011.6113946","url":null,"abstract":"P2P has become a popular application among the Internet. The searching of the content and file sharing is perhaps the most popular application. An application uses flooding as their prevailing resource location method for content searching and file sharing. The basic problem with the flooding mechanism is that it creates a large volume of unnecessary traffic in the network mainly because a peer may receive the same queries multiple times through different paths. In this paper, the performance of the searching is improved using super peer based search with improved searching technique (A novel approach). When the performance of the search method improves, then automatically the P2P traffic can be reduced.","PeriodicalId":371011,"journal":{"name":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131072246","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}
Pub Date : 2011-12-29DOI: 10.1109/AHICI.2011.6113955
M. Suma, B. Kanmani
In today's communication scenario, high data rate single-carrier transmission may not be feasible due to too much complexity of the equalizer in the receiver. To overcome the frequency selectivity of the wideband channel experienced by single-carrier transmission, multiple carriers can be used for high rate data transmission. Orthogonal frequency division multiplexing (OFDM) , is multicarrier system which has become a modulation in physical layer of next generation WiMAX, LTE system. In this paper effort is made to present challenges in OFDM and work done so far in channel equalisation and different transforms used in OFDM system.
{"title":"Developments in orthogonal frequency division multiplexing (OFDM) system-a survey","authors":"M. Suma, B. Kanmani","doi":"10.1109/AHICI.2011.6113955","DOIUrl":"https://doi.org/10.1109/AHICI.2011.6113955","url":null,"abstract":"In today's communication scenario, high data rate single-carrier transmission may not be feasible due to too much complexity of the equalizer in the receiver. To overcome the frequency selectivity of the wideband channel experienced by single-carrier transmission, multiple carriers can be used for high rate data transmission. Orthogonal frequency division multiplexing (OFDM) , is multicarrier system which has become a modulation in physical layer of next generation WiMAX, LTE system. In this paper effort is made to present challenges in OFDM and work done so far in channel equalisation and different transforms used in OFDM system.","PeriodicalId":371011,"journal":{"name":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126236981","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}
Pub Date : 2011-12-29DOI: 10.1109/AHICI.2011.6113940
R. Dahal, T. Sanguankotchakorn
Many shortest path routing protocols have been proposed neglecting the effect of lower layers. Here, the Modified Ad-hoc On Demand Distance Vector routing based on Bit Error Rate (MAODV-BER) is proposed, where the route discovery of AODV has been modified to achieve the stable route by obtaining Bit Error Rate (BER) information from physical layer through cross-layer approach. Due to the use of multimedia applications in Mobile Ad-hoc Networks (MANET) strict Quality of Service (QoS) is required. So, for QoS fulfillment, the bandwidth and delay requirements are added in each route message. Finally, the path having minimum BER as well as minimum hop count and fulfilling QoS requirements is selected.
{"title":"QoS routing in MANET through cross-layer design with BER and modifying AODV","authors":"R. Dahal, T. Sanguankotchakorn","doi":"10.1109/AHICI.2011.6113940","DOIUrl":"https://doi.org/10.1109/AHICI.2011.6113940","url":null,"abstract":"Many shortest path routing protocols have been proposed neglecting the effect of lower layers. Here, the Modified Ad-hoc On Demand Distance Vector routing based on Bit Error Rate (MAODV-BER) is proposed, where the route discovery of AODV has been modified to achieve the stable route by obtaining Bit Error Rate (BER) information from physical layer through cross-layer approach. Due to the use of multimedia applications in Mobile Ad-hoc Networks (MANET) strict Quality of Service (QoS) is required. So, for QoS fulfillment, the bandwidth and delay requirements are added in each route message. Finally, the path having minimum BER as well as minimum hop count and fulfilling QoS requirements is selected.","PeriodicalId":371011,"journal":{"name":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122302982","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}
Pub Date : 2011-12-29DOI: 10.1109/AHICI.2011.6113925
N. Doohan, D. Mishra, S. Tokekar
Wireless Sensor Networks (WSNs) are composed of many sensors which are densely or sparsely deployed to get the necessary information. They are constraint on resources such as energy, memory, computational speed and communications bandwidth. Particularly power is another major issue in WSNs, therefore main stress has been given to minimize the number of transmission to extend sensor service time in the network and support to discover multiple paths and multiple events simultaneously in any direction. Here we are proposing a new approach “Shortest Path Routing Protocol for Highly Data Centric Wireless Sensor Networks (SPRP)” which is based on the best part of protocols used for wired network i.e. TCP/IP. SPRP a new routing mechanism for wireless environment has been designed and proposed which is inspired from various routing like RIP, OSPF and a shortest path using Dijkstra's algorithm. Possible unforeseen scenarios in Wireless Sensor Networks domain like energy level status, damage of some node accidently/intensely has been considered and bypass to such occurrence has been integrated in the proposed solution.
{"title":"Shortest Path Routing Protocol (SPRP) for Highly Data Centric Wireless Sensor Networks","authors":"N. Doohan, D. Mishra, S. Tokekar","doi":"10.1109/AHICI.2011.6113925","DOIUrl":"https://doi.org/10.1109/AHICI.2011.6113925","url":null,"abstract":"Wireless Sensor Networks (WSNs) are composed of many sensors which are densely or sparsely deployed to get the necessary information. They are constraint on resources such as energy, memory, computational speed and communications bandwidth. Particularly power is another major issue in WSNs, therefore main stress has been given to minimize the number of transmission to extend sensor service time in the network and support to discover multiple paths and multiple events simultaneously in any direction. Here we are proposing a new approach “Shortest Path Routing Protocol for Highly Data Centric Wireless Sensor Networks (SPRP)” which is based on the best part of protocols used for wired network i.e. TCP/IP. SPRP a new routing mechanism for wireless environment has been designed and proposed which is inspired from various routing like RIP, OSPF and a shortest path using Dijkstra's algorithm. Possible unforeseen scenarios in Wireless Sensor Networks domain like energy level status, damage of some node accidently/intensely has been considered and bypass to such occurrence has been integrated in the proposed solution.","PeriodicalId":371011,"journal":{"name":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","volume":"343 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120954227","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}
Pub Date : 2011-12-29DOI: 10.1109/AHICI.2011.6113936
Amit Kumar Tamang, T. Sanguankotchakorn
This research aims to improve the quality of MPEG-4 video transmission over MANET using cross layer paradigm that transfer the MPEG-4 video priority information from application to medium access control (MAC) layer. This information is used by proposed adopting dynamic mapping algorithm (ADMA) along with other information as access category (AC) congestion from MAC and hop count to destination from network layer to map the video frames in proper ACs. The proposed ADMA is compared with the existing Enhanced Distributed Channel Access (EDCA) and static mapping approaches based on Peak Signal-to-Noise Ratio (PSNR), Throughput and Average end-to-end delay evaluation parameters.
{"title":"MPEG-4 video transmission over IEEE 802.11e EDCA in multihop OLSR MANET using cross layer approach","authors":"Amit Kumar Tamang, T. Sanguankotchakorn","doi":"10.1109/AHICI.2011.6113936","DOIUrl":"https://doi.org/10.1109/AHICI.2011.6113936","url":null,"abstract":"This research aims to improve the quality of MPEG-4 video transmission over MANET using cross layer paradigm that transfer the MPEG-4 video priority information from application to medium access control (MAC) layer. This information is used by proposed adopting dynamic mapping algorithm (ADMA) along with other information as access category (AC) congestion from MAC and hop count to destination from network layer to map the video frames in proper ACs. The proposed ADMA is compared with the existing Enhanced Distributed Channel Access (EDCA) and static mapping approaches based on Peak Signal-to-Noise Ratio (PSNR), Throughput and Average end-to-end delay evaluation parameters.","PeriodicalId":371011,"journal":{"name":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134207754","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}
Pub Date : 2011-12-29DOI: 10.1109/AHICI.2011.6113958
A.S. Kavitha Bai, J. Mungara
A distributed system is a collection of independent computers that appears to its users as a single coherent system and sharing the common resources. Multiple processes do not simultaneously access a shared resource so, requires the synchronization. We are having the four synchronization algorithms in distributed systems. This paper describes the pros & cons of each algorithm. In this we are comparing these four algorithms (Centralized, Decentralized, Distributed and Token Ring algorithms) with appropriate comparative measurements such as time complexity, delay, redundancy, scalability, failure rate & recovery. Based on this comparative study in future we are going to address the problems in the existing synchronization algorithms.
{"title":"A comparative study of synchronization algorithms in distributed systems","authors":"A.S. Kavitha Bai, J. Mungara","doi":"10.1109/AHICI.2011.6113958","DOIUrl":"https://doi.org/10.1109/AHICI.2011.6113958","url":null,"abstract":"A distributed system is a collection of independent computers that appears to its users as a single coherent system and sharing the common resources. Multiple processes do not simultaneously access a shared resource so, requires the synchronization. We are having the four synchronization algorithms in distributed systems. This paper describes the pros & cons of each algorithm. In this we are comparing these four algorithms (Centralized, Decentralized, Distributed and Token Ring algorithms) with appropriate comparative measurements such as time complexity, delay, redundancy, scalability, failure rate & recovery. Based on this comparative study in future we are going to address the problems in the existing synchronization algorithms.","PeriodicalId":371011,"journal":{"name":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","volume":"203 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134410689","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：