IP Networks Research Articles

Balancing latency and cost in software-defined vehicular networks using genetic algorithm

Software-defined vehicular network (SDVN) effectively improves programmability and flexibility of VANET through software-defined network (SDN) features. To address the latency problem, the previous work considered that vehicles access the IP network through either cellular links or ad hoc links of vehicular networks in an SDVN, in which the SDN controller can rebate the bandwidth of cellular links allocated to vehicles to reduce latency, but the cost of renting the rebated bandwidth is paid by the network provider. Then, it proposed a two-stage game to optimize the rebating strategy to balance the latency requirement and the cost. However, optimization of each of the two stages may influence optimization of the other stage. As a consequence, this work proposes an improved genetic algorithm (IGA) to optimize the rebating stage in a single stage, which includes a dynamic mutation adjustment scheme to ensure solution diversity, and keeps the best chromosome so far to avoid solution damage owing to the dynamic mutation. Through simulation, the number of packets transmitted through cellular lines is positively correlated with the rebate ratio and the other parameters. In addition, the proposed IGA can significantly improve performance of searching solutions, and obtain better results than the previous work.

PPUSTMAN: Privacy-Aware PUblish/Subscribe IoT MVC Architecture Using Information Centric Networking

IoT applications have been evolved in relation to every aspect of human life. The design of the applications adds new challenges such as mobility, scalability, and privacy to the current networking architecture design. For that reason, it is mandatory to investigate new solutions and paradigms such as Information Centric Network (ICN). ICN handles many of the challenges barely handled by current IP networks such as mobility and scalability, by using in-network caching and content retrieving based on contents names instead of host addresses. This paper presents a privacy-aware ICN architecture for IoT environments based on the Model-View-Controller (MVC) publish/Subscribe communication approach. This architecture focuses on supporting mobility, scalability, and privacy. A communication and processing cost comparison between Publish/Subscribe N-Tier and Publish/Subscribe MVC architectures, shows that the later outperforms N-Tier in communication, processing cost, and parallelism capabilities. Reasoning and planning for publishing actuation commands scenarios is performed using Situation Calculus which is used to formalize the communications in causality and temporal framework.

PPUSTMAN: Privacy-Aware PUblish/Subscribe IoT MVC Architecture Using Information Centric Networking

IoT applications have been evolved in relation to every aspect of human life. The design of the applications adds new challenges such as mobility, scalability, and privacy to the current networking architecture design. For that reason, it is mandatory to investigate new solutions and paradigms such as Information Centric Network (ICN). ICN handles many of the challenges barely handled by current IP networks such as mobility and scalability, by using in-network caching and content retrieving based on contents names instead of host addresses. This paper presents a privacy-aware ICN architecture for IoT environments based on the Model-View-Controller (MVC) publish/Subscribe communication approach. This architecture focuses on supporting mobility, scalability, and privacy. A communication and processing cost comparison between Publish/Subscribe N-Tier and Publish/Subscribe MVC architectures, shows that the later outperforms N-Tier in communication, processing cost, and parallelism capabilities. Reasoning and planning for publishing actuation commands scenarios is performed using Situation Calculus which is used to formalize the communications in causality and temporal framework.

Optimized topology control in mobile IP networks using a new parametric routing algorithm

When some intermediate nodes fail or are suddenly removed in a mobile IP network, a node failure can disconnect paths and decrease network efficiency due to loss of some packets. In this case, the movement of the remaining nodes must be controlled such that to prevent further network efficiency drop. In the present research, we will study the intermediate node failure and changing foreign networks in mobile IP networks when the Mobile Node (MN) moves. Then, a new optimal routing algorithm is proposed to make up the node failure and changing Foreign Agent (FA). For this purpose, an Optimal Parametric Topology Control Routing (OPTCR) algorithm is introduced based on parametric linear programming formulation (LPF). Since OPTCR can handle the handover latency, it is supposed that both destination and intermediate nodes can move but just intermediate nodes may fail. Simulation results show that OPTCR algorithm is superior to some algorithms appeared in the recent literature.

A comparative study of name resolution and routing mechanisms in information-centric networks

