Pub Date : 2013-12-16DOI: 10.1109/NOF.2013.6724524
Fatima Zahra Errounda, F. Belqasmi, R. Glitho
Robotic applications are widely used in various domains (e.g. healthcare, agriculture). However, provisioning them in a cost-efficient manner remains an uphill task. Cloud computing is a new paradigm with three key facets: Infrastructure as a Service (IaaS), Platform as a Service (PaaS) and Software as a Service (SaaS). Rapid application development/deployment, pay-per-use and efficient use of resources are among the expected benefits. Cloud computing is a promising technology for application provisioning and can bring robotic application provisioning to the next level. This paper identifies the shortcomings of the state of the art in cloud-based architectures for robotic applications provisioning. It sketches an overall business model to tackle the identified shortcomings. It proposes an overlay-based architecture to handle the cloud interactions aspects of the proposed business model. The implementation aspects of the overlay-based architecture are discussed. Research directions are also identified.
{"title":"Towards cloud-based architectures for robotic applications provisioning","authors":"Fatima Zahra Errounda, F. Belqasmi, R. Glitho","doi":"10.1109/NOF.2013.6724524","DOIUrl":"https://doi.org/10.1109/NOF.2013.6724524","url":null,"abstract":"Robotic applications are widely used in various domains (e.g. healthcare, agriculture). However, provisioning them in a cost-efficient manner remains an uphill task. Cloud computing is a new paradigm with three key facets: Infrastructure as a Service (IaaS), Platform as a Service (PaaS) and Software as a Service (SaaS). Rapid application development/deployment, pay-per-use and efficient use of resources are among the expected benefits. Cloud computing is a promising technology for application provisioning and can bring robotic application provisioning to the next level. This paper identifies the shortcomings of the state of the art in cloud-based architectures for robotic applications provisioning. It sketches an overall business model to tackle the identified shortcomings. It proposes an overlay-based architecture to handle the cloud interactions aspects of the proposed business model. The implementation aspects of the overlay-based architecture are discussed. Research directions are also identified.","PeriodicalId":143986,"journal":{"name":"2013 Fourth International Conference on the Network of the Future (NoF)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114995445","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-10-23DOI: 10.1109/NOF.2013.6724511
Wei You, B. Mathieu, G. Simon
The Internet architecture, based on end-to-end connections, had difficulties to efficiently deliver the always increasing number of contents. Content Delivery Networks (CDN) have been deployed to improve the delivery. Recent research works propose a new networking architecture, much more adapted to the current Internet usage (end-users just care about the contents they want and not about the endpoints that provide them). The Content-Centric Networking (CCN) aims at replacing the IP paradigm. CCN has been investigated by the research community for few years, and some demonstrators have proved its feasibility. However, less works have addressed the CDN use-case so far. In this paper, we show that the current CCN design, which does not allow negative reply, is not suitable for interconnection with the CDN service. We then propose the use of two new tables in the CCN nodes that are interconnected to the CDN servers, in order to detect possible misses in the CDN servers and subsequently forward the requests for missing contents toward the original servers instead of the CDN surrogates. The evaluations we have performed highlight that the integration of both new tables does not incur an increase of the memory requirement and thus a cost in the node. The proposed solution is thus a viable solution to make CCN network work in close cooperation with CDN networks, each one keeping its specific business models and functions: transport for CCN, storage for CDN.
{"title":"How to make content-centric networks interwork with CDN networks","authors":"Wei You, B. Mathieu, G. Simon","doi":"10.1109/NOF.2013.6724511","DOIUrl":"https://doi.org/10.1109/NOF.2013.6724511","url":null,"abstract":"The Internet architecture, based on end-to-end connections, had difficulties to efficiently deliver the always increasing number of contents. Content Delivery Networks (CDN) have been deployed to improve the delivery. Recent research works propose a new networking architecture, much more adapted to the current Internet usage (end-users just care about the contents they want and not about the endpoints that provide them). The Content-Centric Networking (CCN) aims at replacing the IP paradigm. CCN has been investigated by the research community for few years, and some demonstrators have proved its feasibility. However, less works have addressed the CDN use-case so far. In this paper, we show that the current CCN design, which does not allow negative reply, is not suitable for interconnection with the CDN service. We then propose the use of two new tables in the CCN nodes that are interconnected to the CDN servers, in order to detect possible misses in the CDN servers and subsequently forward the requests for missing contents toward the original servers instead of the CDN surrogates. The evaluations we have performed highlight that the integration of both new tables does not incur an increase of the memory requirement and thus a cost in the node. The proposed solution is thus a viable solution to make CCN network work in close cooperation with CDN networks, each one keeping its specific business models and functions: transport for CCN, storage for CDN.","PeriodicalId":143986,"journal":{"name":"2013 Fourth International Conference on the Network of the Future (NoF)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114552452","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-10-23DOI: 10.1109/NOF.2013.6724509
J. François, Thibault Cholez, T. Engel
Content-Centric Networking (CCN) recently received a lot of attention thanks to its elegant way to optimize content diffusion at the scale of Internet. However, communications occurring at the edge of Internet, in particular the Internet of Things (IoT), are also a vivid research topic. Even if CCN was not initially designed to optimize the specific traffic pattern of the IoT, it can be improved to better support these new applications. In this paper, we propose to optimize the traffic within a CCN for IoT network where information is created and consumed at different frequencies. The simulations show that our solution outperforms the vanilla CCN architecture for this generic scenario.
{"title":"CCN traffic optimization for IoT","authors":"J. François, Thibault Cholez, T. Engel","doi":"10.1109/NOF.2013.6724509","DOIUrl":"https://doi.org/10.1109/NOF.2013.6724509","url":null,"abstract":"Content-Centric Networking (CCN) recently received a lot of attention thanks to its elegant way to optimize content diffusion at the scale of Internet. However, communications occurring at the edge of Internet, in particular the Internet of Things (IoT), are also a vivid research topic. Even if CCN was not initially designed to optimize the specific traffic pattern of the IoT, it can be improved to better support these new applications. In this paper, we propose to optimize the traffic within a CCN for IoT network where information is created and consumed at different frequencies. The simulations show that our solution outperforms the vanilla CCN architecture for this generic scenario.","PeriodicalId":143986,"journal":{"name":"2013 Fourth International Conference on the Network of the Future (NoF)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133163712","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-10-01DOI: 10.1109/NOF.2013.6724512
Young-min Park, Jong Kim, Yoonho Kim
Node authentication is an essential security service in mobile ad-hoc networks (MANETs). To provide a node authentication service, we have to construct a distributed certificate authority in MANETs. In this paper, to solve the number of neighbor node problem in fully distributed certificate authority (FDCA) schemes, we propose a distributed certificate authority scheme with weighted secret sharing. Each node's share weight is given with considering current node degree information. Node's share weight has to be adjusted due to the mobility of nodes. We have analyzed our scheme based on security criteria, and have conducted experiments using the ns-2 simulator to evaluate our scheme and compare it with previous schemes. It is shown that the proposed scheme enhances the certificate service stability by adjusting each CA node's secret share weight.
{"title":"Distributed certificate authority scheme with weighted secret sharing for mobile ad-hoc networks","authors":"Young-min Park, Jong Kim, Yoonho Kim","doi":"10.1109/NOF.2013.6724512","DOIUrl":"https://doi.org/10.1109/NOF.2013.6724512","url":null,"abstract":"Node authentication is an essential security service in mobile ad-hoc networks (MANETs). To provide a node authentication service, we have to construct a distributed certificate authority in MANETs. In this paper, to solve the number of neighbor node problem in fully distributed certificate authority (FDCA) schemes, we propose a distributed certificate authority scheme with weighted secret sharing. Each node's share weight is given with considering current node degree information. Node's share weight has to be adjusted due to the mobility of nodes. We have analyzed our scheme based on security criteria, and have conducted experiments using the ns-2 simulator to evaluate our scheme and compare it with previous schemes. It is shown that the proposed scheme enhances the certificate service stability by adjusting each CA node's secret share weight.","PeriodicalId":143986,"journal":{"name":"2013 Fourth International Conference on the Network of the Future (NoF)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125131482","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-10-01DOI: 10.1109/NOF.2013.6724525
Jaegook Lee, Young-Joo Suh, Chansu Yu
802.11 WLANs are getting more and more popular. Even though an independent WLAN works in an optimal manner, many problems occur when they are deployed densely particularly with the advancement of new standards and new devices supporting dual- or non-standard features. Research community has been exploring an integrated system to monitor or control the APs and clients so that the network performance can be maximized. Enterprise WLAN (EWLAN) uses a central controller to address problems arising from a collection of APs and their associated clients due to their behavior with the lack of knowledge of other APs and clients in the proximity. This article presents EWLAN's architecture and characteristics. Then it presents a survey on several solutions in terms of interference mitigation, traffic balance, and mobility support.
{"title":"Evaluation on enterprise WLAN techniques","authors":"Jaegook Lee, Young-Joo Suh, Chansu Yu","doi":"10.1109/NOF.2013.6724525","DOIUrl":"https://doi.org/10.1109/NOF.2013.6724525","url":null,"abstract":"802.11 WLANs are getting more and more popular. Even though an independent WLAN works in an optimal manner, many problems occur when they are deployed densely particularly with the advancement of new standards and new devices supporting dual- or non-standard features. Research community has been exploring an integrated system to monitor or control the APs and clients so that the network performance can be maximized. Enterprise WLAN (EWLAN) uses a central controller to address problems arising from a collection of APs and their associated clients due to their behavior with the lack of knowledge of other APs and clients in the proximity. This article presents EWLAN's architecture and characteristics. Then it presents a survey on several solutions in terms of interference mitigation, traffic balance, and mobility support.","PeriodicalId":143986,"journal":{"name":"2013 Fourth International Conference on the Network of the Future (NoF)","volume":"387 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122787974","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-10-01DOI: 10.1109/NOF.2013.6724507
B. Shin, Seon-Yeong Han, Dongman Lee, Wonyong Yoon
In order to support QoS in wireless ad-hoc networks, each node needs to monitor the network status and to determine whether the current network status satisfies the requirements of an application or not. Since the network requirements on an intermediate node are usually different from those on the end nodes, there is a need to convert the application requirement into a hop-by-hop network requirement. This paper induces link validation formulas for each node to determine if a link can satisfy the requirement of a specific application. The simulation results show the effectiveness of application-awareness on discovering appropriate routes for a specific application type in wireless ad-hoc networks.
{"title":"Application-awareness support for QoS-aware routing protocols in wireless ad-hoc networks","authors":"B. Shin, Seon-Yeong Han, Dongman Lee, Wonyong Yoon","doi":"10.1109/NOF.2013.6724507","DOIUrl":"https://doi.org/10.1109/NOF.2013.6724507","url":null,"abstract":"In order to support QoS in wireless ad-hoc networks, each node needs to monitor the network status and to determine whether the current network status satisfies the requirements of an application or not. Since the network requirements on an intermediate node are usually different from those on the end nodes, there is a need to convert the application requirement into a hop-by-hop network requirement. This paper induces link validation formulas for each node to determine if a link can satisfy the requirement of a specific application. The simulation results show the effectiveness of application-awareness on discovering appropriate routes for a specific application type in wireless ad-hoc networks.","PeriodicalId":143986,"journal":{"name":"2013 Fourth International Conference on the Network of the Future (NoF)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116268826","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-10-01DOI: 10.1109/NOF.2013.6724527
C. Phung, T. Vu, T. Nguyen
Network coding is a new technique to improve network capacity and reliability. COPE and DCAR are basic network coding schemes which have been proposed for opportunistic network coding in wireless networks. The performances of these coding mechanisms have been studied by simulations or experiments. There is an interest in modeling the performances of these coding schemes mathematically. In fact, analytical approach can provide quicker performance analysis and comparison between these network coding schemes. In this paper, we propose an analytical model for the DCAR coding gain. The analytical results are validated by simulations in NS-2.
{"title":"DCAR coding gain modeling and analysis","authors":"C. Phung, T. Vu, T. Nguyen","doi":"10.1109/NOF.2013.6724527","DOIUrl":"https://doi.org/10.1109/NOF.2013.6724527","url":null,"abstract":"Network coding is a new technique to improve network capacity and reliability. COPE and DCAR are basic network coding schemes which have been proposed for opportunistic network coding in wireless networks. The performances of these coding mechanisms have been studied by simulations or experiments. There is an interest in modeling the performances of these coding schemes mathematically. In fact, analytical approach can provide quicker performance analysis and comparison between these network coding schemes. In this paper, we propose an analytical model for the DCAR coding gain. The analytical results are validated by simulations in NS-2.","PeriodicalId":143986,"journal":{"name":"2013 Fourth International Conference on the Network of the Future (NoF)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116321336","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-10-01DOI: 10.1109/NOF.2013.6724519
Kevin Gatimu, Ben Lee, Tae-Wook Lee, Chang-Gone Kim, Jone-Keun Shin
High definition (HD) video is the standard of choice for today's video demands. HD video is characterized by high data rates, but it can be compressed using H.264 and transmitted over 802.11 wireless networks. However, such networks are prone to packet losses, which result in degraded perceptual video quality. It is thus important to perform error concealment. Spatial motion vector recovery is a key error concealment technique. This paper proposes a new spatial motion vector recovery technique called Weighted Nearest Valid Motion Vector Averaging (WNVMVA), which uses properly decoded motion vectors to estimate lost ones.
{"title":"Weighted nearest valid motion vector averaging for spatial motion vector recovery in wireless HD video transmission using H.264 over WLANs","authors":"Kevin Gatimu, Ben Lee, Tae-Wook Lee, Chang-Gone Kim, Jone-Keun Shin","doi":"10.1109/NOF.2013.6724519","DOIUrl":"https://doi.org/10.1109/NOF.2013.6724519","url":null,"abstract":"High definition (HD) video is the standard of choice for today's video demands. HD video is characterized by high data rates, but it can be compressed using H.264 and transmitted over 802.11 wireless networks. However, such networks are prone to packet losses, which result in degraded perceptual video quality. It is thus important to perform error concealment. Spatial motion vector recovery is a key error concealment technique. This paper proposes a new spatial motion vector recovery technique called Weighted Nearest Valid Motion Vector Averaging (WNVMVA), which uses properly decoded motion vectors to estimate lost ones.","PeriodicalId":143986,"journal":{"name":"2013 Fourth International Conference on the Network of the Future (NoF)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131949344","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-10-01DOI: 10.1109/NOF.2013.6724516
Marc Körner, O. Kao
Load-balancers have an essential role in enterprise data-centers, as their existence and performance is decisive for service provision and availability. The state of the art is that today's load-balancers are a piece of specialized embedded hardware with a proprietary operating system and application modules. In this paper we propose a concept to break up this black box model and to show how to develop a high performance LB with OpenFlow technology. In this approach we use OpenFlow network components to process the load-balancing and in order to reduce the maintenance effort and to lower the hardware cost factor. Furthermore, in case of fail-over it is redundant by concept and easier to replace by another device. The experimental evaluation of this concept proves that the concept is developed beyond a theoretical concept and the implemented solution is ready for deployment.
{"title":"Optimizing openflow load-balancing with L2 direct server return","authors":"Marc Körner, O. Kao","doi":"10.1109/NOF.2013.6724516","DOIUrl":"https://doi.org/10.1109/NOF.2013.6724516","url":null,"abstract":"Load-balancers have an essential role in enterprise data-centers, as their existence and performance is decisive for service provision and availability. The state of the art is that today's load-balancers are a piece of specialized embedded hardware with a proprietary operating system and application modules. In this paper we propose a concept to break up this black box model and to show how to develop a high performance LB with OpenFlow technology. In this approach we use OpenFlow network components to process the load-balancing and in order to reduce the maintenance effort and to lower the hardware cost factor. Furthermore, in case of fail-over it is redundant by concept and easier to replace by another device. The experimental evaluation of this concept proves that the concept is developed beyond a theoretical concept and the implemented solution is ready for deployment.","PeriodicalId":143986,"journal":{"name":"2013 Fourth International Conference on the Network of the Future (NoF)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125427767","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-10-01DOI: 10.1109/NOF.2013.6724500
Jihoon An, Younggi Kim, Minseok Lee, Younghee Lee
Linked Data is expected to play an important role for interoperability at the data level for the future internet. One of the main applications of Linked Data might be semantic query processing. The current method of warehousing based query processing requires the crawling of all data periodically and also frequent crawling of data from distributed datasets of Linked Data to make the data as up-to-date as possible. Frequent crawling is required for dynamic data to meet the high freshness requirement of real time applications. Crawling large datasets may cause serious scalability problems. In this paper, we propose an Ontology Property-based Adaptive Crawler to alleviate this problem. Linked data are crawled adaptively based on the Change Frequency of the Documents and the Properties. Performance evaluation shows that this system can reduce overhead costs by more than 70% while maintaining a high freshness of data.
{"title":"Ontology Property-based Adaptive Crawler for Linked Data(OPAC)","authors":"Jihoon An, Younggi Kim, Minseok Lee, Younghee Lee","doi":"10.1109/NOF.2013.6724500","DOIUrl":"https://doi.org/10.1109/NOF.2013.6724500","url":null,"abstract":"Linked Data is expected to play an important role for interoperability at the data level for the future internet. One of the main applications of Linked Data might be semantic query processing. The current method of warehousing based query processing requires the crawling of all data periodically and also frequent crawling of data from distributed datasets of Linked Data to make the data as up-to-date as possible. Frequent crawling is required for dynamic data to meet the high freshness requirement of real time applications. Crawling large datasets may cause serious scalability problems. In this paper, we propose an Ontology Property-based Adaptive Crawler to alleviate this problem. Linked data are crawled adaptively based on the Change Frequency of the Documents and the Properties. Performance evaluation shows that this system can reduce overhead costs by more than 70% while maintaining a high freshness of data.","PeriodicalId":143986,"journal":{"name":"2013 Fourth International Conference on the Network of the Future (NoF)","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127420212","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
扫码关注我们
求助内容：
应助结果提醒方式：