Reduce Network Latency Research Articles

WARM: Workload-Aware Multi-Application Task Scheduling for Revenue Maximization in SDN-Based Cloud Data Center

Nowadays an increasing number of companies and organizations choose to deploy their applications in data centers to leverage resource sharing. The increase in tasks of multiple applications, however, makes it challenging for a provider to maximize its revenue by intelligently scheduling tasks in its software-defined networking (SDN)-enabled data centers. Existing SDN controllers only reduce network latency while ignoring virtual machine (VM) latency, which may lead to revenue loss. In the context of SDN-enabled data centers, this paper presents a workload-aware revenue maximization (WARM) approach to maximize the revenue from a data center provider’s perspective. Its core idea is to jointly consider the optimal combination of VMs and routing paths for tasks of each application. This work compares it with state-of-the-art methods, experimentally. The results show that WARM yields the best schedules that not only increase the revenue but also reduce the round-trip time of tasks for all applications.

Scalable video coding algorithm and rate-distortion optimisation based on cloud computing

In order to provide end users with better quality video, this paper presents an adaptive multipath video stream scalable video coding algorithm, which is based on the cloud computing for H264/AVC extension, with the path of diversity provided by based on the cloud computing video distribution network. The method of using scalable video coding is finally adapted to the various end users. Moreover, it adapts to network bandwidth fluctuation by observing the changes of the available bandwidth over the multiple overlay paths. And performing rate-distortion optimisation in the basis of the end-to-end distortion estimation has given a method of reduce complexity, meanwhile, maintaining the balance of quality and cloud computing security. Experimental results show that the optimisation algorithm based on the cloud computing video distribution network is more effective to estimate network congestion, reduce video packet loss rate and reducing network latency, rate-distortion optimisation performance gain outperform the current redundancy coding scheme and traditional recursive optimal per-pixel estimation based on the optimal macro-block coding mode selection, and thus more effectively ensure the quality of the video network transmission.

Micro Operator Design Pattern in 5G SDN/NFV Network

The trend of 5G mobile networks is increasing with the number of users and the transmission rate. Many operators are turning to small cell and indoor coverage of telecom network service. With the emerging Software Defined Networking and Network Function Virtualization technologies, Internet Service Provider is able to deploy their networks more flexibly and dynamically. In addition to the change of the wireless mobile network deployment model, it also drives the development trend of the Micro Operator (μO). Telecom operators can provide regional network services through public buildings, shopping malls, or industrial sites. In addition, localized network services are provided and bandwidth consumption is reduced. The distributed architecture of μO tackles computing requirements for applications, data, and services from cloud data center to edge network devices or to the micro data center of μO. The service model of μO is capable of reducing network latency in response to the low‐latency applications for future 5G edge computing environment. This paper addresses the design pattern of 5G micro operator and proposes a Decision Tree Based Flow Redirection (DTBFR) mechanism to redirect the traffic flows to neighbor service nodes. The DTBFR mechanism allows different μOs to share network resources and speed up the development of edge computing in the future.

Improving I/O bandwidth with Cray DVS Client‐side Caching

SummaryCray's Data Virtualization Service, DVS, is an I/O forwarder providing access to native parallel filesystems and to Cray DataWarp application I/O accelerator at the largest system scales while still maximizing data throughput. This paper introduces DVS Client‐side Caching, a new option for DVS to improve I/O bandwidth, reduce network latency costs, and decrease the load on both DVS servers and backing parallel filesystems. Client‐side caching allows application writes to target local in‐memory cache on compute nodes. This provides low latency and high throughput for write operations. It also allows aggregation of data to be written back to the filesystem so fewer network and parallel filesystem operations are required. Caching also enables applications to reuse data previously read or written without further network overhead. This paper will discuss motivations for this work, detailed design and architecture, acceptable use cases, benchmark testing results, and possibilities for future improvement.

An enhanced active caching strategy for data-intensive computations in distributed GIS