Information-Centric Networking (ICN) is an innovative paradigm for the future internet architecture, which addresses IP network limitations in supporting content distribution and information access by decoupling content from hosts and providing the ability to retrieve a content object by its name (identifier), rather than its storage location (IP address). Name resolution and routing is critical for content retrieval in ICN networks. In this research, we perform a comparative study of two widely used classes of ICN name resolution and routing schemes, namely flooding and Distributed Hash Table (DHT). We consider the flooding-based routing in Content-Centric Networks due to its wide acceptance. For the DHT scheme, we design a multi-level DHT that takes into account the underlying network topology and uses name aggregation to further reduce control overhead and improve network efficiency. Then, we compare the characteristics and performance of these two classes of name resolution and routing through extensive simulations. The evaluation results show that the performances of these two approaches are reliant on several factors, including network size, content location dynamics, and content popularity. Our study reveals insights into the design tradeoffs and offers guidelines for design strategies.

Vulnerability Analysis of Network Scanning on SCADA Systems

Supervisory Control and Data Acquisition (SCADA) systems and Industrial Control Systems (ICSs) have controlled the regulation and management of Critical National Infrastructure environments for decades. With the demand for remote facilities to be controlled and monitored, industries have continued to adopt Internet technology into their ICS and SCADA systems so that their enterprise can span across international borders in order to meet the demand of modern living. Although this is a necessity, it could prove to be potentially dangerous. The devices that make up ICS and SCADA systems have bespoke purposes and are often inherently vulnerable and difficult to merge with newer technologies. The focus of this article is to explore, test, and critically analyse the use of network scanning tools against bespoke SCADA equipment in order to identify the issues with conducting asset discovery or service detection on SCADA systems with the same tools used on conventional IP networks. The observations and results of the experiments conducted are helpful in evaluating their feasibility and whether they have a negative impact on how they operate. This in turn helps deduce whether network scanners open a new set of vulnerabilities unique to SCADA systems.

Study of optimization parameters for service chaining in cloud environment

and it is growing towards integration of 5G technology in near future. Therefore, to improve the quality of experience for viewing the content over the internet requires dynamic allocation and adaptation of network resources in an optimized manner. Traditional IP networks are vertically integrated hence flexibility in network resources management is very less. Software-defined networking (SDN) as an emerging technology, which comes with the promise of the solution to dynamically govern various network resources by breaking this chain or hierarchy of vertical integration. Network function virtualization along with service chain optimization provides the solution to enhance the Quality of Experience (QoE) and Quality of Service (QoS). In this paper, we are proposing an approach to improve the QoE by ameliorating the service chain and data center parameters.

Packet-Level Link Capacity Evaluation for IP Networks

Abstract In recent times, with many applications, the IP networks have become the most powerful tool for sharing information. Best-effort IP interconnected networks deliver data according to the available resources, without any assurance of throughput, delay bounds, or reliability requirements. As a result, their performance is highly variable and cannot be guaranteed. In IP networks, ensuring proper link capacity at the packet level is a challenging problem. In this article, a method to evaluate the link capacity of IP networks at the packet level based on a single server delay system with state-dependent arrival and departure processes is suggested. The dependence of the traffic being carried on the queue length and on the defined waiting time is shown. Presented graphic dependencies allow for defined quality of service, namely the probability of packet loss and admissible delays, to determine the carried traffic of the links.

Traffic Engineering Enhancement by Progressive Migration to SDN

Software-defined networking (SDN) provides an unprecedented opportunity to enhance the traffic engineering in IP networks. This emerges from the fine-grained centralized control over routing, which enables an immediate response to network dynamics. However, due to the high operational and performance costs of the migration, network operators prefer a multi-period planning approach for the deployment of SDN-enabled devices. In this letter, we present and evaluate an efficient algorithm to seek a beneficial upgrade policy for a network considering the budget constraints. Our proposed algorithm outperforms the most recent work, particularly for large-scale topologies and an increased number of time periods.

Data Management, Technology, and Public Policy: The Implementation of Next Generation 911 and Its Connection to Nationwide Public Safety Broadband Network at Public Safety Answering Points

