Edge Routers Research Articles

Caching on Named Data Network: a Survey and Future Research

The IP-based system cause inefficient content delivery process. This inefficiency was attempted to be solved with the Content Distribution Network. A replica server is located in a particular location, usually on the edge router that is closest to the user. The user’s request will be served from that replica server. However, caching on Content Distribution Network is inflexible. This system is difficult to support mobility and conditions of dynamic content demand from consumers. We need to shift the paradigm to content-centric. In Named Data Network, data can be placed on the content store on routersthat are closest to the consumer. Caching on Named Data Network must be able to store content dynamically. It should be selectively select content that is eligible to be stored or deleted from the content storage based on certain considerations, e.g. the popularity of content in the local area. This survey paper explains the development of caching techniques on Named Data Network that are classified into main points. The brief explanation of advantages and disadvantages are presented to make it easy to understand. Finally, proposed the open challenge related to the caching mechanism to improve NDN performance.

Local Stability and Hopf Bifurcation Analysis for Compound TCP

We conduct a local stability and Hopf bifurcation analysis for Compound transmission control protocol (TCP), with small Drop-Tail buffers, in three topologies. The first topology consists of two sets of TCP flows having different round-trip times and feeding into a core router. The second topology consists of two distinct sets of TCP flows, regulated by a single-edge router and feeding into a core router. The third topology comprises two distinct sets of TCP flows, regulated by two separate edge routers and feeding into a core router. In each case, we conduct a local stability analysis and obtain conditions on the network and protocol parameters to ensure stability. If these conditions get marginally violated, we show that the underlying systems lose local stability via a Hopf bifurcation. After exhibiting a Hopf, a key concern is to determine the asymptotic orbital stability of the bifurcating limit cycles. We then present a detailed analytical framework to address the stability of the limit cycles and the type of the Hopf bifurcation by invoking Poincare normal forms and the center manifold theory. We finally conduct packet-level simulations to corroborate our analytical insights.

CENSOR: Cloud‐enabled secure IoT architecture over SDN paradigm

SummaryThe cyber‐security threats to low‐cost end‐user devices could severely undermine the expected deployment of Internet of Thing (IoT) solutions in a range of real‐world applications such as environment monitoring, transportation, and manufacturing. Additionally, the huge amount of data generated by these devices posses new challenges concerning tasks such as efficient information acquisition and analysis, decision making, and action implementation. In this paper, we propose CENSOR, a novel cloud‐enabled secure IoT network architecture based on SDN paradigm. We discuss the significant benefits as well as challenges that are inherent while performing integration of SDN and IoT in CENSOR. We show that the emerging software‐based networking features combined with the cloud computing solutions can significantly improve the security and communication reliability in the target IoT scenarios. In particular, to provide the adequate security measures in the network, CENSOR uses a lightweight and scalable software remote attestation scheme, which ensures the integrity of the software that is being executed by the IoT devices to achieve the application specific goals in the network. We further discuss the improvements in data communication and data overhead that can be achieved in CENSOR due to its convergence with the cloud computing (at back‐end) and fog computing services (at edge routers or front‐end). A Smart City use‐case has been considered as a target IoT scenario to analyze the feasibility and effectiveness of CENSOR concerning the communication security and the network scalability parameters. Additionally, we provide future research directions along with the recent industry initiatives that include open issues in the integration and deployment of cloud‐enabled SDN‐based IoT networks.

The chips generated during up-milling and down-milling of pine wood by helical router bits

Machining aspects with helical edge router bits (helix angle 15°, 30°, 45°, and 60°) with a cutting circle diameter of 8 mm were studied. The purpose of the research work was to investigate chip formation and surface roughness characteristics in milling pine wood by the straight and helical edge bits. The chips generated could be classified into four types by sieving into spiral chip (5 mesh), flow chip (10 mesh), thin chip (30 mesh), and granule chip (< 30 mesh). The experimental results show that spiral chips were generated most often (on a weight percentage basis) by the bits during down-milling process. More flow and thin chips were produced by the bits during up-milling process. Better surface roughness was produced by bits during down-milling compared to up-milling. With increasing helix angle of the bits, the amount of spiral and flow chips increased and granule chips were reduced. The machined surface produced was better in roughness (lower Ra values) as the helix angle of the bits increased both in up-milling and down-milling processes.