Caching can prepare data for computational tasks in advance by tracking the requirements and behaviors of distributed geographical information systems to reduce network latency and improve computational performance. This paper presents an enhanced method to actively cache data for data-intensive computations that considers both data relationships and the timeliness of those relationships. First, the access correlations, the correlation steps and the times of the correlations are computed based on the behaviors of the computational tasks. Because the influence of historically accessed records will decrease gradually over time, only recently accessed records are used. To track changes in the relationships and prevent cache waste problems, each record is given a different age-based weight. A conditional caching probability can then be computed based on the timeliness relationships, which can be used to find the appropriate data to compute simultaneously. Finally, we present several experiments that compare the proposed method with techniques that use other data placement strategies, active caching strategies and passive caching algorithms. The results show that the proposed model has better performance than other algorithms in all respects. In addition, the proposed model results in a lower cache replacement ratio. The experiments with different data sets on different data scales indicate that the proposed algorithm can also be used in large-scale distributed environments.

LOAD BALANCING AND ENERGY EFFICIENCY IMPROVEMENT FOR SELF-ORGANIZED CLOUD RADIO ACCESS NETWORK

Cloud Radio Access Network (CRAN) is a new paradigm which will overcome the pitfalls of traditional radio access network (RAN) architecture. CRAN allows cooperative resource sharing over service providers and over cells of network. Such coordinated sharing reduces interferences thereby improving capacity of network. But the uneven cellular traffic distribution over geographical area will cause inefficient utilization of CRAN resources. To effectively address the uneven traffic load distribution the work aims to design and implement self-organizing CRAN (SO-CRAN). The proposed SO-CRAN performs load balancing to reduce the traffic load of overloaded cells of network. The CRAN load balancing (CRAN-LB) approach, prioritizes users based on their SP's traffic load, and it offloads the prioritize users to less loaded cell and hence achieves load balancing over network. CRAN-LB proves reduction in network latency over CRAN. The SO-CRAN is extended further to Green CRAN (G-CRAN) approach to achieve energy efficiency by turning off the under-utilized cells of network. GCRAN proves to be energy efficient as compared to CRAN and also maintains QoS of network unlike energy efficient CRAN which degrades network QoS.

An Environment-Friendly Multipath Routing Protocol for Underwater Acoustic Sensor Network

Underwater Acoustic Sensor Network (UASN) is a promising technique by facilitating a wide range of aquatic applications. However, routing scheme in UASN is a challenging task because of the characteristics of the nodes mobility, interruption of link, and interference caused by other underwater acoustic systems such as marine mammals. In order to achieve reliable data delivery in UASN, in this work, we present a disjoint multipath disruption-tolerant routing protocol for UASN (ENMR), which incorporates the Hue, Saturation, and Value color space (HSV) model to establish routing paths to greedily forward data packets to sink nodes. ENMR applies the mechanism to maintain the network topology. Simulation results show that, compared with the classic underwater routing protocols named PVBF, ENMR can improve packet delivery ratio and reduce network latency while avoiding introducing additional energy consumption.

Anonymity in Peer-assisted CDNs: Inference Attacks and Mitigation

Abstract The peer-assisted CDN is a new content distribution paradigm supported by CDNs (e.g., Akamai), which enables clients to cache and distribute web content on behalf of a website. Peer-assisted CDNs bring significant bandwidth savings to website operators and reduce network latency for users. In this work, we show that the current designs of peer-assisted CDNs expose clients to privacy-invasive attacks, enabling one client to infer the set of browsed resources of another client. To alleviate this, we propose an anonymous peer-assisted CDN (APAC), which employs content delivery while providing initiator anonymity (i.e., hiding who sends the resource request) and responder anonymity (i.e., hiding who responds to the request) for peers. APAC can be a web service, compatible with current browsers and requiring no client-side changes. Our anonymity analysis shows that our APAC design can preserve a higher level of anonymity than state-of-the-art peer-assisted CDNs. In addition, our evaluation demonstrates that APAC can achieve desired performance gains.