Abstract Enhanced 911 call systems face the transition to Next Generation 911 (NG911) driven by the ubiquity of smart phones and other digital technologies. NG911 services include data management and databases to gather, process and store NG911 call and location data. Federal NG911 policies to implement and fund NG911 and consolidate PSAPs are insufficient to timely further NG911 services and fully integrate NG911 with the Nationwide Public Safety Broadband Network (NPSBN). Public Safety Answering Points (PSAPs) need NG911 emergency service IP networks (ESInets) to receive 911 emergency calls and NPSBN to deliver these calls and data to first responders.

Data Management, Technology, and Public Policy: The Implementation of Next Generation 911 and Its Connection to Nationwide Public Safety Broadband Network at Public Safety Answering Points

Abstract Enhanced 911 call systems face the transition to Next Generation 911 (NG911) driven by the ubiquity of smart phones and other digital technologies. NG911 services include data management and databases to gather, process and store NG911 call and location data. Federal NG911 policies to implement and fund NG911 and consolidate PSAPs are insufficient to timely further NG911 services and fully integrate NG911 with the Nationwide Public Safety Broadband Network (NPSBN). Public Safety Answering Points (PSAPs) need NG911 emergency service IP networks (ESInets) to receive 911 emergency calls and NPSBN to deliver these calls and data to first responders.

Novel Active Queue Management Scheme for Routers in Wireless Networks

Congestion stability and prevention is the main aim of any decent network traffic management scheme. The protocol that drives congestion control in IP networks, called The Transmission Control Protocol (TCP), is plagued by bandwidth underutilization when implemented on wireless networks. The management of network trunk queue size is the goal of this paper, along with its antecedent delay issues with Active Queue Management (AQM) algorithms that overcomes the bandwidth underutilization issue faced by TCP flows in wireless networks. Two adaptive TCP models, specifically built for wireless networks, were created. This made it possible to implement feedback control techniques in the chosen AQM design for queue management. The two AQM policies were created with the help of Model Predictive Control (MPC) and Self-Tuning Control (STC). A very thorough comparison was made between the developed AQM schemes and two Early Detection Controllers, namely, Random Early Detection (RED) and Fixed-Parameter Proportional Integral (PI). Under varying wireless network conditions, the results obtained from simulating the proposed queue management scheme in MATLAB® confirmed that the fixed PI and RED controllers were, by comparison, inferior in performance. Copyright © 2018 Praise Worthy Prize S.r.l. - All rights reserved.

Restoration of IP Networks by Using a Hybrid Interacting Mechanism Between Layer 2 & 3 in the Networks Over OA&M

The Internet generation infrastructure is growing and moving towards a consistency model of high-speed nodes interconnected by optical core networks. Therefore, the interaction between IP and optical network layers, specifically, the routing and signalling aspects, are maturing and they can lead to enhance the services and network performance. At the same time, a consensus has emerged in the industry on utilizing IP-based protocols for the optical control plane. This paper defines a new technique for IP over Optical networks (interacting between bottom layers), considering both the IP-based control plane for optical networks as well as IP-optical network interactions (together referred to as “IP over optical networks”). In this paper, a new technique is proposed that reduces recovery time by making an interoperation between the data link layer (layer 2) with the network layer (layer 3). The proposed technique enables layer 2 with layer 3 to make a hybrid mechanism that improves the recovery time in the network through two cases (1st-Detection and 2nd-Rerouting). The technique involves detecting failure in less time through layer 2 and rerouting traffic through an alternative path between source and destination by using a new algorithm in layer 3 to deliver data packets without the need to wait for the routing protocol to update the network topology and compute the routing table. In case of the network recovery, layer 2 has demonstrated its capability to detect failure extremely quickly shown through the immediate detection of the loss of signals for the link or node. The recovery mechanism, i.e., the rerouting mechanism, which leads the node, switches the data packets through an adjacent node to its destination via the life node. The latter is created by the proposed mechanism before the occurrence of the failure. The aim of this mechanism is to avoid loss of packets, improve QoS and improve recovery time as we have shown in the results shown below.

A smart ACO‐inspired named data networking forwarding scheme with clustering analysis