MoHoP: A protocol providing for both mobility management and host privacy

The types and numbers of moving objects connected to the Internet are rapidly increasing. Thus, a number of methods have been proposed to provide mobility to moving objects and to ensure host privacy. However, when both methods are applied at the same time without considering their interoperation, either host privacy cannot be provided or packets are delivered to an incorrect location. In this paper, we propose a protocol termed MoHoP which provides both mobility management and host privacy simultaneously. MoHoP obtains the identifier of a mobile node by decoding an anonymized identifier included in a packet. Using the obtained identifier in a distributed hash table, it finds an edge router to which a mobile node is connected, and delivers the packet. We implemented MoHoP in a testbed and proved that it supports mobility. Moreover, the identifier of a mobile node is not exposed in a packet header during the packet transmission process. Our experiment also demonstrated that MoHoP offers low protocol overhead and low handover delay.

Testbed evaluation of Lightweight Authentication Protocol (LAUP) for 6LoWPAN wireless sensor networks

Summary6LoWPAN networks involving wireless sensors consist of resource starving miniature sensor nodes. Since secured authentication is one of the important considerations, the use of asymmetric key distribution scheme may not be a perfect choice. Recent research shows that Lucky Thirteen attack has compromised Datagram Transport Layer Security (DTLS) with Cipher Block Chaining (CBC) mode for key establishment. Even though EAKES6Lo and S3 K techniques for key establishment follow the symmetric key establishment method, they strongly rely on a remote server and trust anchor. Our proposed Lightweight Authentication Protocol (LAUP) used a symmetric key method with no preshared keys and comprised of four flights to establish authentication and session key distribution between sensors and Edge Router in a 6LoWPAN environment. Each flight uses freshly derived keys from existing information such as PAN ID (Personal Area Network IDentification) and device identities. We formally verified our scheme using the Scyther security protocol verification tool. We simulated and evaluated the proposed LAUP protocol using COOJA simulator and achieved less computational time and low power consumption compared to existing authentication protocols such as the EAKES6Lo and SAKES. LAUP is evaluated using real‐time testbed and achieved less computational time, which is supportive of our simulated results.

Energy Efficiency Maximization for Downlink Cloud Radio Access Networks With Data Sharing and Data Compression

This paper aims to maximize the energy efficiency of a downlink cloud radio access network (C-RAN). Here, data is transferred from a baseband unit in the core network to several remote radio heads via a set of edge routers over capacity-limited fronthaul links. The remote radio heads then send the received signals to their users via radio access links. Both data sharing and compression-based strategies are considered for fronthaul data transfer. New mixed-integer nonlinear problems are formulated, in which the ratio of network throughput and total power consumption is maximized. These challenging problem formulations include practical constraints on routing, predefined minimum data rates, fronthaul capacity, and maximum remote radio head transmit power. By employing the successive convex quadratic programming, iterative algorithms are proposed with guaranteed convergence to the Fritz John solutions of the formulated problems. Significantly, each iteration of the proposed algorithms solves only one simple convex program. Numerical examples with practical parameters confirm that the proposed joint optimization designs markedly improve the C-RAN’s energy efficiency compared to benchmark schemes. They also show that the fronthaul data-sharing strategy outperforms its compression-based counterpart in terms of energy efficiency, in both single-hop and multi-hop network scenarios.

Threshold-based distributed DDoS attack detection in ISP networks