Optimal Latency in Collaborative Virtual Environment to Increase User Performance: A Survey

paper we evaluate Collaborative Virtual Environments (CVEs) in terms of network latency. Network Latency main requirements, given in the literature for CVEs, have been summarized. We also discuss effects of network latency on performance in the CVEs. Different factors can improve, by minimizing overall network latency, the performance of users in the CVEs. This review provides a comprehensive inside look to network latency in the CVEs and will help the researchers to adopt a network, with minimum latency, for their CVEs. The algorithms and ideas, suggested by the researchers, to be adopted by the CVEs to minimize network latency in virtual environment, are also discussed critically. Reducing network latency will ultimately improve the overall efficiency of CVEs.

Secure mobile agent-based English auction protocol using identity-based signature scheme

In this paper, we present a mobile English auction agent model MoEAAM, a next generation E-Auction that allows mobile agents to navigate on E-Auction houses and participate in auctions on the user's behalf even when the user is disconnected from the network. This reduces network latency and bandwidth consumption. Furthermore, MoEAAM provides many significant benefits. These include: mobility, high reactivity, anonymity and privacy for buyers; on-shelf mechanism for seller; high revenue and dispute protocol for auction houses. MoEAAM is designed based on identity-based signature scheme, which allows mobile agents to participate anonymously, and to ensure their privacy and confidentiality. MoEAAM offers strong security without sacrificing efficiency. Indeed, the analyses demonstrate that the computational costs and communication overheads in our protocol are reduced significantly while ensuring system security.

A toward cost-effective scale-free coupling network construction method

Large network average path length will cause large network delay which brings difficulty in supporting the time sensitive services and applications. Large hop distance between source node and destination node in traditional network leads to significant network delay. By adding long-ranged links, path length from source node to destiny node will be reduced and original network can be transformed into a scale-free network with a small network average path length. The network delay is optimized by minimizing hop distance, in which information can transfer more efficiently and rapidly. Adding links can lower network delay effectively, but on the other hand, it will increase its cost. Common network construction methods focus on separating networks that are very different from each other and mostly unaware of each other, such as fixed and mobile networks planning. But in many real networks, networks are dependent on each other; therefore ignoring these network interactions cannot become more efficient. Cost and effectiveness play a key role in real network construction and layering network is an effective way to analyze coupling network especially in heterogeneous network. In this paper, the model of a toward cost-effective scale-free coupling network construction method is proposed. It combines the advantages of layered network and cost-effective network. A layered coupling network model is established in which network is divided into several networks based on link property. Links in the same layer have the same property and the upper layer capability is higher than lower layer capability. The nodes in the upper network are selected from the lower layer network coupling with the corresponding nodes with the same spatial location. Based on the network optimization and evolving network researches, the increases of node degree and local network radius are supposed to be continuous, moreover cost-effective indicator is introduced which characterizes the costs and effectiveness of adding links. Based on continuum, links are added to upper layer network with a certain probability by two continuous processes and thus network evolves into a scale-free network. The two continuous processes include node degree increasing process and local network radius increasing process. In the previous processes, cost-effective indicator is introduced and only the links satisfied cost-effectiveness are added. Cost-effective indicator characterizes the cost and effectiveness of network construction. Cost is proportional to Euclidean distance and effectiveness includes revenue of network average path length decreasing and link property benefit. In the coupling network, traffic prefers to transmit in the upper layer network for reducing network latency, and consequently leading to traffic congestion in upper layer. In the simulation, network topology evolution and dynamic traffic performance are evaluated. The simulation result shows that this method can effectively reduce the network latency within cost-effective requirement and initial network characteristics are maintained. The results also show that the network average path length declines slowly when network average path length is small because lower average path length needs higher cost when average path length is small. To investigate the traffic behaviors in the coupled layered networks, the traffic dynamic transition model is taken and dynamic traffic performance is given in this evolved scale-free network. Moreover, the cooperation between the two layers can be used to optimize network traffic performance by adjusting the link capacity to satisfy the requirements for the network congestion.