AbstractDifferent from the traditional IP network, named data networking (NDN) performs the stateful and adaptive forwarding, which faces some severe challenges such as efficient and self‐organized content retrieval. The current proposals are very difficult to address such challenges; therefore, this paper proposes a novel and smart NDN forwarding scheme by introducing both ant colony optimization and clustering analysis. At first, the discrete content concentration model is established with network load to address interest forwarding; in particular, we investigate the situation where the content retrieval is failed. Then, dot product method is used to compute similarity relation between 2 routers, which is considered as the clustering reference attribute. In addition, density‐based spatial clustering, ie, a clustering method, is exploited to detect core nodes that are used to cache the contents during the process of data forwarding. Finally, the proposed smart forwarding scheme is simulated over Mini‐NDN, and the simulation results show that it has better performance than the existent 3 schemes in terms of content retrieval rate, hop count, load balance degree, execution time, and throughput.

Playout Continuity Driven Framework for HTTP Adaptive Streaming Over LTE Networks

HyperText Transfer Protocol (HTTP) adaptive streaming (HAS) has undoubtedly become the most cost-effective solution in delivering video contents over the IP networks. While many works have been proposed to improve the performance of HAS, the HAS in the cellular networks is still a challenging problem due to the limited radio resource and the dramatically increasing need for the mobile video service. Specifically, the main problem comes from the incongruous behaviors between rate adaptation and resource allocation. The centralized scheme is a good choice to solve this problem, which determines rate adaptation of all the clients at the base station. However, the existing schemes still have three main weaknesses: 1) poor performance in playout continuity; 2) synchrony in requesting; and 3) low efficiency of radio resource. In this paper, a playout continuity driven framework (PCDF) is proposed to tackle all these drawbacks. First of all, an optimization problem is formulated to optimize the multiclient HAS over long-term evolution network. Then, a PCDF is proposed to solve the problem, which consists of three main features. First, a requesting set is defined to make clients request in a partially synchronous manner, which can not only eliminate the drawback of synchrony but also take advantage of the centralized manner. Second, we propose a two-step resource allocation scheme, of which the two steps work in different temporal scales and cooperate to improve the efficiency of radio resource. Third, with the requesting set and resource allocation, the original optimization problem can be simplified, while it is still NP hard. To solve the problem, we propose a dynamic programming approach, with which the optimal solution can be obtained in polynomial time. Moreover, a greedy algorithm is proposed to decrease the complexity. The experimental results of PCDF demonstrate that the proposed framework can both effectively shorten the playout interruption duration and improve the frame quality in various circumstances.

Exploiting the control power of SDN during the transition from IP to SDN networks

SummaryThe emerging software‐defined networking (SDN) paradigm introduces new opportunities to improve network performance due to the flexibility and programmability provided by a logically centralized element named controller. However, a rapid adoption of the full SDN architecture is difficult in the short term due to economic and technical reasons. This paper faces the SDN nodes replacement problem during the transition from traditional IP networks to fully deployed SDN networks. Six different replacement methods are proposed to select the most appropriate set of traditional IP nodes to be upgraded to SDN‐enabled switches at a particular transition stage. To show the effectiveness of the proposed methods, they have been applied on an optimization problem currently studied by the research community: the power consumption problem. An integer linear programming formulation is presented to solve it and a genetic algorithm is evaluated through simulations on realistic network topologies. Results highlight that energy‐efficiency in hybrid IP/SDN networks can be significantly improved by only replacing a reduced number of IP nodes.

Rapid detection of spammers through collaborative information sharing across multiple service providers