The purpose of this paper is to propose a more efficient and accurate distributed denial of service (DDoS) attack detection mechanism that detects DDoS attacks by monitoring the incoming traffic on the edge routers of ISP networks. It can be implemented as a module or agent function on the machine that is responsible for processing router traffic. The detection algorithm works by monitoring the traffic passing through the edge routers and identifying the occurrence of DDoS attacks or flash events. The algorithm calculates different values like the normalized router entropy, packet rate, and entropy rate and compares them against the preidentified threshold values to detect the happening of a DDoS attack or flash event. The threshold values used in the algorithm are evaluated offline by taking the sample attack and the legitimate traffic flows. The proposed detection mechanism can be implemented on the edge routers of the ISP networks. ISPs are selected for the deployment of attack detection because the customer networks are directly connected with them. The effectiveness of the algorithms can be validated mathematically using a sample test bed containing realistic internet topology. The results clearly indicate that the proposed detection mechanism does effective detection with a high detection rate and fewer false positives.

Per-Flow Throughput Fairness in Ring Aggregation Network with Multiple Edge Routers

Ring aggregation networks are often employed by network carriers because of their efficiency and high fault tolerance. A fairness scheme is required in ring aggregation to achieve per-flow throughput fairness and bufferbloat avoidance, because frames are forwarded along multiple ring nodes. N Rate N + 1 Color Marking (NRN + 1CM) was proposed to achieve fairness in ring aggregation networks consisting of Layer-2 Switches (SWs). With NRN + 1CM, frames are selectively discarded based on color and the frame-dropping threshold. To avoid the accumulation of a queuing delay, frames are discarded at upstream nodes in advance through the notification process for the frame-dropping threshold. However, in the previous works, NRN + 1CM was assumed to be employed in a logical daisy chain topology linked to one Edge Router (ER). The currently available threshold notification process of NRN + 1CM cannot be employed for ring networks with multiple ERs. Therefore, this paper proposes a method for applying NRN + 1CM to a ring aggregation network with multiple ERs. With the proposed algorithm, an SW dynamically selects the dropping threshold to send in order to avoid excess frame discarding. The performance of the proposed scheme was confirmed through computer simulations.

Preventing “bad” content dispersal in named data networking

Named Data Networking (NDN) improves the data delivery efficiency by caching contents in routers. To prevent corrupted and faked contents be spread in the network, NDN routers should verify the digital signature of each published content. Since the verification scheme in NDN applies the asymmetric encryption algorithm to sign contents, the content verification overhead is too high to satisfy wire-speed packet forwarding. In this paper, we propose two schemes to improve the verification performance of NDN routers to prevent content poisoning. The first content verification scheme, called “user-assisted”, leads to the best performance, but can be bypassed if the clients and the content producer collude. A second scheme, named “Router-Cooperation”, prevents the aforementioned collusion attack by making edge routers verify the contents independently without the assistance of users and the core routers no longer verify the contents. The Router-Cooperation verification scheme reduces the computing complexity of cryptographic operation by replacing the asymmetric encryption algorithm with symmetric encryption algorithm. The simulation results demonstrate that this Router-Cooperation scheme can speed up 18.85 times of the original content verification scheme with merely extra 80 Bytes transmission overhead.

Intelligent Packet Delivery in Router Using Structure Optimized Neural Network

