To support mobility in the Internet is becoming an urgent need in the near future. So far a large number of solutions are proposed providing various methods, but there still exist many open questions on how to add the new feature of mobility into the Internet architecture. In this paper we pay attention to the approaches with a new identifier namespace introduced. We give an overview to such schemes followed by a qualitative comparison, to find out that they differ in many aspects in achieving various design goals. We then focus on core mobility mechanisms of the proposals and abstract their common elements to form an overlay network called ION. By preliminary analyze on ION, we argue that a particular key point towards better identifier-based mobility support is to balance the tradeoff between mapping dynamics and routing path stretch in the overlay. Though lack of detailed modeling and data support (which is in our future work), we consider the viewpoint in this paper to be useful in designing of new identifier-based mobility methods.
{"title":"Mobility support in the internet using identifiers","authors":"You Wang, J. Bi, Xiaoke Jiang","doi":"10.1145/2377310.2377322","DOIUrl":"https://doi.org/10.1145/2377310.2377322","url":null,"abstract":"To support mobility in the Internet is becoming an urgent need in the near future. So far a large number of solutions are proposed providing various methods, but there still exist many open questions on how to add the new feature of mobility into the Internet architecture. In this paper we pay attention to the approaches with a new identifier namespace introduced. We give an overview to such schemes followed by a qualitative comparison, to find out that they differ in many aspects in achieving various design goals. We then focus on core mobility mechanisms of the proposals and abstract their common elements to form an overlay network called ION. By preliminary analyze on ION, we argue that a particular key point towards better identifier-based mobility support is to balance the tradeoff between mapping dynamics and routing path stretch in the overlay. Though lack of detailed modeling and data support (which is in our future work), we consider the viewpoint in this paper to be useful in designing of new identifier-based mobility methods.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114138582","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}
This paper proposes future datacenter network architecture to support scalability and interworking huge datacenter networks by applying ID/LOC separation function from MOFI (Mobile Oriented Future Internet).
{"title":"Exploiting mobile oriented future internet (MOFI) for future cloud datacenter networks","authors":"Taewan You, Heeyoung Jung","doi":"10.1145/2377310.2377329","DOIUrl":"https://doi.org/10.1145/2377310.2377329","url":null,"abstract":"This paper proposes future datacenter network architecture to support scalability and interworking huge datacenter networks by applying ID/LOC separation function from MOFI (Mobile Oriented Future Internet).","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115984918","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}
Recently, dynamic reconfiguration of routes using link quality metrics is required to support application requirements such as throughput or jitter in dynamically changing environments in mobile ad-hoc networks (MANETs). Since multiple types of applications will be running over a MANET, the route reconfiguration should be aware of application characteristics and requirements rather than a single application type. We propose an application-aware self-reconfiguration scheme for multi-radio routing protocols that supports distinguished route reconfiguration for each application type. The detection of a deteriorated link and the selection of an alternative link are done separately based on application types and the bandwidth requirement.
{"title":"Application-aware self-reconfigurable routing support for multi-radio MANET protocols","authors":"B. Shin, Seon-Yeong Han, Dongman Lee","doi":"10.1145/2377310.2377330","DOIUrl":"https://doi.org/10.1145/2377310.2377330","url":null,"abstract":"Recently, dynamic reconfiguration of routes using link quality metrics is required to support application requirements such as throughput or jitter in dynamically changing environments in mobile ad-hoc networks (MANETs). Since multiple types of applications will be running over a MANET, the route reconfiguration should be aware of application characteristics and requirements rather than a single application type. We propose an application-aware self-reconfiguration scheme for multi-radio routing protocols that supports distinguished route reconfiguration for each application type. The detection of a deteriorated link and the selection of an alternative link are done separately based on application types and the bandwidth requirement.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114596207","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}
We propose an innovative content caching replacement strategy for future content delivery networks. Ultimately, we provide new insight in caching design by the inspiration of a human memory system.
{"title":"A novel content caching replacement strategy inspired by a human memory system","authors":"Jihoon Sung, Yoontae Kim, O. Kwon, Sangsu Jung","doi":"10.1145/2377310.2377327","DOIUrl":"https://doi.org/10.1145/2377310.2377327","url":null,"abstract":"We propose an innovative content caching replacement strategy for future content delivery networks. Ultimately, we provide new insight in caching design by the inspiration of a human memory system.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"324 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130255909","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}
Dukhyun Chang, Junho Suh, Hyogi Jung, T. Kwon, Yanghee Choi
Traffic of content-oriented applications/service is increasingly more dominant. How to support content delivery and distribution efficiently is one of the important issues in future Internet community. In contrast to clean slate approaches in the recent literature, we seek to deliver content efficiently leveraging current networking devices with programmability. In particular, we propose how to deliver content across Internet service providers (ISPs) on top of OpenFlow. We design a preliminary framework to support content delivery network interconnection (CDNI) assuming two ISPs have deployed OpenFlow. There are two central ideas to realize CDNI across ISPs: (i) request and data packets of a content file are forwarded by a private address (assigned to the file) in each ISP, and (ii) the controllers of the two ISPs exchange the signaling information to deliver the content.
{"title":"How to realize CDN interconnection (CDNI) over OpenFlow?","authors":"Dukhyun Chang, Junho Suh, Hyogi Jung, T. Kwon, Yanghee Choi","doi":"10.1145/2377310.2377319","DOIUrl":"https://doi.org/10.1145/2377310.2377319","url":null,"abstract":"Traffic of content-oriented applications/service is increasingly more dominant. How to support content delivery and distribution efficiently is one of the important issues in future Internet community. In contrast to clean slate approaches in the recent literature, we seek to deliver content efficiently leveraging current networking devices with programmability. In particular, we propose how to deliver content across Internet service providers (ISPs) on top of OpenFlow. We design a preliminary framework to support content delivery network interconnection (CDNI) assuming two ISPs have deployed OpenFlow. There are two central ideas to realize CDNI across ISPs: (i) request and data packets of a content file are forwarded by a private address (assigned to the file) in each ISP, and (ii) the controllers of the two ISPs exchange the signaling information to deliver the content.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130788694","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}
The information centric paradigm assumes that the Future Internet will be built around contents rather than host locations. In this direction, the promising Content Centric Networking (CCN) architecture has been conceived to solve the problems of the today Internet by means of a novel way for distributing contents (based on their names) and by adopting distributed caching mechanisms. CCN can be particularly beneficial in an ad hoc networking environments, where the main goal is the delivery of data to a given destination node no matter its position, and moreover, in scenarios characterized by limited connectivity, just as wireless ad hoc networks. Some interesting works, available in literature, propose the exploitation of CCN paradigm in Mobile Ad hoc Networks or Vehicular Ad hoc Networks. Our contribute, here, is to provide the scientific community with a new fully customizable and open source emulation platform, named CCN-Joker, well-suited for wireless devices with limited resources. The rationale of the developed tool entails an application-level overlay. It is composed by several modules interacting with the data structures which a CCN node is commonly made of. We also conduct some preliminary experiments in a small overlay (composed by six EFIKA powerPC boards, equipped by a Wifi external card), analyzing the content distribution process, the hit ratio, and the average download time. These preliminary results confirm the suitability of CCN-Joker to study the CCN performance in Mobile Ad hoc Networks or Vehicular Ad hoc Networks.
{"title":"CCN - Java opensource kit EmulatoR for wireless ad hoc networks","authors":"Ilaria Cianci, L. Grieco, G. Boggia","doi":"10.1145/2377310.2377313","DOIUrl":"https://doi.org/10.1145/2377310.2377313","url":null,"abstract":"The information centric paradigm assumes that the Future Internet will be built around contents rather than host locations. In this direction, the promising Content Centric Networking (CCN) architecture has been conceived to solve the problems of the today Internet by means of a novel way for distributing contents (based on their names) and by adopting distributed caching mechanisms. CCN can be particularly beneficial in an ad hoc networking environments, where the main goal is the delivery of data to a given destination node no matter its position, and moreover, in scenarios characterized by limited connectivity, just as wireless ad hoc networks. Some interesting works, available in literature, propose the exploitation of CCN paradigm in Mobile Ad hoc Networks or Vehicular Ad hoc Networks. Our contribute, here, is to provide the scientific community with a new fully customizable and open source emulation platform, named CCN-Joker, well-suited for wireless devices with limited resources. The rationale of the developed tool entails an application-level overlay. It is composed by several modules interacting with the data structures which a CCN node is commonly made of. We also conduct some preliminary experiments in a small overlay (composed by six EFIKA powerPC boards, equipped by a Wifi external card), analyzing the content distribution process, the hit ratio, and the average download time. These preliminary results confirm the suitability of CCN-Joker to study the CCN performance in Mobile Ad hoc Networks or Vehicular Ad hoc Networks.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130690206","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}
Alberto J. Gonzalez, M. Germán, Jesus Alcober i Segura, R. Pozuelo, Francesc Pinyol, K. Ghafoor
Internet is becoming a huge heterogeneous and dynamic network that is growing beyond its architectural limits. The scaling up of the number of communicating nodes and services is leading the Internet to an architectural crisis which in turn makes it difficult to provide services efficiently considering the requirements and context conditions of users. The Information-Centric Networking (ICN) approach proposes a network where the main paradigm is not an end-to-end communication between hosts, as in the current Internet. Instead, an increasing demand for efficient distribution of content has motivated the development of architectures that focus on information objects. ICN supports the proliferation of services and contents allowing seamless access to them. This work proposes a context-aware service negotiation protocol which will enable to find and compose services whilst meeting requesters' requirements and, consequently, maximizing the QoE of users. We also provide the main details of a first implementation of the proposed service-oriented solution (SCI-FI) and discuss the gathered results.
{"title":"Enabling SCI-FI: service-oriented context-aware and intelligent future internet","authors":"Alberto J. Gonzalez, M. Germán, Jesus Alcober i Segura, R. Pozuelo, Francesc Pinyol, K. Ghafoor","doi":"10.1145/2377310.2377333","DOIUrl":"https://doi.org/10.1145/2377310.2377333","url":null,"abstract":"Internet is becoming a huge heterogeneous and dynamic network that is growing beyond its architectural limits. The scaling up of the number of communicating nodes and services is leading the Internet to an architectural crisis which in turn makes it difficult to provide services efficiently considering the requirements and context conditions of users. The Information-Centric Networking (ICN) approach proposes a network where the main paradigm is not an end-to-end communication between hosts, as in the current Internet. Instead, an increasing demand for efficient distribution of content has motivated the development of architectures that focus on information objects. ICN supports the proliferation of services and contents allowing seamless access to them. This work proposes a context-aware service negotiation protocol which will enable to find and compose services whilst meeting requesters' requirements and, consequently, maximizing the QoE of users. We also provide the main details of a first implementation of the proposed service-oriented solution (SCI-FI) and discuss the gathered results.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121186083","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}
The lack of scalable routing algorithms is one of the main obstacles that slow down a large deployment of Content Centric Networking on an Internet-scale. From one side, content based networking promises to solve the current problems of the Internet. On the other hand, instead, it requires routers to account for a very huge amount of content names. Bloom Filters are widely recognized as a possible solution to this limitation. At the same time, their adoption requires careful tuning rules and novel design methodologies. In this perspective, the present contribution proposes a Bloom Filter-based routing scheme for Content Centric Networking (CCN) and shows several preliminary observations about Bloom Filters size and signaling overhead.
{"title":"CCN forwarding engine based on Bloom filters","authors":"M. Tortelli, L. Grieco, G. Boggia","doi":"10.1145/2377310.2377314","DOIUrl":"https://doi.org/10.1145/2377310.2377314","url":null,"abstract":"The lack of scalable routing algorithms is one of the main obstacles that slow down a large deployment of Content Centric Networking on an Internet-scale. From one side, content based networking promises to solve the current problems of the Internet. On the other hand, instead, it requires routers to account for a very huge amount of content names. Bloom Filters are widely recognized as a possible solution to this limitation. At the same time, their adoption requires careful tuning rules and novel design methodologies. In this perspective, the present contribution proposes a Bloom Filter-based routing scheme for Content Centric Networking (CCN) and shows several preliminary observations about Bloom Filters size and signaling overhead.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130206855","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}
In this paper, based on the emerging SDN (Software-Defined Networking) paradigm, we present our on-going work on realizing a programmable switching node supporting in-network processing for multi-screen content consumption with balancing its use of computing/networking resources.
{"title":"Prototype of a programmable computing/networking switch for multi-screen content consumption","authors":"N. Kim, JongWon Kim","doi":"10.1145/2377310.2377318","DOIUrl":"https://doi.org/10.1145/2377310.2377318","url":null,"abstract":"In this paper, based on the emerging SDN (Software-Defined Networking) paradigm, we present our on-going work on realizing a programmable switching node supporting in-network processing for multi-screen content consumption with balancing its use of computing/networking resources.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134100660","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}
RFID technologies in IoT systems enable to recognize animate or inanimate objects via radio frequency signals. However, RFID has several privacy problems such as object tracking by reading and tracking the ID transmitted from the RFID-tag. To solve such problems, it is required that the RFID-tag should transmit its information to only legitimate readers, i.e., mutual authentication between the RFID-tag and the back-end system is required. This paper proposes a hash-function based mutual authentication protocol for low-cost RFID-tags in which calculation resources are limited. To prevent attackers eavesdropping tag's ID, randomly-picked nicknames shared between the RFID-tag and the back-end system are transmitted in the air. Simulation results show that our protocol consumes less time than a famous mutual authentication protocol, the Gossamer protocol. Security and performance analyses show that our protocol is superior to existing protocols. Thus, this paper demonstrates great potentials in the application into low-cost RFID in IoT systems.
{"title":"Privacy protection for low-cost RFID tags in IoT systems","authors":"Ye Li, F. Teraoka","doi":"10.1145/2377310.2377335","DOIUrl":"https://doi.org/10.1145/2377310.2377335","url":null,"abstract":"RFID technologies in IoT systems enable to recognize animate or inanimate objects via radio frequency signals. However, RFID has several privacy problems such as object tracking by reading and tracking the ID transmitted from the RFID-tag. To solve such problems, it is required that the RFID-tag should transmit its information to only legitimate readers, i.e., mutual authentication between the RFID-tag and the back-end system is required. This paper proposes a hash-function based mutual authentication protocol for low-cost RFID-tags in which calculation resources are limited. To prevent attackers eavesdropping tag's ID, randomly-picked nicknames shared between the RFID-tag and the back-end system are transmitted in the air. Simulation results show that our protocol consumes less time than a famous mutual authentication protocol, the Gossamer protocol. Security and performance analyses show that our protocol is superior to existing protocols. Thus, this paper demonstrates great potentials in the application into low-cost RFID in IoT systems.","PeriodicalId":409750,"journal":{"name":"International Conference of Future Internet","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122200463","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
扫码关注我们
求助内容：
应助结果提醒方式：