{"title":"Locating the content in the locality: ICN caching and routing strategy revisited","authors":"M. Arifuzzaman, Keping Yu, Q. Nguyen, Takuro Sato","doi":"10.1109/EuCNC.2015.7194111","DOIUrl":"https://doi.org/10.1109/EuCNC.2015.7194111","url":null,"abstract":"In Information Centric Networking (ICN), besides Off-path caching, On-path caching is an integrated caching solution with-in an ISP's local network. However, in On-path caching, content is cached en-route in the backward path towards the Interest generator and local RENE1/NRS2 (in routing through name resolution) or FIB3 (in name-based routing) is not aware of the cached data. Hence, the most widely used intra-domain routing protocol and their forwarding strategy cannot address all available temporary cached copies of content. Thus, on-path caching strategy usually suffers from either of the two drawbacks- (1) too many replications within AS (Autonomous system) which do not add substantial value in terms of cache resource utilization. (2) An attempt to minimize redundancy ends up with the cost of fetching more copy of the same content from the repository (i.e., the closest cache copy is unknown/ not en-route). We propose an integrated routing and caching solution which reduces the caching redundancy and maximize the probability of finding nearby cached content, resulting in efficient utilization of available cache resources of ISP's as a whole. We introduce novel concepts of naming the content router and caching the content's cache-route to address the issue. We leverage NDN node architecture and the forwarding plane/strategy (of routing) as well to achieve our goal.","PeriodicalId":310313,"journal":{"name":"2015 European Conference on Networks and Communications (EuCNC)","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114473155","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}
{"title":"Towards manufacturing 2.0: An innovative architecture for the Factory of the Future","authors":"A. Fiaschetti, A. Pietrabissa, F. D. Priscoli","doi":"10.1109/EuCNC.2015.7194116","DOIUrl":"https://doi.org/10.1109/EuCNC.2015.7194116","url":null,"abstract":"Industrial manufacturing processes today show an exponential complexity growth rate and the human operator are flooded by an overwhelming complexity and information. In addition, the higher and higher production rates enforced in modern production plants do not allow any human operator to control the process efficiently with traditional tools. Therefore, innovative paradigms and technologies to cope with manufacturing processes must be explored, mainly based on massive adoption of ICT solutions. Inspired by the most recent advances in information and communication technologies developed in the Future Internet framework and, in particular, in the PLATINO project, this paper presents an innovative architectural solution to improve the capabilities and performance of modern production plants: the so-called “cognitive middleware for manufacturing”. This architectural paradigm aims at stressing the use and integration of ICT technologies (e.g. semantic, middleware, optimization algorithms, ...) into an holistic framework to be transparently adopted into existing factories as well as embedded in the design of future ones. This solution has been formalized following the guidelines and expectations depicted in the MANUFUTURE Technology Platform SRA, the most valuable EU Organization performing research in this field and represents an innovative cross-fertilization between Future Internet and Future Manufacturing.","PeriodicalId":310313,"journal":{"name":"2015 European Conference on Networks and Communications (EuCNC)","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116057302","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}
{"title":"Multipath routing in SDN-based Data Center Networks","authors":"Yikang Lei, Kuochen Wang, Yi-Huai Hsu","doi":"10.1109/EuCNC.2015.7194100","DOIUrl":"https://doi.org/10.1109/EuCNC.2015.7194100","url":null,"abstract":"We propose an SDN-based adaptive worst-fit multipath routing (AWMR) algorithm for Data Center Networks (DCNs) which can select multiple routing paths and determine the number of paths used for a new-coming flow according to the available network resources and the demanded bandwidth of the new-coming flow, instead of using a fixed number of routing paths for each flow. The proposed AWMR is composed of two stages. The first stage of the proposed AWMR finds an initial routing path set that includes paths whose lengths are the shortest between source and destination hosts, and computes available bandwidth of such a path set. The second stage of the proposed AWMR, which utilizes an improved widest disjoint path (iwdp) scheme, then selects the worst-fit paths according to the demanded bandwidth of the new-coming flow. Since the proposed AWMR minimizes the number of routing paths used effectively, the cost of constructing multiple paths can be decreased. Since the proposed AWMR selects multiple paths in a global view rather than in a local view of DFS+worst-fit-link, which is a representative related work, the proposed AWMR can get smaller average end-to-end delay by avoiding the shared bottleneck link problem among multiple paths. Using EstiNet, simulation results show that the proposed AWMR outperforms DFS+worst-fit-link in terms of average end-to-end delay, average throughput per flow, and average packet delivery ratio.","PeriodicalId":310313,"journal":{"name":"2015 European Conference on Networks and Communications (EuCNC)","volume":"20 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121000419","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}
Haipeng Li, H. Nakazato, A. Detti, N. Blefari-Melazzi
{"title":"Popularity Proportional Cache Size Allocation policy for video delivery on CCN","authors":"Haipeng Li, H. Nakazato, A. Detti, N. Blefari-Melazzi","doi":"10.1109/EuCNC.2015.7194113","DOIUrl":"https://doi.org/10.1109/EuCNC.2015.7194113","url":null,"abstract":"Content Centric Networking (CCN), which is regarded as an innovational architecture of future network, is increasingly gaining attention in recent years. Based on the observation of current Internet usage, CCN presents a content-centric model which focuses on data distribution and retrieval. To enhance the efficiency of content distribution, In-network caching is adopted, which enables routers to temporarily store the passing by data. Thus the scheme of cache management will affect the network performance significantly. In this paper, a cache replacement policy named Popularity Proportional Cache Size Allocation (PPCSA) policy has been proposed, which designed for video content delivery on CCN. Unlike other previous works in this area, which have focused on the popularity of individual content chunks, in this study, we not only consider the title-level popularity of a video which is composed of a set of video segments, but also take the chunk-level probability of video segments within a video title into consideration. We evaluated our policy through simulations, by using a simple 4-level tree topology and a real network based hybrid topology. The results validate that on both scenarios, the proposed approach can increase the average cache hit ratio and shorten the average content delivery distance between requesters and object contents. In addition, we analyzed the energy efficiency of PPCSA policy, and we found that compared to other three cache replacement policies, Least Recently Used (LRU), Least Frequently Used (LFU) and First in First out (FIFO), PPCSA reduced the transmission energy consumption, and improved the energy efficiency in idle time.","PeriodicalId":310313,"journal":{"name":"2015 European Conference on Networks and Communications (EuCNC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131800866","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}
{"title":"Software reconfigurable PONs utilizing digital filter multiple access","authors":"M. Bolea, X. Duan, R. Giddings, Jianming Tang","doi":"10.1109/EuCNC.2015.7194094","DOIUrl":"https://doi.org/10.1109/EuCNC.2015.7194094","url":null,"abstract":"Digital filter multiple access (DFMA) passive optical networks (PONs) are proposed and investigated, where digital signal processing (DSP)-enabled, software reconfigurable, digital orthogonal filtering is employed in each individual optical network unit (ONU) and the optical line terminal (OLT) to enable all ONUs to dynamically share the transmission medium under the control of the centralized software-defined controller and the transceiver-embedded DSP controllers. The DFMA PONs fully support software-defined networking (SDN) with the network control further extended to the physical layer. As digital filtering is the fundamental process at the heart of the proposed DFMA PONs, the filtering-induced trade-offs among upstream transmission capacity, filter design flexibility and filter DSP complexity are examined, based on which optimum filter design guidelines are identified for various application scenarios. Furthermore, the performance characteristics of the DFMA PONs are also numerically explored in terms of maximum achievable upstream transmission capacity and ONU count-dependent minimum received optical power.","PeriodicalId":310313,"journal":{"name":"2015 European Conference on Networks and Communications (EuCNC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131742078","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}
D. Trossen, M. Reed, Janne Riihijärvi, M. Georgiades, N. Fotiou, G. Xylomenos
{"title":"IP over ICN - The better IP?","authors":"D. Trossen, M. Reed, Janne Riihijärvi, M. Georgiades, N. Fotiou, G. Xylomenos","doi":"10.1109/EuCNC.2015.7194109","DOIUrl":"https://doi.org/10.1109/EuCNC.2015.7194109","url":null,"abstract":"This paper presents a proposition for information centric networking (ICN) that lies outside the typical trajectory of aiming for a wholesale replacement of IP as the internetworking layer of the Internet. Instead, we propose that a careful exploitation of key ICN benefits, expanding previously funded ICN efforts, will enable individual operators to improve the performance of their IP-based services along many dimensions. Alongside the main motivation for our work, we present an early strawman architecture for such an IP-over-ICN proposition, which will ultimately be implemented and trialed in a recently started H2020 research effort.","PeriodicalId":310313,"journal":{"name":"2015 European Conference on Networks and Communications (EuCNC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133965632","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}
Sébastien Auroux, Martin Dräxler, Arianna Morelli, V. Mancuso
{"title":"Dynamic network reconfiguration in wireless DenseNets with the CROWD SDN architecture","authors":"Sébastien Auroux, Martin Dräxler, Arianna Morelli, V. Mancuso","doi":"10.1109/EuCNC.2015.7194057","DOIUrl":"https://doi.org/10.1109/EuCNC.2015.7194057","url":null,"abstract":"Traffic in wireless access networks has been growing substantially in the recent years, both in terms of total volume and data rate required by individual users. The commonly agreed solution to overcome the current limitations of wireless access networks is to deploy very dense and heterogeneous wireless networks, the so-called DenseNets. Simply scaling existing networks by orders of magnitude, as required to fulfill traffic forecasts, would bring along several problems because of the limited backhaul capacity, the increased energy consumption, and the explosion of signalling. Hence, the FP7 project CROWD proposes a novel architecture for DenseNets as a solution to tame the density of wireless networks. Within this architecture, flexible flow processing-aware controller placement supported by dynamic backhaul reconfiguration is the crucial component to both (i) maximize the amount of users that can be served simultaneously under high load, and (ii) minimize energy consumption and reduce costs for service providers. We present both approaches in detail and outline how they are integrated into the overall CROWD architecture.","PeriodicalId":310313,"journal":{"name":"2015 European Conference on Networks and Communications (EuCNC)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121953549","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}
{"title":"Impacts of the packet scheduling on the performance of erasure codes: Methodology and application to GLDPC-Staircase codes","authors":"Ferdaouss Mattoussi, V. Roca, B. Sayadi","doi":"10.1109/EuCNC.2015.7194119","DOIUrl":"https://doi.org/10.1109/EuCNC.2015.7194119","url":null,"abstract":"Content broadcasting over wireless networks heavily relies on Application-Level FEC codes to improve transmission robustness in front of channel erasures. Because they operate in the higher layers of the protocol stack, they benefit from a lot of flexibility. In particular, since streaming applications and bulk transfer applications have different constraints, different packet scheduling strategies may be used by the sender, offering different trade-offs between decoding latency and long erasure burst protection. This work tries to find the best packet scheduling scheme(s) at a sender for a given type of AL-FEC codes. The contributions are twofold: first we define a methodology to measure the impacts of packet scheduling on AL-FEC performance, both under ITerative (IT) and Maximum Likelihood (ML) decoding, for a large set of channels; then we apply this methodology to GLDPC-Staircase codes, an extension of LDPC-Staircase codes using Reed Solomon codes as inner codes. In previous works we showed that these codes have erasure recovery performance close to ideals codes when packets are transmitted in a random order. In this work we show that these codes perform extremely well when sending source packets sequentially first (a key requirement to keep latency minimum with streaming applications) and then extra-repair packets followed by LDPC repair packets, both in a random order.","PeriodicalId":310313,"journal":{"name":"2015 European Conference on Networks and Communications (EuCNC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125208340","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}
S. Dimitrov, Stefan Erl, B. Barth, S. Jaeckel, A. Kyrgiazos, B. Evans
{"title":"Radio resource management techniques for high throughput satellite communication systems","authors":"S. Dimitrov, Stefan Erl, B. Barth, S. Jaeckel, A. Kyrgiazos, B. Evans","doi":"10.1109/EuCNC.2015.7194063","DOIUrl":"https://doi.org/10.1109/EuCNC.2015.7194063","url":null,"abstract":"In this paper, interference-aware radio resource management (RRM) algorithms are presented for the forward and return links of geostationary orbit (GEO) high throughput satellite (HTS) communication system. For the feeder link, satellite-switched smart gateway diversity is combined with two scheduling methods to improve the feeder link availability in rain conditions. For the user link, interference-aware scheduling (IAS) for the forward link and scheduling based on multi-partite graph matching for the return link are shown to enable full frequency reuse (FR) multi-beam satellite systems. The performance assessment of scheduling algorithms is carried out in a system-level simulator with realistic channel models and system assumptions. The improvements of the system capacity and user rates are evaluated.","PeriodicalId":310313,"journal":{"name":"2015 European Conference on Networks and Communications (EuCNC)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121589909","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}
{"title":"Tackling Bufferbloat in capacity-limited networks","authors":"C. Kulatunga, N. Kuhn, G. Fairhurst, David Ros","doi":"10.1109/EuCNC.2015.7194103","DOIUrl":"https://doi.org/10.1109/EuCNC.2015.7194103","url":null,"abstract":"Over-provisioned network buffers, often at the Internet edge, induce large queuing delay and high latency; this issue is known as Bufferbloat. In response to this, a set of recently proposed Active Queue Management (AQM) algorithms attempt to reduce standing queues, while maintaining the bottleneck utilisation at an acceptable level. This paper assesses the performance of two AQM schemes (CoDel and FQ-CoDel) over capacity-limited networks with large Round-Trip Time (RTT). In such settings, these AQM schemes have difficulty controlling the buffering level, resulting in both momentarily high queuing delay and low bottleneck utilisation, even if the methods are claimed to be insensitive to link rates and round-trip delays. We explore this issue and show that it is possible to adapt the parameterisation of CoDel and FQ-CoDel to offer a higher bottleneck utilisation while maintaining a low queuing delay. We present experiments over an emulated test bed and a satellite network to confirm that our new parameterisation improves the download time of moderate-size files and reduces the latency for capacity-limited and large-RTT networks.","PeriodicalId":310313,"journal":{"name":"2015 European Conference on Networks and Communications (EuCNC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129041328","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}