The Internet itself is a worldwide network connecting millions of computers and less significant networks. Computers communicated by routers. Crucial the role of a router is to our technique of communicating and computing. Routers are situated at gateways, the spaces where two or more networks connect, and are the decisive device that keeps data flow between networks and keeps the networks connected to the Internet. When data is sent between places on one network or from one network to a second network the data is always seen and intended for to the proper place by the router. The router carries out this by using headers and routing tables to establish the best path for routing the data packets. This trim down the effectiveness of edge router only when the path engaged, it will enhanced by classification method, predictable classification methods like port based ,deep packet inspection and statistical classification are give less precision. In this system structured optimized neural network is used for more precise organization. Classification output forwarded to router dynamically for intellectual packet delivery. The method will improve router competence by greater than before throughput and decreased latency.&lt;span style="font-size: 9.0pt; line-height: 115%; font-family: 'Times New Roman','serif'; mso-fareast-font-family: 'Times New Roman'; letter-spacing: .05pt; mso-ansi-language: EN-IN; mso-fareast-language: EN-US; mso-bidi-language: AR-SA; mso-bidi-font-weight: bold; mso-bidi-font-style: italic;" lang="EN-IN"&gt;The Internet itself is a worldwide &lt;a href="https://www.webopedia.com/TERM/I/network.htm"&gt;&lt;span style="color: windowtext; text-decoration-line: none;"&gt;network&lt;/span&gt;&lt;/a&gt; connecting millions of &lt;a href="https://www.webopedia.com/TERM/I/computer.htm"&gt;&lt;span style="color: windowtext; text-decoration-line: none;"&gt;computers&lt;/span&gt;&lt;/a&gt; and less significant networks. Computers communicated by routers. Crucial the role of a router is to our technique of communicating and computing. Routers are situated at &lt;a href="https://www.webopedia.com/TERM/G/gateway.html"&gt;&lt;span style="color: windowtext; text-decoration-line: none;"&gt;gateways&lt;/span&gt;&lt;/a&gt;, the spaces where two or more networks connect, and are the decisive device that keeps data flow between networks and keeps the networks connected to the Internet. When data is sent between places on one network or from one network to a second network the data is always seen and intended for to the proper place by the router. The router carries out this by using &lt;a href="https://www.webopedia.com/TERM/R/header.htm"&gt;&lt;span style="color: windowtext; text-decoration-line: none;"&gt;headers&lt;/span&gt;&lt;/a&gt; and routing tables to establish the best path for routing the data packets. This trim down the effectiveness of edge router only when the path engaged, it will enhanced by classification method, predictable classification methods like port based ,deep packet inspection and statistical classification are give less precision. In this system structured optimized neural network is used for more precise organization. Classification output forwarded to router dynamically for intellectual packet delivery. The method will improve router competence by greater than before throughput and decreased latency.&lt;/span&gt;

PERFORMANCE ANALYSIS OF AGENT BASED DISTRIBUTED DEFENSE MECHANISMS AGAINST DDOS ATTACKS

The current internet infrastructure is susceptible to distributed denial of service (DDoS) attacks and has no built in mechanism to defend against them. The research on these kinds of attacks and their defense is significant for the security and reliability of the internet. We have already proposed a collaborative agent based distributed DDoS defense scheme which detect and prevents against DDoS attacks in ISP (Internet Service Provider) boundaries. The actual task of defense is carried out by agents and coordinators in each ISP. The defense system works by inspecting incoming traffic on edge router and identify the happening of DDoS attacks. The agent’s implements an entropy-threshold based detection algorithm. The coordinators share attack related information with neighboring ISPs in order to achieve distributed defense. The performance of defense system is evaluated on the basis of some identified metrics. The effectiveness of the defense system is evaluated in the presence and absence of defense system. The result indicates that the proposed defense system does accurate attack detection with very few false positives and false negatives.

Bayesian-Based Virtual Network Reconfiguration for Dynamic Optical Networks

