308 research outputs found

    Novel applications and contexts for the cognitive packet network

    Get PDF
    Autonomic communication, which is the development of self-configuring, self-adapting, self-optimising and self-healing communication systems, has gained much attention in the network research community. This can be explained by the increasing demand for more sophisticated networking technologies with physical realities that possess computation capabilities and can operate successfully with minimum human intervention. Such systems are driving innovative applications and services that improve the quality of life of citizens both socially and economically. Furthermore, autonomic communication, because of its decentralised approach to communication, is also being explored by the research community as an alternative to centralised control infrastructures for efficient management of large networks. This thesis studies one of the successful contributions in the autonomic communication research, the Cognitive Packet Network (CPN). CPN is a highly scalable adaptive routing protocol that allows for decentralised control in communication. Consequently, CPN has achieved significant successes, and because of the direction of research, we expect it to continue to find relevance. To investigate this hypothesis, we research new applications and contexts for CPN. This thesis first studies Information-Centric Networking (ICN), a future Internet architecture proposal. ICN adopts a data-centric approach such that contents are directly addressable at the network level and in-network caching is easily supported. An optimal caching strategy for an information-centric network is first analysed, and approximate solutions are developed and evaluated. Furthermore, a CPN inspired forwarding strategy for directing requests in such a way that exploits the in-network caching capability of ICN is proposed. The proposed strategy is evaluated via discrete event simulations and shown to be more effective in its search for local cache hits compared to the conventional methods. Finally, CPN is proposed to implement the routing system of an Emergency Cyber-Physical System for guiding evacuees in confined spaces in emergency situations. By exploiting CPNโ€™s QoS capabilities, different paths are assigned to evacuees based on their ongoing health conditions using well-defined path metrics. The proposed system is evaluated via discrete-event simulations and shown to improve survival chances compared to a static system that treats evacuees in the same way.Open Acces

    Adaptive Caching Strategy Based on Big Data Learning in ICN

    Get PDF
    In-network caching, a typical feature of information centric networking (ICN) architecture, has played an important role on the network performance. Existing caching management strategies mainly focus on minimizing the redundancy content by exploiting either node data or content data respectively, which may not lead to effectively improve the caching performance, as there is no consideration on supplementary action of these two types of data. In this paper, the correlation between node data and content data brought by the big data are analyzed and mined to determine whether the selected content are cached in a few suitable nodes, and a Big data driven Adaptive In-network Caching management strategy (BAIC) is proposed. Driven by the current state of node and content, a novel multidimensional state attribution data model including network, node and content data is proposed. Based on the data model, the mapping relationship between the status data and the matching relationship value is further analyzed and mined. And then utilizing this mapping relationship function, the matching algorithm to predict the matching relationship between the node and the content in the next time period is proposed. The simulation experiments demonstrate that the proposed BAIC has significantly improved the network performance

    Flexpop: A popularity-based caching strategy for multimedia applications in information-centric networking

    Get PDF
    Information-Centric Networking (ICN) is the dominant architecture for the future Internet. In ICN, the content items are stored temporarily in network nodes such as routers. When the memory of routers becomes full and there is no room for a new arriving content, the stored contents are evicted to cope with the limited cache size of the routers. Therefore, it is crucial to develop an effective caching strategy for keeping popular contents for a longer period of time. This study proposes a new caching strategy, named Flexible Popularity-based Caching (FlexPop) for storing popular contents. The FlexPop comprises two mechanisms, i.e., Content Placement Mechanism (CPM), which is responsible for content caching, and Content Eviction Mechanism (CEM) that deals with content eviction when the router cache is full and there is no space for the new incoming content. Both mechanisms are validated using Fuzzy Set Theory, following the Design Research Methodology (DRM) to manifest that the research is rigorous and repeatable under comparable conditions. The performance of FlexPop is evaluated through simulations and the results are compared with those of the Leave Copy Everywhere (LCE), ProbCache, and Most Popular Content (MPC) strategies. The results show that the FlexPop strategy outperforms LCE, ProbCache, and MPC with respect to cache hit rate, redundancy, content retrieval delay, memory utilization, and stretch ratio, which are regarded as extremely important metrics (in various studies) for the evaluation of ICN caching. The outcomes exhibited in this study are noteworthy in terms of making FlexPop acceptable to users as they can verify the performance of ICN before selecting the right caching strategy. Thus FlexPop has potential in the use of ICN for the future Internet such as in deployment of the IoT technology

    Reducing server and network load with shared buffering

    Full text link

    Collaborative cognitive content dissemination and query in heterogeneous mobile opportunistic networks

    Get PDF
    This paper investigates complex challenges of opportunistic discovery of content stored in remote mobile devices and delivery to the requesting nodes in heterogeneous mobile disconnection prone environments. We propose new latency aware collaborative cognitive caching approach suitable for content dissemination and query in heterogeneous opportunistic mobile networks and dynamic workloads. Utilising fully localised and ego networks multi-layer predictive heuristics about dynamically changing topology, dynamic resources and varying popularity content, our cognitive caching achieves high success ratio, low delays and high caching efficiency for very different real world dynamically changing mobile topologies

    Edge Cache-based ISP-CP Collaboration Scheme for Content Delivery Services

    Get PDF
    With the explosive increase of mobile data traffic, content delivery issue in the Internet is a growing concern for both Internet Service Providers (ISPs) and content providers (CPs). To improve content transmission efficiency and reduce network delay, many ISP-CP cooperation schemes are designed, parts of which are trying to introduce the idea of in-network caching. However, the combination influence of edge cache and content popularity is largely ignored in the existing solutions. Therefore, we propose a novel edge cache-based ISP-CP collaboration model for content delivery services, where the two important factors are simultaneously taken into account. Then, the model is analyzed to obtain the maximal network profit from the perspective of online and offline, respectively. Simulation results show that the profit gains of the proposed solution over the existing Internet models only considering cooperation between ISPs and CPs in the heterogeneous network environments

    Routing and Caching in Information-Centric Networking

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ (๋ฐ•์‚ฌ)-- ์„œ์šธ๋Œ€ํ•™๊ต ๋Œ€ํ•™์› : ์ „๊ธฐยท์ปดํ“จํ„ฐ๊ณตํ•™๋ถ€, 2015. 2. ๊ถŒํƒœ๊ฒฝ.When the Internet was designed decades ago, main applications are resource sharing such as remote login and file transfer. To support such applications, the key principle in the Internet architecture is point-to-point communications, and the key element is an IP address that identifies a host. Due to the flexible design of the Internet, a wide range of new applications and services have been introduced over the decades. The recent surge of Internet traffic is mainly attributed to applications such as web, P2P file sharing, and video streaming. In such applications, an end user is mostly interested in content itself, not in a particular host or its location. Over the past few years, there have been many efforts to address the above issues from a content centric perspective. Those proposals are collectively called Information Centric Networking (ICN), which is largely deemed as a clean-slate approach. Most of the ICN studies think of content as a key element and hence assume a new paradigm by shifting from host-oriented communications to content-oriented i communications. Consequently, instead of locator-based routing, most ICN proposals consider name-based routing, which decouples content production and consumption in time and space domains. The decoupling enhances content availability and naming persistency, and supports in-network caching, multicast and mobility. Most of ICN proposals use content names as routing entries, and thus the routing scalability is primary concern. ICN allows in-network caching as a built-in functionality. However, if network nodes make caching decisions individually, duplicate copies of the same content may exist among nearby nodes. To address these problems, this dissertation proposes a unified framework named Coordinated Routing and Caching (CoRC) that mitigates routing scalability and enhances the efficiency of the in-network storage.Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . i I. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 II. Design Principles . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.1 How to Make FIBs Scalable? . . . . . . . . . . . . . . . . . . . . . 4 2.2 Where to Place the Cached Item? . . . . . . . . . . . . . . . . . . . 5 2.3 How to Coordinate between Routing and Caching? . . . . . . . . . 5 2.4 How to Reflect the Current Internet Infrastructure and Business? . . 6 III. RelatedWork . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 IV. CoRC: Coordinated Routing and Caching . . . . . . . . . . . . . . 9 4.1 Name Resolution . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 4.2 Routing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 4.2.1 Intra-domain Routing . . . . . . . . . . . . . . . . . . . . . 11 4.2.2 Inter-domain Routing . . . . . . . . . . . . . . . . . . . . . 12 4.3 Caching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 V. Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 5.1 Assigning PID prefix to RR . . . . . . . . . . . . . . . . . . . . . . 15 5.2 Hybrid Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 VI. Routing Scalability . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 6.1 AS-FIB . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 6.2 PAR-FIB and PIB . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 6.3 Numbers of Entries of Three Tables . . . . . . . . . . . . . . . . . 22 VII. Network Performance . . . . . . . . . . . . . . . . . . . . . . . . . . 24 7.1 Performance Metrics . . . . . . . . . . . . . . . . . . . . . . . . . 24 7.2 Compared Schemes . . . . . . . . . . . . . . . . . . . . . . . . . . 25 7.3 Experimental Setting . . . . . . . . . . . . . . . . . . . . . . . . . 26 7.4 Average Cache Hit Ratio . . . . . . . . . . . . . . . . . . . . . . . 27 7.5 Content Delivery Latency . . . . . . . . . . . . . . . . . . . . . . . 29 7.6 Traffic Load . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 7.7 Route Stretch vs. Topology . . . . . . . . . . . . . . . . . . . . . . 36 VIII.Packet Processing Time in a Router . . . . . . . . . . . . . . . . . . 38 8.1 Methodology . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 8.2 Drop Rate vs. Interest Packet Rate . . . . . . . . . . . . . . . . . . 39 IX. Discussions and Future Work . . . . . . . . . . . . . . . . . . . . . . 41 9.1 Hashing by Publisher Name . . . . . . . . . . . . . . . . . . . . . 41 9.2 Dealing with Router Failure . . . . . . . . . . . . . . . . . . . . . 42 9.3 Resolution System and Multihoming . . . . . . . . . . . . . . . . . 42 X. Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43 Bibliography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44Docto

    A Study of Very Short Intermittent DDoS Attacks on the Performance of Web Services in Clouds

    Get PDF
    Distributed Denial-of-Service (DDoS) attacks for web applications such as e-commerce are increasing in size, scale, and frequency. The emerging elastic cloud computing cannot defend against ever-evolving new types of DDoS attacks, since they exploit various newly discovered network or system vulnerabilities even in the cloud platform, bypassing not only the state-of-the-art defense mechanisms but also the elasticity mechanisms of cloud computing. In this dissertation, we focus on a new type of low-volume DDoS attack, Very Short Intermittent DDoS Attacks, which can hurt the performance of web applications deployed in the cloud via transiently saturating the critical bottleneck resource of the target systems by means of external attack HTTP requests outside the cloud or internal resource contention inside the cloud. We have explored external attacks by modeling the n-tier web applications with queuing network theory and implementing the attacking framework based-on feedback control theory. We have explored internal attacks by investigating and exploiting resource contention and performance interference to locate a target VM (virtual machine) and degrade its performance
    • โ€ฆ
    corecore