Pub Date : 2014-12-20DOI: 10.1109/NOF.2014.7119764
Giorgos Chochlidakis, V. Friderikos
One of key challenges for emerging and future wireless networks will be the support of seamless distributed IP mobility management to support a plethora of different applications. In this paper, an optimization problem for provisioning efficient centralized Mobility Agents (MAs) deployment is formulated, as well as a realistic model is developed for the Distributed Mobility Management (DMM) scheme. These are subsequently compared in terms of various key characteristics, such as routing cost, delay and topology dependence. Then, an innovative Hybrid Distributed Mobility Management (HDMM) scheme is presented that provides improved network performance in terms of handover support for delay sensitive flows, compared to fully DMM schemes, which their performance can be strongly topology-dependent. The proposed scheme combines the centralized and distributed mobility support, depending on the network's topology characteristics. A wide set of numerical investigations reveal the advantages of the DMM scheme over the centralized scheme for different network cases and detail the reasons why future networks tend to decentralize mobility management functionalities. Simulation results, also, show that the proposed HDMM scheme can significantly improve the network's performance and the achieved QoS of the end-users, allowing seamless mobility support for delay intolerant over-the-top services (e.g. VoIP).
{"title":"Hybrid Distributed Mobility Management for next-generation wireless networks","authors":"Giorgos Chochlidakis, V. Friderikos","doi":"10.1109/NOF.2014.7119764","DOIUrl":"https://doi.org/10.1109/NOF.2014.7119764","url":null,"abstract":"One of key challenges for emerging and future wireless networks will be the support of seamless distributed IP mobility management to support a plethora of different applications. In this paper, an optimization problem for provisioning efficient centralized Mobility Agents (MAs) deployment is formulated, as well as a realistic model is developed for the Distributed Mobility Management (DMM) scheme. These are subsequently compared in terms of various key characteristics, such as routing cost, delay and topology dependence. Then, an innovative Hybrid Distributed Mobility Management (HDMM) scheme is presented that provides improved network performance in terms of handover support for delay sensitive flows, compared to fully DMM schemes, which their performance can be strongly topology-dependent. The proposed scheme combines the centralized and distributed mobility support, depending on the network's topology characteristics. A wide set of numerical investigations reveal the advantages of the DMM scheme over the centralized scheme for different network cases and detail the reasons why future networks tend to decentralize mobility management functionalities. Simulation results, also, show that the proposed HDMM scheme can significantly improve the network's performance and the achieved QoS of the end-users, allowing seamless mobility support for delay intolerant over-the-top services (e.g. VoIP).","PeriodicalId":435905,"journal":{"name":"2014 International Conference and Workshop on the Network of the Future (NOF)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132367007","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 : 2014-12-03DOI: 10.1109/NOF.2014.7119770
F. Jemaa, Michel Pariente
Due to the proliferation of Wi-Fi hotspots in public indoor areas (such as restaurants, airport, and shopping malls) and the ubiquity of Wi-Fi in mobile devices, Venue-Based Services are increasingly deployed by venue owners and Wi-Fi operators in their networks to improve their users' experience and generate new revenue streams. These services are locally offered by the venue and client mobile devices should typically authenticate and associate to Wi-Fi networks to be able to discover these services. However, end-users often prefer to associate to a Wi-Fi network only if it offers the specific service they need. Moreover, they no longer want to intervene frequently to manually search for and choose a network which offers the desired service. Therefore, providing more personalization and transparency for access to Wi-Fi networks and services becomes a crucial concern and requirement to give customers the user experience they desire and expect. This paper proposes a solution to enable venue service discovery prior to Wi-Fi association while avoiding channel overhead and defines a set of service labels to uniquely and globally identify the most known venue-based services. We show then how these two contributions could be efficient and useful and help to have a personalized, transparent and automated access to venue-based services through Wi-Fi networks.
{"title":"Personalized and seamless Wi-Fi access to Venue-Based Services","authors":"F. Jemaa, Michel Pariente","doi":"10.1109/NOF.2014.7119770","DOIUrl":"https://doi.org/10.1109/NOF.2014.7119770","url":null,"abstract":"Due to the proliferation of Wi-Fi hotspots in public indoor areas (such as restaurants, airport, and shopping malls) and the ubiquity of Wi-Fi in mobile devices, Venue-Based Services are increasingly deployed by venue owners and Wi-Fi operators in their networks to improve their users' experience and generate new revenue streams. These services are locally offered by the venue and client mobile devices should typically authenticate and associate to Wi-Fi networks to be able to discover these services. However, end-users often prefer to associate to a Wi-Fi network only if it offers the specific service they need. Moreover, they no longer want to intervene frequently to manually search for and choose a network which offers the desired service. Therefore, providing more personalization and transparency for access to Wi-Fi networks and services becomes a crucial concern and requirement to give customers the user experience they desire and expect. This paper proposes a solution to enable venue service discovery prior to Wi-Fi association while avoiding channel overhead and defines a set of service labels to uniquely and globally identify the most known venue-based services. We show then how these two contributions could be efficient and useful and help to have a personalized, transparent and automated access to venue-based services through Wi-Fi networks.","PeriodicalId":435905,"journal":{"name":"2014 International Conference and Workshop on the Network of the Future (NOF)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124981337","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 : 2014-12-01DOI: 10.1109/NOF.2014.7119775
I. Simsek, Yves Igor Jerschow, M. Becke, E. Rathgeb
In our previous work, we discussed the issue that with existing techniques we can either provide end-to-end information security or establish smart in-network services. Using the example of Blind Packet Forwarding (BPF), we demonstrated the feasibility to simultaneously realise both goals. However, the basic BPF design is not sufficiently scalable and lacks support for mobility and multihoming. This paper focuses on the issues of the basic BPF design and resolves them by applying the Locator/Identifier Split approach. We extend our BPF design and especially adopt the features of the Hierarchical Architecture for Internet Routing (HAIR). Additionally, we present our prototype implementation of the improved BPF, which benefits from the flow-based forwarding in OpenFlow, and evaluate it.
{"title":"Blind Packet Forwarding in a hierarchical architecture with Locator/Identifier Split","authors":"I. Simsek, Yves Igor Jerschow, M. Becke, E. Rathgeb","doi":"10.1109/NOF.2014.7119775","DOIUrl":"https://doi.org/10.1109/NOF.2014.7119775","url":null,"abstract":"In our previous work, we discussed the issue that with existing techniques we can either provide end-to-end information security or establish smart in-network services. Using the example of Blind Packet Forwarding (BPF), we demonstrated the feasibility to simultaneously realise both goals. However, the basic BPF design is not sufficiently scalable and lacks support for mobility and multihoming. This paper focuses on the issues of the basic BPF design and resolves them by applying the Locator/Identifier Split approach. We extend our BPF design and especially adopt the features of the Hierarchical Architecture for Internet Routing (HAIR). Additionally, we present our prototype implementation of the improved BPF, which benefits from the flow-based forwarding in OpenFlow, and evaluate it.","PeriodicalId":435905,"journal":{"name":"2014 International Conference and Workshop on the Network of the Future (NOF)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129303781","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 : 2014-12-01DOI: 10.1109/NOF.2014.7119799
S. Betgé-Brezetz, Guy-Bertrand Kamga, Ali El Amrani Joutei, Oussama Maalmi
Security of sensitive data in the network is a key issue in a world where such sensitive data can easily be transferred between different servers and locations (e.g., in networked clouds). In this context, there is a particular need to control the path followed by the data when they move across the cloud (e.g., to avoid crossing -even encrypted- un-trusted nodes or areas). In this paper we proposed therefore a new approach which aims to leverage the programmability offered by the SDN technology in order to enforce a trusted path for the transfer of sensitive data in the network. Given a policy related to the sensitive data (e.g., the data should not cross a given area), our approach allows sending this policy to an extended SDN controller (called Trusted Path Controller) which automatically enforces this policy in the SDN network. Two architectures have been investigated: the Out-of-Band architecture (the policy being sent to the Trusted Path Controller via a Web Service interface) and the In-Band architecture (the policy being sent to the Trusted Path Controller via a dedicated “signaling packet”). These two architectures have been implemented in a SDN controller. Experimentations and evaluations have also been performed on a test-bed of SDN switches which allow showing the feasibility of this approach as well as its performances.
{"title":"SDN-based Trusted Path Control","authors":"S. Betgé-Brezetz, Guy-Bertrand Kamga, Ali El Amrani Joutei, Oussama Maalmi","doi":"10.1109/NOF.2014.7119799","DOIUrl":"https://doi.org/10.1109/NOF.2014.7119799","url":null,"abstract":"Security of sensitive data in the network is a key issue in a world where such sensitive data can easily be transferred between different servers and locations (e.g., in networked clouds). In this context, there is a particular need to control the path followed by the data when they move across the cloud (e.g., to avoid crossing -even encrypted- un-trusted nodes or areas). In this paper we proposed therefore a new approach which aims to leverage the programmability offered by the SDN technology in order to enforce a trusted path for the transfer of sensitive data in the network. Given a policy related to the sensitive data (e.g., the data should not cross a given area), our approach allows sending this policy to an extended SDN controller (called Trusted Path Controller) which automatically enforces this policy in the SDN network. Two architectures have been investigated: the Out-of-Band architecture (the policy being sent to the Trusted Path Controller via a Web Service interface) and the In-Band architecture (the policy being sent to the Trusted Path Controller via a dedicated “signaling packet”). These two architectures have been implemented in a SDN controller. Experimentations and evaluations have also been performed on a test-bed of SDN switches which allow showing the feasibility of this approach as well as its performances.","PeriodicalId":435905,"journal":{"name":"2014 International Conference and Workshop on the Network of the Future (NOF)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128174542","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 : 2014-12-01DOI: 10.1109/NOF.2014.7119774
F. Guenane, Bendriss Jaafar, M. N. Lima, G. Pujolle
The Cloud computing model is considered as a very promising internet-based computing platform, the resources it provides to create virtual machines are rarely used to manage security. Researchers used this power in a new way, in order to offer new security services based on Cloud paradigm to copc with threats such as DDOS (Distribute Denial Of Service) attacks, using the extensible resources and other Cloud's characteristics. Our model is based on the SECaaS (SECurity as a Service) to manage security using specialized virtual firewalls proposed as a service by the Cloud Provider. The main advantage of this approach is to instantiate firewalls when needed and adapt resources to filter the network flow avoiding bottlenecks and congestion. In this paper, we present a new autonomous model to manage cloud based firewalling services using the Multi-Agent System. The aim of this solution is to manage and provide optimal resource provisioning for this type of service.
{"title":"Autonomous architecture for managing firewalling Cloud-based service","authors":"F. Guenane, Bendriss Jaafar, M. N. Lima, G. Pujolle","doi":"10.1109/NOF.2014.7119774","DOIUrl":"https://doi.org/10.1109/NOF.2014.7119774","url":null,"abstract":"The Cloud computing model is considered as a very promising internet-based computing platform, the resources it provides to create virtual machines are rarely used to manage security. Researchers used this power in a new way, in order to offer new security services based on Cloud paradigm to copc with threats such as DDOS (Distribute Denial Of Service) attacks, using the extensible resources and other Cloud's characteristics. Our model is based on the SECaaS (SECurity as a Service) to manage security using specialized virtual firewalls proposed as a service by the Cloud Provider. The main advantage of this approach is to instantiate firewalls when needed and adapt resources to filter the network flow avoiding bottlenecks and congestion. In this paper, we present a new autonomous model to manage cloud based firewalling services using the Multi-Agent System. The aim of this solution is to manage and provide optimal resource provisioning for this type of service.","PeriodicalId":435905,"journal":{"name":"2014 International Conference and Workshop on the Network of the Future (NOF)","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115086283","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 : 2014-12-01DOI: 10.1109/NOF.2014.7119771
S. Feki, W. Louati, N. Masmoudi, M. Jmaiel
This paper focuses on data replication in structured peer-to-peer systems over highly dynamic networks. A Q-learning-based replication approach is proposed. Data availability is periodically computed using the Q-learning function. The reward/penalty property of this function attenuates the impact of the network dynamism on the replication overhead. Hence, the departure of a node does not necessarily lead to the addition of a replica in the network. The replication process is triggered according to the overall data availability. Simulation results proved that the proposed approach ensures data availability in dynamic environments with minimum data transfer costs.
{"title":"Q-learning-based data replication for highly dynamic distributed hash tables","authors":"S. Feki, W. Louati, N. Masmoudi, M. Jmaiel","doi":"10.1109/NOF.2014.7119771","DOIUrl":"https://doi.org/10.1109/NOF.2014.7119771","url":null,"abstract":"This paper focuses on data replication in structured peer-to-peer systems over highly dynamic networks. A Q-learning-based replication approach is proposed. Data availability is periodically computed using the Q-learning function. The reward/penalty property of this function attenuates the impact of the network dynamism on the replication overhead. Hence, the departure of a node does not necessarily lead to the addition of a replica in the network. The replication process is triggered according to the overall data availability. Simulation results proved that the proposed approach ensures data availability in dynamic environments with minimum data transfer costs.","PeriodicalId":435905,"journal":{"name":"2014 International Conference and Workshop on the Network of the Future (NOF)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129381483","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 : 2014-12-01DOI: 10.1109/NOF.2014.7119761
T. Taniguchi, Y. Karasawa
This paper describes efficient design method of MIMO downlink system adopting large scale array antenna in transmitter side. The proposed approach is suitable when the number of receivers is small compared with the maximum value. First, the large scale antenna is divided into several subarrays, then each of them is designed based on the concept of block diagonalization, and they are combined again as an array of original size. By this operation, the computational load for multiuser design is significantly reduced, which means the proposed method can be applied even in the situation the conventional block diagonalization is computationally impractical. To cope with the uncertainty of receiver weight, two types of procedures are considered, namely, the transmitter first design, and the receiver first transmitter second design approaches. Through computer simulations, it is shown that receiver weight first design method has a better performance when the total stream number is smaller than the maximum value.
{"title":"A low computational design of multiuser MIMO system using large scale array antenna","authors":"T. Taniguchi, Y. Karasawa","doi":"10.1109/NOF.2014.7119761","DOIUrl":"https://doi.org/10.1109/NOF.2014.7119761","url":null,"abstract":"This paper describes efficient design method of MIMO downlink system adopting large scale array antenna in transmitter side. The proposed approach is suitable when the number of receivers is small compared with the maximum value. First, the large scale antenna is divided into several subarrays, then each of them is designed based on the concept of block diagonalization, and they are combined again as an array of original size. By this operation, the computational load for multiuser design is significantly reduced, which means the proposed method can be applied even in the situation the conventional block diagonalization is computationally impractical. To cope with the uncertainty of receiver weight, two types of procedures are considered, namely, the transmitter first design, and the receiver first transmitter second design approaches. Through computer simulations, it is shown that receiver weight first design method has a better performance when the total stream number is smaller than the maximum value.","PeriodicalId":435905,"journal":{"name":"2014 International Conference and Workshop on the Network of the Future (NOF)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120934946","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 : 2014-12-01DOI: 10.1109/NOF.2014.7119772
Nour El Madhoun, F. Guenane
Today, several sectors are demanding the track of their objects to improve the efficiency and reliability of the system. RFID technology enables an automatic identification of objects attached to RFID tags via radio waves and allows reading or writing data without physical contact between an RFID reader and a tag. The main engine of RFID development is the need for traceability in order to ensure the authenticity of objects, avoid counterfeiting and track all events in the system. So, RFID technology adds intelligence to the process of identification and traceability and it is the best choice to create tracking systems. Our work aims to provide a secure RFID track and trace architecture which can be implemented in many areas and to design an RFID multi-frequency HF/UHF reader able to interact with HF or UHF tags. Moreover, to ensure and complete the historization of all sector events, we propose to enrich our traceability system with enforceable proofs through an electronic safe Cloud-based platform in a secure manner. The integration of RFID technology with a Cloud platform allows to link RFID objects to the Internet. Consequently, this network of networks represents the concept of the Internet of Things which is the key enabler for our traceability system. The present article is a report of our current research effort and our planned future work.
{"title":"An innovative cloud-based RFID traceability architecture and service","authors":"Nour El Madhoun, F. Guenane","doi":"10.1109/NOF.2014.7119772","DOIUrl":"https://doi.org/10.1109/NOF.2014.7119772","url":null,"abstract":"Today, several sectors are demanding the track of their objects to improve the efficiency and reliability of the system. RFID technology enables an automatic identification of objects attached to RFID tags via radio waves and allows reading or writing data without physical contact between an RFID reader and a tag. The main engine of RFID development is the need for traceability in order to ensure the authenticity of objects, avoid counterfeiting and track all events in the system. So, RFID technology adds intelligence to the process of identification and traceability and it is the best choice to create tracking systems. Our work aims to provide a secure RFID track and trace architecture which can be implemented in many areas and to design an RFID multi-frequency HF/UHF reader able to interact with HF or UHF tags. Moreover, to ensure and complete the historization of all sector events, we propose to enrich our traceability system with enforceable proofs through an electronic safe Cloud-based platform in a secure manner. The integration of RFID technology with a Cloud platform allows to link RFID objects to the Internet. Consequently, this network of networks represents the concept of the Internet of Things which is the key enabler for our traceability system. The present article is a report of our current research effort and our planned future work.","PeriodicalId":435905,"journal":{"name":"2014 International Conference and Workshop on the Network of the Future (NOF)","volume":"208 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116707937","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 : 2014-12-01DOI: 10.1109/NOF.2014.7119777
Imad Jamil, L. Cariou, J. Hélard
The rate control mechanism is an effective way to improve the overall system performance in IEEE 802.11 multi-rate networks. However, in dense environments, due to the large number of contending nodes, the packet collisions trigger unfairly the rate control mechanism to decrease the transmission data rate. In this work, we address the performance degradation problem of rate control caused by these unnecessary data rate decrements. A physical carrier sensing adaptation enhances the spatial reuse and paves the way to an adapted rate control algorithm to boost the performance of the network. Extensive simulations show a gain of 260% in achieved throughput compared to the conventional scenario.
{"title":"Carrier sensing-aware rate control mechanism for future efficient WLANs","authors":"Imad Jamil, L. Cariou, J. Hélard","doi":"10.1109/NOF.2014.7119777","DOIUrl":"https://doi.org/10.1109/NOF.2014.7119777","url":null,"abstract":"The rate control mechanism is an effective way to improve the overall system performance in IEEE 802.11 multi-rate networks. However, in dense environments, due to the large number of contending nodes, the packet collisions trigger unfairly the rate control mechanism to decrease the transmission data rate. In this work, we address the performance degradation problem of rate control caused by these unnecessary data rate decrements. A physical carrier sensing adaptation enhances the spatial reuse and paves the way to an adapted rate control algorithm to boost the performance of the network. Extensive simulations show a gain of 260% in achieved throughput compared to the conventional scenario.","PeriodicalId":435905,"journal":{"name":"2014 International Conference and Workshop on the Network of the Future (NOF)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130084334","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 : 2014-12-01DOI: 10.1109/NOF.2014.7119776
Eya Dhib, N. Tabbane, N. Zangar, K. Boussetta
Web Services publication and discovery are commonly implemented over a centralized client-server approach. Therefore, at high requests' rate server nodes are bottlenecked and the system scale is unable to follow the increasing load. To address this issue, we consider the Cloud computing concept where huge amount of resources such as, storage, processing and bandwidth capacities are available on demand. In this paper, we propose a decentralized cloud system, which aims to improve the system performances, such as requests latency and reliability, in compare with the classical centralized cloud architecture. Our solution, called C-Chord, is based on peer-to-peer hierarchical Chord network operating over a fully decentralized Infrastructure as a Service (IaaS) cloud system. In order to enhance the reliability of Web services, C-Chord relies on virtual peers that support diversification of Web Services class. It also introduces a multi-keys Web service query instead of one single key.
{"title":"C-Chord: Hierarchical peer-to-peer protocol over a fully decentralized IaaS Cloud","authors":"Eya Dhib, N. Tabbane, N. Zangar, K. Boussetta","doi":"10.1109/NOF.2014.7119776","DOIUrl":"https://doi.org/10.1109/NOF.2014.7119776","url":null,"abstract":"Web Services publication and discovery are commonly implemented over a centralized client-server approach. Therefore, at high requests' rate server nodes are bottlenecked and the system scale is unable to follow the increasing load. To address this issue, we consider the Cloud computing concept where huge amount of resources such as, storage, processing and bandwidth capacities are available on demand. In this paper, we propose a decentralized cloud system, which aims to improve the system performances, such as requests latency and reliability, in compare with the classical centralized cloud architecture. Our solution, called C-Chord, is based on peer-to-peer hierarchical Chord network operating over a fully decentralized Infrastructure as a Service (IaaS) cloud system. In order to enhance the reliability of Web services, C-Chord relies on virtual peers that support diversification of Web Services class. It also introduces a multi-keys Web service query instead of one single key.","PeriodicalId":435905,"journal":{"name":"2014 International Conference and Workshop on the Network of the Future (NOF)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124984843","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
扫码关注我们
求助内容：
应助结果提醒方式：