Network virtualization is a key technology for accommodating varying traffic demands on optical networks. Network operators construct a virtual network (VN) by slicing physical resources, and resolve traffic congestion by reconfiguring the VN in response to traffic changes. A typical approach is to configure an optimal VN using the traffic demand matrix. However, since it is difficult for this approach to reconfigure the VN following traffic changes, other methods must be explored. Previously we developed a method that observes only the service quality on the VN, i.e., link-level load information on the VN, and searches for a suitable VN by repeatedly making random changes to the current one. However, in practice this noise-induced method repeatedly reconfigures the VN, which leads to over-reconfiguration. In this paper, we propose a VN reconfiguration framework based on the Bayesian Attractor Model, which models the human behavior of making appropriate decisions by recognizing the surrounding situation. Our framework memorizes a set of VN candidates, each of which works well for a specific traffic situation, then retrieves a suitable VN candidate for the current traffic situation from this set. We use certain patterns of incoming and outgoing traffic at edge routers to characterize the traffic situation, as this information can be obtained more easily than the traffic demand matrix. By identifying the stored traffic situation that is closest to the current one and retrieving a suitable VN, our framework can reduce the over-reconfiguration. Evaluation of our method shows that it can identify the traffic situation by observing the amounts of incoming and outgoing traffic at edge routers; as a result it can decrease the number of VN reconfigurations needed to reach a VN suitable for the current traffic situation when compared to the noise-induced method.

Security Integration in DDoS Attack Mitigation Using Access Control Lists

