Pub Date : 2013-05-06DOI: 10.1109/ICTEL.2013.6632075
D. Pinto, B. Barán, C. Brizuela
Wavelength Division Multiplexing (WDM) networks are designed for long-term operations in which the uncertainty of future traffic plays an important role. The performance of these networks is highly dependent on the routing and the wavelength-converter allocation algorithms. In order to achieve a good performance on a long-term basis, both problems have to be dealt with together and traffic uncertainty should be included. To this aim, this work proposes a joint optimization approach where the converters allocation plan and paths for routing are calculated simultaneously. A Multi-Objective Evolutionary Algorithm (MOEA) is proposed to minimize the number of wavelength converters, the average blocking probability, and an unfairness measure, all three at the same time, the uncertainty is modelled by means of a set of scenarios. The proposed MOEA calculates an approximation to the optimal set of solutions. This work presents experimental results showing the feasibility of the proposed approach in a multi-objective and uncertain context.
{"title":"A multi-objective approach for routing and wavelength converter allocation under uncertainty","authors":"D. Pinto, B. Barán, C. Brizuela","doi":"10.1109/ICTEL.2013.6632075","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632075","url":null,"abstract":"Wavelength Division Multiplexing (WDM) networks are designed for long-term operations in which the uncertainty of future traffic plays an important role. The performance of these networks is highly dependent on the routing and the wavelength-converter allocation algorithms. In order to achieve a good performance on a long-term basis, both problems have to be dealt with together and traffic uncertainty should be included. To this aim, this work proposes a joint optimization approach where the converters allocation plan and paths for routing are calculated simultaneously. A Multi-Objective Evolutionary Algorithm (MOEA) is proposed to minimize the number of wavelength converters, the average blocking probability, and an unfairness measure, all three at the same time, the uncertainty is modelled by means of a set of scenarios. The proposed MOEA calculates an approximation to the optimal set of solutions. This work presents experimental results showing the feasibility of the proposed approach in a multi-objective and uncertain context.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115510840","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632068
Edgard Jamhour, M. Penna
The successful creation of lightpaths depends on updated information about network resources, such as the availability of wavelengths in the links along a path and the capability of the nodes to perform wavelength conversion. If signaling is performed with outdated information, a setup request of a lightpath may fail by selecting a path with insufficient network resources. An important GMPLS addition to the RSVP-TE was the possibility of correcting lightpath setup requests using crankback. Crankback extensions permit a node that was unable to forward a setup request to return the blocking information to the upstream nodes. In the segment-based crankback, any of the upstream nodes may attempt to correct the signaling by rerouting the request through an alternate path. Such a strategy, however, is not advantageous for any network topology. In this paper, we evaluate eight different network topologies to determine which network features favor the crankback strategy. To perform our evaluation, we consider several network metrics, including some used in SNA (Social Network Analisys).
{"title":"Evaluation of segment-based crankback re-routing for GMPLS-based WSON","authors":"Edgard Jamhour, M. Penna","doi":"10.1109/ICTEL.2013.6632068","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632068","url":null,"abstract":"The successful creation of lightpaths depends on updated information about network resources, such as the availability of wavelengths in the links along a path and the capability of the nodes to perform wavelength conversion. If signaling is performed with outdated information, a setup request of a lightpath may fail by selecting a path with insufficient network resources. An important GMPLS addition to the RSVP-TE was the possibility of correcting lightpath setup requests using crankback. Crankback extensions permit a node that was unable to forward a setup request to return the blocking information to the upstream nodes. In the segment-based crankback, any of the upstream nodes may attempt to correct the signaling by rerouting the request through an alternate path. Such a strategy, however, is not advantageous for any network topology. In this paper, we evaluate eight different network topologies to determine which network features favor the crankback strategy. To perform our evaluation, we consider several network metrics, including some used in SNA (Social Network Analisys).","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115519676","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632122
Karim Benzidane, Saad Khoudali, F. Leila, A. Sekkaki
Virtualization is one of the key elements of Infrastructure as a Service (IaaS), Cloud Computing (CC) offerings and private Clouds, and it is increasingly used in portions of the back-end of Platform as a Service (PaaS) and SaaS (Software as a Service) providers as well. This creates new targets for intrusion due to the complexity of access and difficulty in monitoring all interconnection points between systems, applications, and data sets. This raises many questions about the appropriate infrastructure, processes, and strategy for enacting detection and response to intrusion in a Cloud environment. This article discusses the security and the visibility issues of inter-VM traffic and solutions for it within a Cloud environment context, by proposing an approach relying on distributed intrusion detection technique and packet inspection.
{"title":"Toward inter-VM visibility in a Cloud environment using packet inspection","authors":"Karim Benzidane, Saad Khoudali, F. Leila, A. Sekkaki","doi":"10.1109/ICTEL.2013.6632122","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632122","url":null,"abstract":"Virtualization is one of the key elements of Infrastructure as a Service (IaaS), Cloud Computing (CC) offerings and private Clouds, and it is increasingly used in portions of the back-end of Platform as a Service (PaaS) and SaaS (Software as a Service) providers as well. This creates new targets for intrusion due to the complexity of access and difficulty in monitoring all interconnection points between systems, applications, and data sets. This raises many questions about the appropriate infrastructure, processes, and strategy for enacting detection and response to intrusion in a Cloud environment. This article discusses the security and the visibility issues of inter-VM traffic and solutions for it within a Cloud environment context, by proposing an approach relying on distributed intrusion detection technique and packet inspection.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124408554","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632107
Younes El Hajjaji El Idrissi, N. Zahid, M. Jedra
The 3G network technology provides a completed connectivity solution with low data rates. While wireless network offers a high data rate in a small geographic area, interworking the 3G and WLAN can provide a complementary solution for network service and user equipment. This interworking introduces a new challenge to assure a secure and fast handover without impacting the service security in both networks. EAP-AKA is the authentication mechanism adopted by the 3rd Generation Partnership Project (3GPP) for vertical handover between the 3G and WLAN. The EAP-AKA method suffers from several weaknesses, such as user identity display, high authentication delay and additional bandwidth consumption. In this paper we propose a new fast local re-authentication method (EAP-FLAKA) based on the standard EAP-AKA. The proposed method improves the authentication performance, achieves fast re-authentication protocol and defines a new keying framework. The security properties of the new method are checked by using a formal verification (AVISPA) which has proved a high talent in automatically finding potential attacks in security protocols.
{"title":"A new fast re-authentication method for the 3G-WLAN interworking based on EAP-AKA","authors":"Younes El Hajjaji El Idrissi, N. Zahid, M. Jedra","doi":"10.1109/ICTEL.2013.6632107","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632107","url":null,"abstract":"The 3G network technology provides a completed connectivity solution with low data rates. While wireless network offers a high data rate in a small geographic area, interworking the 3G and WLAN can provide a complementary solution for network service and user equipment. This interworking introduces a new challenge to assure a secure and fast handover without impacting the service security in both networks. EAP-AKA is the authentication mechanism adopted by the 3rd Generation Partnership Project (3GPP) for vertical handover between the 3G and WLAN. The EAP-AKA method suffers from several weaknesses, such as user identity display, high authentication delay and additional bandwidth consumption. In this paper we propose a new fast local re-authentication method (EAP-FLAKA) based on the standard EAP-AKA. The proposed method improves the authentication performance, achieves fast re-authentication protocol and defines a new keying framework. The security properties of the new method are checked by using a formal verification (AVISPA) which has proved a high talent in automatically finding potential attacks in security protocols.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"384 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115909867","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632078
Gregoris Liasis, S. Stavrou
Obtaining segmentations of buildings from satellite images for telecommunication applications is a complex process due to the fact that satellite or aerial images are complicated scenes. The algorithm presented in this work uses level set Chan-Vese formulation, to establish the corresponding boundaries of the buildings. Level set segmentation tends to be sensitive on initialization, thus proper initialization can yield better segmentation results. In this work an effective procedure is performed using K-mean classifier in order to design and develop the initial level set contours. Morphological features are incorporated for refining the obtained outlines. Finally, the coordinates of each and every building are extracted along with additional information for the processed scene, like the number of buildings, as well as the center and area of each building. The optimization algorithm was evaluated qualitative and quantitative against the original Chan-Vese model and proved to provide more accurate results.
{"title":"Optimizing level set initialization for satellite image segmentation","authors":"Gregoris Liasis, S. Stavrou","doi":"10.1109/ICTEL.2013.6632078","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632078","url":null,"abstract":"Obtaining segmentations of buildings from satellite images for telecommunication applications is a complex process due to the fact that satellite or aerial images are complicated scenes. The algorithm presented in this work uses level set Chan-Vese formulation, to establish the corresponding boundaries of the buildings. Level set segmentation tends to be sensitive on initialization, thus proper initialization can yield better segmentation results. In this work an effective procedure is performed using K-mean classifier in order to design and develop the initial level set contours. Morphological features are incorporated for refining the obtained outlines. Finally, the coordinates of each and every building are extracted along with additional information for the processed scene, like the number of buildings, as well as the center and area of each building. The optimization algorithm was evaluated qualitative and quantitative against the original Chan-Vese model and proved to provide more accurate results.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116515998","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632096
Chungang Yang, Jiandong Li, Hongyan Li, Min Sheng, Qin Liu, Wei Liu, Yuzhou Li
Current schemes of radio resource allocation for LTE Networks can be summarized as either the centralized or the distributed. In this paper, a hybrid multi-resource allocation scheme is presented from a network overall performance perspective, where evolved NodeBs (eNBs) are motivated to assist users to implement the joint bandwidth scheduling and power water-filling on the physical resource block (PRB). Closed-form bandwidth and power solution are derived with the joint-optimality property proved. Then, a distributed iteration algorithm of joint bandwidth scheduling and power water-filling on the physical resource block (PRB) is developed. Numerical results verify the proposed distributed algorithm, which can achieve a better guarantee of throughput and fairness.
{"title":"Multi-resource allocation for LTE networks: Joint-optimality and distributed algorithm","authors":"Chungang Yang, Jiandong Li, Hongyan Li, Min Sheng, Qin Liu, Wei Liu, Yuzhou Li","doi":"10.1109/ICTEL.2013.6632096","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632096","url":null,"abstract":"Current schemes of radio resource allocation for LTE Networks can be summarized as either the centralized or the distributed. In this paper, a hybrid multi-resource allocation scheme is presented from a network overall performance perspective, where evolved NodeBs (eNBs) are motivated to assist users to implement the joint bandwidth scheduling and power water-filling on the physical resource block (PRB). Closed-form bandwidth and power solution are derived with the joint-optimality property proved. Then, a distributed iteration algorithm of joint bandwidth scheduling and power water-filling on the physical resource block (PRB) is developed. Numerical results verify the proposed distributed algorithm, which can achieve a better guarantee of throughput and fairness.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122022233","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632158
A. Yassine, M. Awad, Y. Nasser
This paper investigates and presents the results of hybrid localization techniques in heterogeneous networks with lack of hearability scenarios. In this contribution, we generalize the work presented in [1] and [2] by investigating the limits of their combination but also the limits of the minimal number of anchor nodes (AN) used for hybrid positioning. The focus is on two scenarios: the small indoor scenario combining WiFi and cellular systems; and, the small-to-mid-scale scenario composed of one located mobile terminal and one AN. In this work, we investigate the effect of the availability of the three metrics i.e. the Time of Arrival (TOA), the Angle of Arrival (AOA), the Received Signal Strength based Fingerprint (RSS) on the positioning accuracy when the number of anchor nodes is minimal. To combine these measurements, we propose to use the two levels Unscented Kalman Filter (UKF). Simulations results show better system performance in poor transmission scenarios.
{"title":"On the hybrid localization in heterogeneous networks with lack of hearability","authors":"A. Yassine, M. Awad, Y. Nasser","doi":"10.1109/ICTEL.2013.6632158","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632158","url":null,"abstract":"This paper investigates and presents the results of hybrid localization techniques in heterogeneous networks with lack of hearability scenarios. In this contribution, we generalize the work presented in [1] and [2] by investigating the limits of their combination but also the limits of the minimal number of anchor nodes (AN) used for hybrid positioning. The focus is on two scenarios: the small indoor scenario combining WiFi and cellular systems; and, the small-to-mid-scale scenario composed of one located mobile terminal and one AN. In this work, we investigate the effect of the availability of the three metrics i.e. the Time of Arrival (TOA), the Angle of Arrival (AOA), the Received Signal Strength based Fingerprint (RSS) on the positioning accuracy when the number of anchor nodes is minimal. To combine these measurements, we propose to use the two levels Unscented Kalman Filter (UKF). Simulations results show better system performance in poor transmission scenarios.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114194132","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632120
M. Boutabia, H. Afifi
Mobility management across multi technology wireless networks is an important feature for ubiquitous access. In such heterogeneous environment, service providers have to deal with service continuity especially for real time applications like voice over IP. In order to achieve this goal, the Internet Engineering Task Force (IETF) proposed fast handovers for IPv6 (FMIPv6) to reduce handover delay for real-time applications. FMIPv6 operates in two modes: predictive mode and reactive mode. FMIPv6 handover is achieved seamlessly when the predictive mode is used. The failure of the predictive mode degrades the handover performance and disrupts the perceived quality. In this paper, we propose an enhanced FMIPv6 that maximizes the predictive mode probability by forwarding the acknowledgment of the fast binding update to the new location of the mobile node. Moreover, the solution is based on the use of media independent handover services in both mobile node and network in order to achieve a successful predictive handover. A new state machine is defined for the mobile node to answer the requirements of the new enhancement. The impact of the proposed improvement is investigated through an analytical study.
多技术无线网络的移动性管理是泛在接入的一项重要功能。在这种异构环境中，服务提供商必须保证服务的连续性，尤其是 IP 语音等实时应用。为了实现这一目标，互联网工程任务组（IETF）提出了 IPv6 快速切换（FMIPv6）方案，以减少实时应用的切换延迟。FMIPv6 有两种运行模式：预测模式和反应模式。使用预测模式时，FMIPv6 可以实现无缝切换。如果预测模式失效，则会降低切换性能并破坏感知质量。本文提出了一种增强型 FMIPv6，通过将快速绑定更新的确认转发到移动节点的新位置，最大限度地提高了预测模式的概率。此外，该解决方案基于在移动节点和网络中使用媒体独立切换服务，以实现成功的预测切换。为移动节点定义了一个新的状态机，以满足新改进的要求。通过分析研究调查了拟议改进的影响。
{"title":"Maximizing predictive mode probability in fast handovers for mobile IP","authors":"M. Boutabia, H. Afifi","doi":"10.1109/ICTEL.2013.6632120","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632120","url":null,"abstract":"Mobility management across multi technology wireless networks is an important feature for ubiquitous access. In such heterogeneous environment, service providers have to deal with service continuity especially for real time applications like voice over IP. In order to achieve this goal, the Internet Engineering Task Force (IETF) proposed fast handovers for IPv6 (FMIPv6) to reduce handover delay for real-time applications. FMIPv6 operates in two modes: predictive mode and reactive mode. FMIPv6 handover is achieved seamlessly when the predictive mode is used. The failure of the predictive mode degrades the handover performance and disrupts the perceived quality. In this paper, we propose an enhanced FMIPv6 that maximizes the predictive mode probability by forwarding the acknowledgment of the fast binding update to the new location of the mobile node. Moreover, the solution is based on the use of media independent handover services in both mobile node and network in order to achieve a successful predictive handover. A new state machine is defined for the mobile node to answer the requirements of the new enhancement. The impact of the proposed improvement is investigated through an analytical study.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126813242","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632079
L. Ge, Gaojie Chen, Yu Gong, J. Chambers
In this paper, we consider the use of the Golden Code within two-way transmission over a wireless relay network in the fixed and selected relay cases. Such two-way transmission potentially improves the rate performance over one-way schemes. A four time slot amplify-and-forward (AF) protocol is exploited. Two policies are considered for relay selection, one based on a maximum-minimum strategy and a second using the maximum-mean approach. The combination of relay selection and two-way transmission mitigates the potential loss of diversity and rate in one-way fixed relay Golden Code transmission. End-to-end bit error rate simulations are used to evaluate the performance of the proposed approaches.
{"title":"Two-way distributed transmission based on the golden code for application in wireless relay networks","authors":"L. Ge, Gaojie Chen, Yu Gong, J. Chambers","doi":"10.1109/ICTEL.2013.6632079","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632079","url":null,"abstract":"In this paper, we consider the use of the Golden Code within two-way transmission over a wireless relay network in the fixed and selected relay cases. Such two-way transmission potentially improves the rate performance over one-way schemes. A four time slot amplify-and-forward (AF) protocol is exploited. Two policies are considered for relay selection, one based on a maximum-minimum strategy and a second using the maximum-mean approach. The combination of relay selection and two-way transmission mitigates the potential loss of diversity and rate in one-way fixed relay Golden Code transmission. End-to-end bit error rate simulations are used to evaluate the performance of the proposed approaches.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"708 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128985402","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 : 2013-05-06DOI: 10.1109/ICTEL.2013.6632143
Fahima Ben Guirat, Imen Filali
The peer-to-peer (P2P) communication model has gained an enormous research interest in the last few years due to its promising properties (e.g., decentralization, self-organization, scalability, etc.) to build large scale distributed applications. However, the P2P systems are characterized by their dynamic behavior as peers can frequently join and leave the network. This property makes the data availability in a such dynamic behavior a crucial problem. Indeed, to provide a high data availability under peer churn, one possible solution is to replicate the same bloc of data into a set of nodes according to a well defined strategy. In this paper, we have deeply investigated the main existing approaches of data replication that have been proposed in the literature. Then, we have proposed an efficient data replication mechanism that overcomes the limitations of these approaches. In order to evaluate these strategies, we have conducted an extensive simulation study. Simulations results show that our strategy performs well compared with others approaches not only in a static environment but also under churn.
{"title":"An efficient data replication approach for structured peer-to-peer systems","authors":"Fahima Ben Guirat, Imen Filali","doi":"10.1109/ICTEL.2013.6632143","DOIUrl":"https://doi.org/10.1109/ICTEL.2013.6632143","url":null,"abstract":"The peer-to-peer (P2P) communication model has gained an enormous research interest in the last few years due to its promising properties (e.g., decentralization, self-organization, scalability, etc.) to build large scale distributed applications. However, the P2P systems are characterized by their dynamic behavior as peers can frequently join and leave the network. This property makes the data availability in a such dynamic behavior a crucial problem. Indeed, to provide a high data availability under peer churn, one possible solution is to replicate the same bloc of data into a set of nodes according to a well defined strategy. In this paper, we have deeply investigated the main existing approaches of data replication that have been proposed in the literature. Then, we have proposed an efficient data replication mechanism that overcomes the limitations of these approaches. In order to evaluate these strategies, we have conducted an extensive simulation study. Simulations results show that our strategy performs well compared with others approaches not only in a static environment but also under churn.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133734193","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
扫码关注我们
求助内容：
应助结果提醒方式：