Spammers and telemarketers target a very large number of recipients usually dispersed across many Service Providers (SPs). Collaboration and Information sharing between SPs would increase the detection accuracy but detection effectiveness depends on the amount of information shared between SPs. Having service provider’s exchange call detail records would arguably attain the best detection accuracy but would require significant network resources. Moreover, SPs are likely to feel uncomfortable in sharing their call records because call records contain user’s private information as well as operational details of their networks. The challenge towards the design of collaborative Spam over Internet Telephony (SPIT) detection system is two-fold: it should attain high detection accuracy with a small false positive, and should fully protect the privacy of users and their service providers. In this paper, we propose a COllaborative Spit Detection System (COSDS)—a collaborative SPIT detection system for the Voice over IP (VoIP) network where service providers collaborate for the effective and early detection of SPIT callers without raising privacy concerns. To this extent, COSDS relies on a trusted Centralized Repository (CR) and exchange of non-sensitive reputation scores. The CR computes global reputation of users by aggregating the reputation scores provided by the respective collaborating SPs. The data exchanged to the CR is not sensitive regarding users privacy, and cannot be used to infer the relationship network of users. We evaluate the performance of our system using synthetic data that we have generated by simulating the realistic social behavior of spammers and non-spammers in a network. The results show that the COSDS approach has better detection accuracy as compared to the traditional stand-alone detection systems. For instances, in a setup where spammers are making calls to recipients of many SPs, COSDS successfully identifies spammers with the True Positive (TP) rate of around 80% and false positive (FP) rate of around 2% on a first day, which further increases to 100% TP rate and zero FP rate in three days. COSDS approach is fast, requires a small communication overhead, ensures privacy of users and collaborating SP, and requires only few iterations for the reputation convergence within the SP.

Pengukuran Kualitas Jaringan Internet Dengan Sinyal 3G Lte Pada STMIK Budi Darma Medan dengan Metode Quality Of Service (QoS)

In today's age the internet needs are very important for communicating or looking for information. The longer the development of the internet network is increasingly widespread such as 1G, 2G, 3G and 4G technologies. Long Term Evolution (LTE) is a long-term radio evolution access network issued by the 3rd (Generation Partnership Project). To improve internet network services at STMIK Budidarma, testing and measurement are carried out using the Quality Of Service (QoS) method to determine the quality and power of data transfer. The Quality Of Service (QoS) method found on a TCP / IP network is one that focuses on allocating bandwidth within the internet network that flows fairly and as needed. The QoS method that relies on testing the process of delay time, latency time, packet request time and creating a network topology to reduce the risk that arises.

Oblivious Routing in IP Networks

To optimize the flow of traffic in IP networks, operators do traffic engineering (TE), i.e., tune routing-protocol parameters in response to traffic demands. TE in IP networks typically involves configuring static link weights and splitting traffic between the resulting shortest-paths via the equal-cost-multipath (ECMP) mechanism. Unfortunately, ECMP is a notoriously cumbersome and indirect means for optimizing traffic flow, often leading to poor network performance. Also, obtaining accurate knowledge of traffic demands as the input to TE is a non-trivial task that may require additional monitoring infrastructure, and traffic conditions can be highly variable, further complicating TE. We leverage recently proposed schemes for increasing ECMP’s expressiveness via carefully disseminated bogus information (lies) to design COYOTE, a readily deployable TE scheme for robust and efficient network utilization. COYOTE leverages new algorithmic ideas to configure (static) traffic splitting ratios that are optimized with respect to all (even adversarial) traffic scenarios within the operator’s “uncertainty bounds”. Our experimental analyses show that COYOTE significantly outperforms today’s prevalent TE schemes in a manner that is robust to traffic uncertainty and variation. We discuss experiments with a prototype implementation of COYOTE.

ATME: Accurate Traffic Matrix Estimation in Both Public and Private Datacenter Networks

Understanding the pattern of end-to-end traffic flows in datacenter networks (DCNs) is essential to many DCN designs and operations (e.g., traffic engineering and load balancing). However, little research work has been done to obtain traffic information efficiently and yet accurately. Researchers often assume the availability of traffic tracing tools (e.g., OpenFlow) when their proposals require traffic information as input, but these tools may have high monitoring overhead and consume significant switch resources even if they are available in a DCN. Although estimating the traffic matrix (TM) between origin-destination pairs using only basic switch SNMP counters is a mature practice in IP networks, traffic flows in DCNs show totally different characteristics, while the large number of redundant routes in a DCN further complicates the situation. To this end, we propose to utilize resource provisioning information in public cloud datacenters and the service placement information in private datacenters for deducing the correlations among top-of-rack switches, and to leverage the uneven traffic distribution in DCNs for reducing the number of routes potentially used by a flow. These allow us to develop ATME as an efficient TM estimation scheme that achieves high accuracy for both public and private DCNs. We compare our two algorithms with two existing representative methods through both experiments and simulations; the results strongly confirm the promising performance of our algorithms.