In this article, the authors propose a DDoS mitigation system through access list-based configurations, which are deployed at the ISP (Internet Service Provider's) edge routers to prohibit DDoS attacks over ISPs' networks traffic. The effectiveness of the proposed system relies heavily on the willingness of ISPs in implementing the system. Once each ISP implements the system, most attacks can easily be stopped close to their point of origin. The main challenge is to implement such a system with the fixed amount of memory and available processing power with routers. A coordinated effort by participating ISPs filters out attacks close to their source, reducing the load on other routers. The suspicious traffic is first filtered out based on their source IP address. The authors also implemented the WRED algorithm for their case and conduct GNS3 experiments in a simulated environment.

Post-cloud computing paradigms: a survey and comparison

With the rapid development of pervasive intelligent devices and ubiquitous network technologies, new network applications are emerging, such as the Internet of Things, smart cities, smart grids, virtual/augmented reality, and unmanned vehicles. Cloud computing, which is characterized by centralized computation and storage, is having difficulty meeting the needs of these developing technologies and applications. In recent years, a variety of network computing paradigms, such as fog computing, mobile edge computing, and dew computing, have been proposed by the industrial and academic communities. Although they employ different terminologies, their basic concept is to extend cloud computing and move the computing infrastructure from remote data centers to edge routers, base stations, and local servers located closer to users, thereby overcoming the bottlenecks experienced by cloud computing and providing better performance and user experience. In this paper, we systematically summarize and analyze the post-cloud computing paradigms that have been proposed in recent years. First, we summarize the main bottlenecks of technology and application that cloud computing encounters. Next, we analyze and summarize several post-cloud computing paradigms, including fog computing, mobile edge computing, and dew computing. Then, we discuss the development opportunities of post-cloud computing via several examples. Finally, we note the future development prospects of post-cloud computing.

A Game-Theoretic Analysis of Energy Efficiency and Performance for Cloud Computing in Communication Networks

Continuing growth in cloud-based services and global Internet protocol traffic necessitates performance improvements in energy consumption, network delay, and service availability. Data centers providing cloud services and transport networks have often multiple stakeholders, which makes it difficult to implement centralized traffic management. This paper adopts a game-theoretic approach to data traffic management to obtain a distributed and energy-efficient solution, where each edge router is acting as a strategic player. A multiobjective optimization problem with a priori user-specific preferences is formulated for each player, and a distributed iterative algorithm is proposed to solve the game. The existence of Nash equilibrium of the proposed game is shown, followed by the theoretical convergence analysis of the iterative algorithm. The efficiency loss between the strategic game and the corresponding global optimization method is analyzed to quantify the impact of selfish behavior on the overall system performance. Simulation results show notable challenges for operators to plan, design, and operate a multimedia content network to optimize energy consumption, network delay, and load balance over a diurnal cycle.

Clarifying Fog Computing and Networking: 10 Questions and Answers

Fog computing is an end-to-end horizontal architecture that distributes computing, storage, control, and networking functions closer to users along the cloud-to-thing continuum. The word “edge” may carry different meanings. A common usage of the term refers to the edge network as opposed to the core network, with equipment such as edge routers, base stations, and home gateways. In that sense, there are several differences between fog and edge. First, fog is inclusive of cloud, core, metro, edge, clients, and things. The fog architecture will further enable pooling, orchestrating, managing, and securing the resources and functions distributed in the cloud, anywhere along the cloud-to-thing continuum, and on the things to support end-to-end services and applications. Second, fog seeks to realize a seamless continuum of computing services from the cloud to the things rather than treating the network edges as isolated computing platforms. Third, fog envisions a horizontal platform that will support the common fog computing functions for multiple industries and application domains, including but not limited to traditional telco services. Fourth, a dominant part of edge is mobile edge, whereas the fog computing architecture will be flexible enough to work over wireline as well as wireless networks.

Design and analysis of optimization algorithms to minimize cryptographic processing in BGP security protocols

The Internet is subject to attacks due to vulnerabilities in its routing protocols. One proposed approach to attain greater security is to cryptographically protect network reachability announcements exchanged between Border Gateway Protocol (BGP) routers. This study proposes and evaluates the performance and efficiency of various optimization algorithms for validation of digitally signed BGP updates. In particular, this investigation focuses on the BGPSEC (BGP with SECurity extensions) protocol, currently under consideration for standardization in the Internet Engineering Task Force. We analyze three basic BGPSEC update processing algorithms: Unoptimized, Cache Common Segments (CCS) optimization, and Best Path Only (BPO) optimization. We further propose and study cache management schemes to be used in conjunction with the CCS and BPO algorithms. The performance metrics used in the analyses are: (1) routing table convergence time after BGPSEC peering reset or router reboot events and (2) peak-second signature verification workload. Both analytical modeling and detailed trace-driven simulation were performed. Results show that the BPO algorithm is 330% to 628% faster than the unoptimized algorithm for routing table convergence in a typical Internet core-facing provider edge router.

Cisco Systems: Launching the ASR 1000 Series Router Using Social Media Marketing

This case focuses on Cisco Systems' innovative probe-and-learn approach to using social media to launch its ASR 1000 Series Edge Router. The company had decided to eschew traditional print and TV media in marketing the new product and had decided instead to focus its efforts entirely on digital marketing and social media to attract the attention of its target market. The case discusses Cisco's bold plan to launch the ASR 1000 Series “virtually, visually, and virally” and the digital tactics employed by the Cisco Systems marketing team to accomplish this ambitious goal. Business marketers normally adopt a more serious and traditional approach to marketing its products but in this case Cisco had decided to buck that trend by exploring digital tools and social gaming avenues which its target client—the technical community—were increasingly frequenting. Cisco's challenge lay in whether this new approach and resultant value proposition would resonate with its technical audience and give the ASR 1000 Router the kind of publicity it needed to have. The case is set at a time when social media was burgeoning as a promising way to engage consumers more deeply with brands and products, but marketers were still experimenting with the tools and tactics of social media for marketing.Understand the relevance of social media for product launches as a function of contextual factors such as nature of product, media habits, and company credibility. Learn about the applicability of social media for business marketers in terms of its uniqueness, advantages and challenges. Recognize the relationship between campaign objectives and the value proposition for the product. Understand the evolution of social media marketing from a probe-and-learn approach to a strategy-driven process. The initial test and learn approach must be enhanced and become more strategic in the future.

Enhancement to performance of MPLS network through hierarchical MPLS

Multiprotocol label switching (MPLS) network is used to remove the overhead of routing table lookup at each router. Within the MPLS network, the routing table lookup is done at the edge routers which match the routing table values with the label table values and attach a label for the MPLS network. But, on comparative analysis, it is being found out that for the smaller and larger networks the time taken in MPLS network becomes more. In this paper, we propose a hierarchical MPLS network algorithm to reduce the time taken by the packets to reach from source to destination in a large MPLS network. It also deals with the small MPLS network and suggests solution for the same.