Simple Virtual Channel Allocation for High-Throughput and High-Frequency On-Chip Routers

Packet-switched network-on-chip (NoC) has provided a scalable solution to the communications for tiled multicore processors. However, the virtual channel (VC) buffers in the NoC consume significant dynamic and leakage power. To improve the energy efficiency of the router design, it is advantageous to use small buffer sizes while still maintaining throughput of the network. This article proposes two new virtual channel allocation (VA) mechanisms, termed fixed VC assignment with dynamic VC allocation (FVADA) and adjustable VC assignment with dynamic VC allocation (AVADA). VCs are designated to output ports and allocated to packets according to such assignment. This can help to reduce the head-of-line blocking. Such VC-output port assignment can also be adjusted dynamically to accommodate traffic changes. Simulation results show that both mechanisms can improve network throughput by 41% on average. Real traffic evaluation shows a network latency reduction of up to 66%. In addition, AVADA can outperform the baseline in throughput with only half of the buffer size. Finally, we are able to achieve comparable or better throughput than a previous dynamic VC allocator while reducing its critical path delay by 57%. Hence, the proposed VA mechanisms are suitable for low-power, high-throughput, and high-frequency NoC designs.

An Energy-Balanced Path Plan Strategy for Mobile Sensor Networks

Several studies have demonstrated that significant energy consumption reduction of nodes and network energy hole elimination can be achieved by introducing a mobile sink. In most related researches, mobile sink's energy is always assumed to be sufficient to collect data sensed by normal nodes. However, mobile sink consumes large amounts of energy in practical applications and it is impossible to own infinite energy. Correspondingly, the moving path plan of the mobile sink, which can be treated as a TSP (Travelling Salesman Problem), plays an important role in reducing and balancing network energy consumption. In this paper, an energy efficient mobile sink path planning strategy (EEPP) is proposed. In this strategy, LEACH protocol is introduced to balance the static network energy consumption; A heuristic path optimization method is utilized to further shorten the mobile sink path and reduce network latency. Simulation results show that our algorithm has good performance on the network energy consumption balancing, thus extending the network lifetime.

Wearout Resilience in NoCs Through an Aging Aware Adaptive Routing Algorithm

Continuous technology scaling has made aging mechanisms, such as negative bias temperature instability and electromigration primary concerns in network-on-chip (NoC) designs. In this paper, we extensively analyze the effects of these aging mechanisms on NoC routers and links. We observe a critical need of a robust aging-aware routing algorithm that not only reduces power-performance overheads caused due to aging degradation, but also minimizes the stress experienced by heavily utilized routers and links. To solve this problem, we propose an aging-aware adaptive routing algorithm and a router microarchitecture that routes the packets along the paths, which are both least congested and experience minimum aging degradation. After an extensive experimental analysis using real workloads, we observe 13% and 12.17% average overhead reduction in network latency and energy–delay product per flit, a 10.4% improvement in performance, and a 60% improvement in mean time to failure using our aging-aware routing algorithm.

A Long-wire-connected and Multi-channel 3D Network-on-chip Design for Many-core System

To reduce traffic jam caused by various data competitions for channel, we present a low delay and energy efficient network-on-chip with three channels for different type's data. Hence, the transmission for control data between cores won’t be congested by the big amount of data transmitted from caches to core, and it achieves better performance in latency and energy. Our strategy is to make a directive long wire to connect two nodes in the same row or column, and distribute these connective wires to different layers which are connected by 3D stacking technology. In the many-core system applied with this topology, every pair of core-cache nodes are at most 5 hops away while real-time and short control information is transmitted by a 2D mesh network. The experimental results show up to 23% of network latency reduction and up to 15% energy reduction when compared to a 3D network-on-chip. DOI: http://dx.doi.org/10.11591/telkomnika.v11i12.2764 Full Text: PDF

Ticket-Based Fast Handover Authentication Protocol for Wireless Sensor Networks

