Computing platforms deployed in many critical infrastructures, such as smart grid, financial systems, governmental organizations etc., are subjected to security attacks and potentially devastating consequences. Computing platforms often get attacked 'physically' by an intruder accessing stored information, studying the internal structure of the hardware or injecting a fault. Even if the attackers fail to gain sensitive information stored in hardware, they may be able to disrupt the hardware or deny service leading to other kinds of security failures in the system. Hardware attacks could be covert or overt, based on the awareness of the intended system. This work classifies existing hardware attacks. Focusing mainly on covert attacks, they are quantified using a proposed schema. Different countermeasure techniques are proposed to prevent such attacks.
{"title":"Hardware Covert Attacks and Countermeasures","authors":"Jahnabi Phukan, K. F. Li, F. Gebali","doi":"10.1109/AINA.2016.144","DOIUrl":"https://doi.org/10.1109/AINA.2016.144","url":null,"abstract":"Computing platforms deployed in many critical infrastructures, such as smart grid, financial systems, governmental organizations etc., are subjected to security attacks and potentially devastating consequences. Computing platforms often get attacked 'physically' by an intruder accessing stored information, studying the internal structure of the hardware or injecting a fault. Even if the attackers fail to gain sensitive information stored in hardware, they may be able to disrupt the hardware or deny service leading to other kinds of security failures in the system. Hardware attacks could be covert or overt, based on the awareness of the intended system. This work classifies existing hardware attacks. Focusing mainly on covert attacks, they are quantified using a proposed schema. Different countermeasure techniques are proposed to prevent such attacks.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116618602","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, biometric authentication protocols are developed. Security of these protocols originates in compromising no privacy information by wiretapping, malicious access and etc. in the authentication processes. With regard to this, the authors pointed out the risk of excessive collection of privacy information caused by remaining data related to biometric authentication data such as logs and intermediate processing data on the authentication servers. As a requirement against this risk, the authors introduced receipt-freeness of biometric authentication protocols. In this research, the authors develop the above research by investigating so-called coercion-resistance which means resistance against coercing user into executing biometric authentication. This paper describes definition of coercion-resistance against wiretapping coercer, relevance to receipt-freeness, and analysis of coercion-resistance in two IC card based protocols. The results show one of the protocols satisfies receipt-freeness and coercion-resistance, although another one does not satisfy.
{"title":"Analysis of \"Receipt-Freeness\" and \"Coercion-Resistance\" in Biometric Authentication Protocols","authors":"Yoshifumi Ueshige, K. Sakurai","doi":"10.1109/AINA.2016.97","DOIUrl":"https://doi.org/10.1109/AINA.2016.97","url":null,"abstract":"Recently, biometric authentication protocols are developed. Security of these protocols originates in compromising no privacy information by wiretapping, malicious access and etc. in the authentication processes. With regard to this, the authors pointed out the risk of excessive collection of privacy information caused by remaining data related to biometric authentication data such as logs and intermediate processing data on the authentication servers. As a requirement against this risk, the authors introduced receipt-freeness of biometric authentication protocols. In this research, the authors develop the above research by investigating so-called coercion-resistance which means resistance against coercing user into executing biometric authentication. This paper describes definition of coercion-resistance against wiretapping coercer, relevance to receipt-freeness, and analysis of coercion-resistance in two IC card based protocols. The results show one of the protocols satisfies receipt-freeness and coercion-resistance, although another one does not satisfy.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"205 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116053835","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}
K. Morioka, J. Naganawa, J. Honda, N. Kanada, S. Futatsumori, A. Kohmura, Takeshi Tomita, N. Yonemoto, Y. Sumiya
Aeronautical Mobile Airport Communications System (AeroMACS) is being standardized in order to provide new broadband wireless communications on airport surface. AeroMACS will be used for voice-based Air Traffic Control (ATC) services in the future as it is recommended in standards and recommended practices (SARPs) of the International Civil Aviation Organization (ICAO). Therefore, we evaluated the quality of voice over IP (VoIP) over AeroMACS for ATC. We developed the AeroMACS prototype system in Sendai Airport, a middle-size local airport in Japan. We carried out field experiments by using the prototype system to evaluate the quality of VoIP. In this paper, we provide experimental results and useful information for designing the AeroMACS system for VoIP-based ATC and airline operational control (AOC) services.
{"title":"Experimental Evaluation on Quality of VoIP over Aero MACS","authors":"K. Morioka, J. Naganawa, J. Honda, N. Kanada, S. Futatsumori, A. Kohmura, Takeshi Tomita, N. Yonemoto, Y. Sumiya","doi":"10.1109/AINA.2016.49","DOIUrl":"https://doi.org/10.1109/AINA.2016.49","url":null,"abstract":"Aeronautical Mobile Airport Communications System (AeroMACS) is being standardized in order to provide new broadband wireless communications on airport surface. AeroMACS will be used for voice-based Air Traffic Control (ATC) services in the future as it is recommended in standards and recommended practices (SARPs) of the International Civil Aviation Organization (ICAO). Therefore, we evaluated the quality of voice over IP (VoIP) over AeroMACS for ATC. We developed the AeroMACS prototype system in Sendai Airport, a middle-size local airport in Japan. We carried out field experiments by using the prototype system to evaluate the quality of VoIP. In this paper, we provide experimental results and useful information for designing the AeroMACS system for VoIP-based ATC and airline operational control (AOC) services.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128364705","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}
Wireless Mesh Networks (WMNs) are attracting a lot of attention from wireless network researchers, because of their potential use in several fields such as collaborative computing and communications. In this paper, we present the implementation of a testbed for WMNs using Raspbian OS. We analyze the performance of Optimized Link State Routing (OLSR) protocol in an indoor scenario. For evaluation we considered throughput, Packet Delivery Ratio (PDR), delay, jitter, hop count, idle and CPU temperature metrics. The experimental results show that the nodes in the testbed were communicating smoothly. The performance of tesbed was better for CPU frequency 700 [MHz].
{"title":"Experimental Results of a Raspberry Pi Based WMN Testbed Considering CPU Frequency","authors":"Tetsuya Oda, L. Barolli","doi":"10.1109/AINA.2016.146","DOIUrl":"https://doi.org/10.1109/AINA.2016.146","url":null,"abstract":"Wireless Mesh Networks (WMNs) are attracting a lot of attention from wireless network researchers, because of their potential use in several fields such as collaborative computing and communications. In this paper, we present the implementation of a testbed for WMNs using Raspbian OS. We analyze the performance of Optimized Link State Routing (OLSR) protocol in an indoor scenario. For evaluation we considered throughput, Packet Delivery Ratio (PDR), delay, jitter, hop count, idle and CPU temperature metrics. The experimental results show that the nodes in the testbed were communicating smoothly. The performance of tesbed was better for CPU frequency 700 [MHz].","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130649666","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}
Saki Tabata, Kohei Ueda, R. Fukui, K. Shimazu, H. Shigeno
Emergency Rescue Information Sharing System supports rescue operations in early stage by gathering information about victims in need of help at the time of disaster. In this system, in-vehicle relays are used to gather extensive information. In-vehicle relays transmit information sent by mobile terminals to a database server via gateway switches. There are several wireless connections between relays and gateway switches to make the transmission redundant. However, information loss occurs when all links are disconnected. In addition, mobile terminals cannot send information without available wireless connections. In this paper, we propose a disaster information gathering mechanism that adopts Web-based offline operation and OpenFlow-based routing control. Offline operation of the system is realized by information caching and synchronization. Wireless links between in-vehicle relays and gateway switches are controlled by OpenFlow. Our mechanism selects a link for transmission dynamically in response to the status and priority changes of the wireless links. In order to prevent information loss while relays isolated from networks, information from mobile terminals is temporarily stored in in-vehicle servers. Prototype demonstration shows that the proposed mechanism can achieve high information gathering rate at the database server.
{"title":"Disaster Information Gathering System Based on Web Caching and OpenFlow in Unstable Networks","authors":"Saki Tabata, Kohei Ueda, R. Fukui, K. Shimazu, H. Shigeno","doi":"10.1109/AINA.2016.80","DOIUrl":"https://doi.org/10.1109/AINA.2016.80","url":null,"abstract":"Emergency Rescue Information Sharing System supports rescue operations in early stage by gathering information about victims in need of help at the time of disaster. In this system, in-vehicle relays are used to gather extensive information. In-vehicle relays transmit information sent by mobile terminals to a database server via gateway switches. There are several wireless connections between relays and gateway switches to make the transmission redundant. However, information loss occurs when all links are disconnected. In addition, mobile terminals cannot send information without available wireless connections. In this paper, we propose a disaster information gathering mechanism that adopts Web-based offline operation and OpenFlow-based routing control. Offline operation of the system is realized by information caching and synchronization. Wireless links between in-vehicle relays and gateway switches are controlled by OpenFlow. Our mechanism selects a link for transmission dynamically in response to the status and priority changes of the wireless links. In order to prevent information loss while relays isolated from networks, information from mobile terminals is temporarily stored in in-vehicle servers. Prototype demonstration shows that the proposed mechanism can achieve high information gathering rate at the database server.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114727242","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 address a problem of classifying and characterizing spatial networks in terms of local connection patterns of node degrees, by especially focusing on the property that the maximum node degrees of these networks are restricted to relatively small numbers. To this end, we propose two methods to analyze a set of such networks by 1) enumerating and counting the combinations of node degrees with respect to connected pair or triple nodes, 2) calculating feature vectors of these networks, which express distributions of mixing patterns' Z scores, and 3) constructing a dendrogram of these networks based on a cosine similarity between these feature vectors. In our experiments using spatial networks constructed from urban streets of seventeen cities, we confirm that our method can produce intuitively interpretable results which reflect regional characteristics of these cities. Moreover, we show that these characteristics can be reasonably described in terms of a relatively small number of selected mixing patterns, as main building blocks of given spatial networks.
{"title":"Characterizing Similarity Structure of Spatial Networks Based on Degree Mixing Patterns","authors":"Arief Maulana, Kazumi Saito, Tetsuo Ikeda, Hiroaki Yuze, Takayuki Watanabe, Seiya Okubo, Nobuaki Mutoh","doi":"10.1109/AINA.2016.116","DOIUrl":"https://doi.org/10.1109/AINA.2016.116","url":null,"abstract":"We address a problem of classifying and characterizing spatial networks in terms of local connection patterns of node degrees, by especially focusing on the property that the maximum node degrees of these networks are restricted to relatively small numbers. To this end, we propose two methods to analyze a set of such networks by 1) enumerating and counting the combinations of node degrees with respect to connected pair or triple nodes, 2) calculating feature vectors of these networks, which express distributions of mixing patterns' Z scores, and 3) constructing a dendrogram of these networks based on a cosine similarity between these feature vectors. In our experiments using spatial networks constructed from urban streets of seventeen cities, we confirm that our method can produce intuitively interpretable results which reflect regional characteristics of these cities. Moreover, we show that these characteristics can be reasonably described in terms of a relatively small number of selected mixing patterns, as main building blocks of given spatial networks.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132034302","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, we study the problems of scalability and performance for similarity search by proposing eHSim, an efficient hybrid similarity search with MapReduce. More specifically, we introduce clustering schemes that partition objects into different groups by their length. Additionally, we equip our proposed schemes with pruning strategies that quickly discard irrelevant objects before truly computing their similarity. Moreover, we design a hybrid MapReduce architecture that deals with challenges from big data. Furthermore, we implement our proposed methods with MapReduce and make them compatible with the hybrid MapReduce architecture. Last but not least, we evaluate the proposed methods with real datasets. Empirical experiments show that our approach is considerably more efficient than state-of-the-arts in terms of query processing, batch processing, and data storage.
{"title":"eHSim: An Efficient Hybrid Similarity Search with MapReduce","authors":"T. Phan, J. Küng, T. K. Dang","doi":"10.1109/AINA.2016.37","DOIUrl":"https://doi.org/10.1109/AINA.2016.37","url":null,"abstract":"In this paper, we study the problems of scalability and performance for similarity search by proposing eHSim, an efficient hybrid similarity search with MapReduce. More specifically, we introduce clustering schemes that partition objects into different groups by their length. Additionally, we equip our proposed schemes with pruning strategies that quickly discard irrelevant objects before truly computing their similarity. Moreover, we design a hybrid MapReduce architecture that deals with challenges from big data. Furthermore, we implement our proposed methods with MapReduce and make them compatible with the hybrid MapReduce architecture. Last but not least, we evaluate the proposed methods with real datasets. Empirical experiments show that our approach is considerably more efficient than state-of-the-arts in terms of query processing, batch processing, and data storage.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132295959","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}
Preferential attachment models have been widely studied in complex networks, because they can explain the formation of many networks like social networks, citation networks, power grids, and biological networks, to name a few. Motivated by the application of key predistribution in wireless sensor networks (WSN), we initiate the study of preferential attachment with degree bound. Our paper has two important contributions to two different areas. The first is a contribution in the study of complex networks. We propose preferential attachment model with degree bound for the first time. In the normal preferential attachment model, the degree distribution follows a power law, with many nodes of low degree and a few nodes of high degree. In our scheme, the nodes can have a maximum degree dmax, where dmax is an integer chosen according to the application. The second is in the security of wireless sensor networks. We propose a new key predistribution scheme based on the above model. The important features of this model are that the network is fully connected, it has fewer keys, has larger size of the giant component and lower average path length compared with traditional key predistribution schemes and comparable resilience to random node attacks. We argue that in many networks like key predistribution and Internet of Things, having nodes of very high degree will be a bottle-neck in communication. Thus, studying preferential attachment model with degree bound will open up new directions in the study of complex networks, and will have many applications in real world scenarios.
{"title":"Preferential Attachment Model with Degree Bound and Its Application to Key Predistribution in WSN","authors":"S. Ruj, Arindam Pal","doi":"10.1109/AINA.2016.141","DOIUrl":"https://doi.org/10.1109/AINA.2016.141","url":null,"abstract":"Preferential attachment models have been widely studied in complex networks, because they can explain the formation of many networks like social networks, citation networks, power grids, and biological networks, to name a few. Motivated by the application of key predistribution in wireless sensor networks (WSN), we initiate the study of preferential attachment with degree bound. Our paper has two important contributions to two different areas. The first is a contribution in the study of complex networks. We propose preferential attachment model with degree bound for the first time. In the normal preferential attachment model, the degree distribution follows a power law, with many nodes of low degree and a few nodes of high degree. In our scheme, the nodes can have a maximum degree dmax, where dmax is an integer chosen according to the application. The second is in the security of wireless sensor networks. We propose a new key predistribution scheme based on the above model. The important features of this model are that the network is fully connected, it has fewer keys, has larger size of the giant component and lower average path length compared with traditional key predistribution schemes and comparable resilience to random node attacks. We argue that in many networks like key predistribution and Internet of Things, having nodes of very high degree will be a bottle-neck in communication. Thus, studying preferential attachment model with degree bound will open up new directions in the study of complex networks, and will have many applications in real world scenarios.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132546747","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 live in a world where every electronic device generates data, and does so in a variety of ways that respect a multitude of patterns particular to every device and user. Some users user their phone to browse the Internet on their daily commute, some check it for updates every hour, and some may use it constantly throughout the day to accomplish different tasks. Even the same device can be used in variety of ways, let alone different devices. Besides the user generated data, there is also machine generated data, which can have a more foreseeable pattern, like nightly backups or scheduled tasks, but usually imply more CPU or I/O intensive tasks than the sporadic ones generated by human users. In a context where the analyzed data size is constantly increasing and we start to talk about Big Data in more and more daily tasks, we need a way to handle all these diverse tasks that serve a variety of purposes. Some of this data must be sometimes analyzed as fast as possible, or, in some cases the analysis can be done at the end of the day, as part of a batch process. In order to handle all this diversity we design a real-time and job scheduler in Hadoop for Big Data processing that addresses both the problem of small tasks that need to be executed in real time, and in the same time, adjust for long-running jobs where time of completion is not that strictly defined. The case study is applied as support for Smart City applications that are gathered / routed / stored via mobile devices and processed / diffused via a more standard Clouds.
{"title":"Soft Real-Time Hadoop Scheduler for Big Data Processing in Smart Cities","authors":"Ciprian Barbieru, Florin Pop","doi":"10.1109/AINA.2016.122","DOIUrl":"https://doi.org/10.1109/AINA.2016.122","url":null,"abstract":"We live in a world where every electronic device generates data, and does so in a variety of ways that respect a multitude of patterns particular to every device and user. Some users user their phone to browse the Internet on their daily commute, some check it for updates every hour, and some may use it constantly throughout the day to accomplish different tasks. Even the same device can be used in variety of ways, let alone different devices. Besides the user generated data, there is also machine generated data, which can have a more foreseeable pattern, like nightly backups or scheduled tasks, but usually imply more CPU or I/O intensive tasks than the sporadic ones generated by human users. In a context where the analyzed data size is constantly increasing and we start to talk about Big Data in more and more daily tasks, we need a way to handle all these diverse tasks that serve a variety of purposes. Some of this data must be sometimes analyzed as fast as possible, or, in some cases the analysis can be done at the end of the day, as part of a batch process. In order to handle all this diversity we design a real-time and job scheduler in Hadoop for Big Data processing that addresses both the problem of small tasks that need to be executed in real time, and in the same time, adjust for long-running jobs where time of completion is not that strictly defined. The case study is applied as support for Smart City applications that are gathered / routed / stored via mobile devices and processed / diffused via a more standard Clouds.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"3 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133670254","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}
Sergio Charpinel, Celso A. S. Santos, A. Vieira, R. Villaça, M. Martinello
Content Centric Networking (CCN) represents an important change in the current operation of the Internet, prioritizing content over the communication between end nodes. Routers play an essential role in CCN, since they receive the requests for a given content and provide content caching for the most popular ones. They have their own forwarding strategies and caching policies for the most popular contents. Despite the number of works on this field, experimental evaluation of different forwarding algorithms and caching policies yet demands a huge effort in routers programming. In this paper we propose SDCCN, a SDN approach to CCN that provides programmable forwarding strategy and caching policies. SDCCN allows fast prototyping and experimentation in CCN. Proofs of concept were performed to demonstrate the programmability of the cache replacement algorithms and the Strategy Layer. Experimental results, obtained through implementation in the Mininet environment, are presented and evaluated.
{"title":"SDCCN: A Novel Software Defined Content-Centric Networking Approach","authors":"Sergio Charpinel, Celso A. S. Santos, A. Vieira, R. Villaça, M. Martinello","doi":"10.1109/AINA.2016.86","DOIUrl":"https://doi.org/10.1109/AINA.2016.86","url":null,"abstract":"Content Centric Networking (CCN) represents an important change in the current operation of the Internet, prioritizing content over the communication between end nodes. Routers play an essential role in CCN, since they receive the requests for a given content and provide content caching for the most popular ones. They have their own forwarding strategies and caching policies for the most popular contents. Despite the number of works on this field, experimental evaluation of different forwarding algorithms and caching policies yet demands a huge effort in routers programming. In this paper we propose SDCCN, a SDN approach to CCN that provides programmable forwarding strategy and caching policies. SDCCN allows fast prototyping and experimentation in CCN. Proofs of concept were performed to demonstrate the programmability of the cache replacement algorithms and the Strategy Layer. Experimental results, obtained through implementation in the Mininet environment, are presented and evaluated.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133132085","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
扫码关注我们
求助内容：
应助结果提醒方式：