Wireless sensor Network (WSN) is an emerging technology that widely used for secure communication purpose. In a fast moving world of communication obtaining service from the access point of transmission is necessary. Whenever mobile user moves from one site to another site Provision of secure handover process is a major considerable thing. In case of achieving secure handover authentication process the delay occurrences is possible in network communication. There is a conflict between security requirements and communication, computation overhead. To overcome this problem a Novel approach of Handover Mechanism is proposed namely credential Ticket based fast handover mechanism using pair hand protocols functions which resolves conflicts and reduced network latency to obtain rapid handover among access points in the network.

Application Research of Improved Ant Colony Algorithm in Hybrid Mobile Agent Routing

Mobile agent routing essentially is a multi-constraint optimization problem, for Ant Colony algorithm for global search capability is weak, the feedback information of the system does not use and has the problem of low efficiency of finding exact solutions, propose an improved Ant Colony Algorithm for WSN mobile agent routing. This algorithm takes full use of the wireless sensor node energy, the direction of ants is determined according to the residual energy and the distance of nodes, quickly find the global optimal solution for mobile agent route. Simulation results show that the algorithm can find optimal mobile agent route in a relatively short time, relative to other routing algorithms, reducing network latency and average energy consumption, effectively alleviate network congestion, and extend the network lifetime.

SWIFT: A Low-Power Network-On-Chip Implementing the Token Flow Control Router Architecture With Swing-Reduced Interconnects

A 64-bit, 8 × 8 mesh network-on-chip (NoC) is presented that uses both new architectural and circuit design techniques to improve on-chip network energy-efficiency, latency, and throughput. First, we propose token flow control, which enables bypassing of flit buffering in routers, thereby reducing buffer size and their power consumption. We also incorporate reduced-swing signaling in on-chip links and crossbars to minimize datapath interconnect energy. The 64-node NoC is experimentally validated with a 2 × 2 test chip in 90 nm, 1.2 V CMOS that incorporates traffic generators to emulate the traffic of the full network. Compared with a fully synthesized baseline 8 × 8 NoC architecture designed to meet the same peak throughput, the fabricated prototype reduces network latency by 20% under uniform random traffic, when both networks are run at their maximum operating frequencies. When operated at the same frequencies, the SWIFT NoC reduces network power by 38% and 25% at saturation and low loads, respectively.

OPNET Network Simulations Based on the Performance of WLAN IEEE802.11

This paper mainly focus on the modeling and simulating of WLAN (the wireless local area network) IEEE802.11. Based on the current research of IEEE 802.11 protocol and the most powerful network simulation tool OPNET, the paper introduces various behavior of WLAN and standards for WLAN. Research on CSMA / CA(Carrier Sense Multiple Access / Collision Avoidance) and a simulation study of optimization algorithm to the binary backoff time are conducted, DCF(Distributed Coordination Function)-based access solutions are analyze. The simulation of MAC(media access control) and PHY(Physical Layer）functional design and algorithm theory have been carried out. It can be seen from the simulation result that the theory of optimal design reduces network latency and packet loss rate, and improve the system throughput, which has an important reference value for the future deployment of WLAN IEEE 802.11 standards.

Research of Hybrid Mobile Agent Routing in Wireless Sensor Network

The mobile agent route is essentially a multi-constraint optimization problem, Genetic Algorithms has fast random global search ability, but the feedback information of the system does not use and has the problem of low efficiency of finding exact solutions, propose a genetic hybrid ant colony algorithm for WSN mobile agent route. Use of the fast random global search capabilities of genetic algorithm to find better solutions, then the better solution replaced by the initial pheromone of the ant colony algorithm, finally use the advantages of convergence speed of ant colony algorithm to find the global optimal solution for mobile agent route. Simulation results show that the algorithm can find optimal mobile agent route in a relatively short time, relative to other routing algorithms, reducing network latency and average energy consumption, improving the speed and efficiency of data transfer.