Construction of overlay network based on P2P technology in Grid environment

Based on the advantages of both Grid and peer-to-peer （P2P） networks, an overlay network in the Grid environment is constructed by P2P technologies by a modified version of the Chord protocol. In this mechanism, different nodes＇ accesses to different resources are determined by their contribution. Therefore, the heterogeneous resources of virtual organizations in large-scale Grid can be effectively integrated, and the key node failure as well as system bottleneck in the traditional Grid environment is eliminated. The experimental results indicate that this management mechanism can achieve better average performance in the Grid environment and maintain the P2P characteristics as well.

Topology-aware Overlay Multicast over IP Multicast Networks

Most existing overlay multicast approaches refuse to consider any network layer support no matter whether it is available or not. This design principle greatly increases the complexity of the routing algorithms and makes the overlay topologies incompatible with the underlying network. To address these issues, topology-aware overlay multicast over IP multicast networks (TOMIMN) was proposed as a novel overlay multicast protocol, which exploits the cooperation between end-hosts and IP multicast routers to construct a topology-aware overlay tree. Through a little modification to protocol independent multicast sparse mode (PIM-SM), a multicast router is able to receive registration from nearby group members and redirect passing-by join requests to them. Due to the multicast router's support, TOMIMN organizes its group members into an overlay multicast tree efficiently, which matches the physical network topology well.

Machine Learning-based Stable P2P IPTV Overlay

Live video streaming is one of the newly emerged services over the Internet that has attracted immense interest of the service providers.Since Internet was not designed for such services during its inception,such a service poses some serious challenges including cost and scalability.Peer-to-Peer(P2P)Internet Protocol Television(IPTV)is an application-level distributed paradigm to offer live video contents.In terms of ease of deployment,it has emerged as a serious alternative to client server,Content Delivery Network(CDN)and IP multicast solutions.Nevertheless,P2P approach has struggled to provide the desired streaming quality due to a number of issues.Stability of peers in a network is one of themajor issues among these.Most of the existing approaches address this issue through older-stable principle.This paper first extensively investigates the older-stable principle to observe its validity in different scenarios.It is observed that the older-stable principle does not hold in several of them.Then,it utilizes machine learning approach to predict the stability of peers.This work evaluates the accuracy of severalmachine learning algorithms over the prediction of stability,where the Gradient Boosting Regressor(GBR)out-performs other algorithms.Finally,this work presents a proof-of-concept simulation to compare the effectiveness of older-stable rule and machine learning-based predictions for the stabilization of the overlay.The results indicate that machine learning-based stability estimation significantly improves the system.

A TWO-LAYER RECURRENT NEURAL NETWORK BASED APPROACH FOR OVERLAY MULTICAST

Overlay multicast has become one of the most promising multicast solutions for IP network,and Neutral Network(NN) has been a good candidate for searching optimal solutions to the constrained shortest routing path in virtue of its powerful capacity for parallel computation. Though traditional Hopfield NN can tackle the optimization problem,it is incapable of dealing with large scale networks due to the large number of neurons. In this paper,a neural network for overlay multicast tree com-putation is presented to reliably implement routing algorithm in real time. The neural network is constructed as a two-layer recurrent architecture,which is comprised of Independent Variable Neurons(IDVN) and Dependent Variable Neurons(DVN) ,according to the independence of the decision variables associated with the edges in directed graph. Compared with the heuristic routing algorithms,it is characterized as shorter computational time,fewer neurons,and better precision.

DEAON： dynamically-evolving active overlay networks for scalable information retrieval

In this paper, we propose the dynamically-evolving active overlay network （DEAON）, which is an efficient, scalable yet simple protocol to facilitate applications of decentralized information retrieval in P2P networks. DEAON consists of three novel components ： a Desirable Topology Construction and Adaptation algorithm to guide the evolution of the overlay topology towards a small-world-like graph; a Semantic-based Neighbor Selection scheme to conduct an online neighbor ranking; a Topology-aware Intelligent Search mechanism to forward incoming queries to deliberately selected neighbors. We deploy and compare DEAON with other several existing distributed search techniques over static and dynamic environments. The results indicate that DEAON outperforms its competitors by achieving higher recall rate while using much less network resources, in both of the above environments.

SPHERE： a scalable multicast framework in overlay networks

This paper presents Sphere, a scalable multicast framework in overlay network. Sphere is a highly efficient, serf-organizing and robust multicast protocol overlayed on the Internet. The main contrihutions of this paper are twofold. First, Sphere organizes the control topology of overlay network in two directions： horizontal and vertical. The horizontal meshes are used to locate and organize hosts in tracks, and the vertical meshes are. used to manage the data paths between tracks. Second, Sphere balances stress and stretch of the overlay network by assigning hosts into different tracks and clusters. This structure distributes stress on the muhicast trees uniformly, and meantime makes path stretch as small as possible. Simulations results show that Sphere can support multicast with large group size and has good performance on organizing meshes and building data delivery trees.

QUANTIFIED COST-BALANCED ROUTING SCHEME FOR OVERLAY MULTICAST

This paper focuses on the quantitative analysis issue of the routing metrics tradeoff problem, and presents a Quantified Cost-Balanced overlay multicast routing scheme (QCost-Balanced) to the metric tradeoff problem between overlay path delay and access bandwidth at Multicast Server Nodes (MSN) for real-time ap-plications over Internet. Besides implementing a dynamic priority to MSNs by weighing the size of its service clients for better efficiency, QCost-Balanced tradeoffs these two metrics by a unified tradeoff metric based on quantitative analysis. Simulation experiments demonstrate that the scheme achieves a better tradeoff gain in both two metrics, and effective performance in metric quantitative control.

An Overlay Network for Monitoring Activities of Computer Viruses

To accurately track computer viruses,an overlay network that monitors the activities of viruses is constructed.Identifying and locating nodes infected by virus on network is achieved by a naming system in which a node in the network is mapped to a unique serial number of the hard-drive.By carefully monitoring and recording sensitive communication between local system and remote nodes on the network,and suspicious operations on files that originate from remote nodes and entered via some form of file transfer,activities of viruses in both local and network level are recorded and ready for future analysis.These data can also be used in analysis of the mechanism of a computer virus as well as its spreading mode and pattern.

Studying on equilibriums between price and QoS in multi-provider overlay access networks

From the viewpoint of game theory, this paper proposes a model that combines QoS index with price factor in overlay access networks, and uses the multinomial logit （MNL） to model the choice behaviour of users. Each service class is considered an independent and competitive entity offered by each provider, which aims at maximizing its own utility. Based on noncooperative game, we prove the existence and uniqueness of equilibriums between QoS levels and prices among various service classes, and demonstrate the properties of equilibriums. Finally, these results are verified via ntunerieal analysis.

Generation of Low-Delay and High-Stability Multicast Tree

Delay and stability are two key factors that affect the performance of multicast data transmission in a network.However,current algorithms of tree generation hardly meet the requirements of low delay and high sta-bility simultaneously.Given a general network,the generation algorithm of a multicast tree with minimum delay and maximum stability is an NP-hard problem,without a precise and efficient algorithm.To address these challenges,this paper studies the generation of low-delay and high-stability multicast trees under the model of spanning tree based on stability probability,degree-constrained,edge-weighted for multicast(T-SDE).A class of algorithms was proposed which creates the multicast tree greedy on the ratio of fan-out to delay(RFD)and probability of stability of terminal to obtain a high performance in multicast.The proposed algorithms greedily select terminals with a large RFD and a high probability of stability as forwarding nodes in the generation of the multicast tree,where the larger RFD and higher stability of upstream nodes are beneficial to achieve a low transmission delay and high stability in multicast.The proposed RFD can be compatible with the original model,which can take advantage of network connectivity during the generation of a multicast tree.This paper carries out simulation experiments on Matlab R2016b to measure the performance of the proposed algorithm.Experimental results show that the proposed algorithm can provide a smaller height,higher stability,and a lower transmission delay of the resulting multicast tree than other solutions.The spanning tree of the proposed algorithms can support low transmission delay and high stability in multicast transmission.

A Controller-Based Architecture for Information Centric Network Construction and Topology management

Information-Centric Networking(ICN) has recently emerged as a result of the increased demand to access contents regardless of their location in the network services. This new approach facilitates content distribution as a service of the network with lower delay and higher security in comparison with the current IP network. Applying ICN in current IP infrastructure leads to major complexities. One approach to deploy ICN with less complexity is to integrate ICN with Software Defined Networking(SDN). The SDN controller manages the content distribution, caching, and routing based on the users' requests. In this paper, we extend these context by addressing the ICN topology management problem over the SDN network to achieve an improved user experience as well as network performance. In particular, a centralized controller is designed to construct and manage the ICN overlay. Experimental results indicate that this adopted topology management strategy achieves high performance, in terms of low failure in interest satisfaction and reduced download time compared to a plain ICN.

Virtualizing Network and Service Functions: Impact on ICT Transformation and Standardization

Virtualization of network/service functions means time sharing network/service（and affiliated）resources in a hyper speed manner.The concept of time sharing was popularized in the 1970s with mainframe computing.The same concept has recently resurfaced under the guise of cloud computing and virtualized computing.Although cloud computing was originally used in IT for server virtualization,the ICT industry is taking a new look at virtualization.This paradigm shift is shaking up the computing,storage,networking,and ser vice industries.The hope is that virtualizing and automating configuration and service management/orchestration will save both capes and opex for network transformation.A complimentary trend is the separation（over an open interface）of control and transmission.This is commonly referred to as software defined networking（SDN）.This paper reviews trends in network/service functions,efforts to standardize these functions,and required management and orchestration.

Closer:Scalable Load Balancing Mechanism for Cloud Datacenters

Cloud providers(e.g.,Google,Alibaba,Amazon)own large-scale datacenter networks that comprise thousands of switches and links.A loadbalancing mechanism is supposed to effectively utilize the bisection bandwidth.Both Equal-Cost Multi-Path(ECMP),the canonical solution in practice,and alternatives come with performance limitations or significant deployment challenges.In this work,we propose Closer,a scalable load balancing mechanism for cloud datacenters.Closer complies with the evaluation of technology including the deployment of Clos-based topologies,overlays for network virtualization,and virtual machine(VM)clusters.We decouple the system into centralized route calculation and distributed route decision to guarantee its flexibility and stability in large-scale networks.Leveraging In-band Network Telemetry(INT)to obtain precise link state information,a simple but efficient algorithm implements a weighted ECMP at the edge of fabric,which enables Closer to proactively map the flows to the appropriate path and avoid the excessive congestion of a single link.Closer achieves 2 to 7 times better flow completion time(FCT)at 70%network load than existing schemes that work with same hardware environment.

Providing Delay-Guaranteed Multicast Transmission Services for an SDN-Based Publish/Subscribe System

Providing end-to-end delay guarantees in traditional Internet is a complex task due to the distributed nature of TCP/IP protocols. Software Defined Networking(SDN) gives a new dimension to improve QoS(Quality of Service) as it can benefit from its flexibility, programmability and centralized view. In this paper, we provide delay-guaranteed data transmission service instead of "best efforts" service for a topic-based publish/subscribe system by means of exploring these specific features of SDN. We attribute this routing problem in such conditions to Delay-Constraint Lowest Cost Steiner Tree(DCLCST) problem. To solve it, we compute the shortest delay paths from source node to every subscribe node and the shortest cost paths from every subscribe node to any other node using dijkstra algorithm. Then we construct a delay-constraint least cost steiner tree for per-topic based on these paths as multicast tree. We also present experimental results to demonstrate the effectiveness of the algorithms and methods we proposed.

Network Function Virtualization Technology:Progress and Standardization

Network innovation and business transformation are both necessary for telecom operators to adapt to new situations, but operators face challenges in terms of network bearer complexity, business centralization, and IT/CT integration. Network function virtualization （NFV） may inspire new development ideas, but many doubts still exist within industry, especially about how to introduce NFV into an operator＇ s network. This article describes the latest progress in NFV standardization, NFV requirements and hot technology issues, and typical NFV applications in an operator networks.

Topology-aware peer-to-peer overlay network for Ad-hoc

The mismatch between the structured peer-to-peer （P2P） overlay network, which is based on Hashing, and the actual physical network, leads to query repeatedly passing through some nodes in the actual route when it is applied in Ad-hoc networks. An approach of getting an appropriate node identifier （ID） bearing its local physical information is proposed, in which the traditional theory of getting node ID through Hashing the node＇s Internet protocol （IP） address is abandoned, and a topology-aware overlay network suiting Ad-hoc networks is constructed. The simulation results show that the overlay network constructed in the proposed method can avoid the route being iteratively accessed. Meanwhile, it can effectively minimize the latency and improve the load balance.

Psu： a novel low-latency constant-degree overlay networ

Many structured peer-to-peer （P2P） systems supported by distributed hash table （DHT） schemas have been proposed recently to improve the scalability of distributed virtual application systems. By organizing the peers based on interconnection topologies, existing proposed schemas are purely based on the logical relationship without knowledge of the physical networks. In this paper, we propose a new structured DHT schema, which receives routing information not just from virtual neighbors in P2P overlay network, but also from nearby physical neighbors. The average degree of our model is 5, the diameter is logarithmic. The simulation shows that our model achieves shorter query path length, higher clustering, and better robustness than other overlay networks which have the same level of degree and diameter.

Non-cooperative optimization games in market-oriented overlay networks： an integrated model of resource pricing and network formation

In this paper, we formulate a non-cooperative optimization game in market-oriented overlay networks where participating peers share their own computing resources to earn virtual money called energy. We model an overlay network as a set of non-cooperative resource providing peers, called platforms, that perform resource pricing and topology management to maximize their own energy gains. Resource consuming peers, called agents, are simply designed to migrate platform-to-platform to find the least expensive resources in the network. Simulation results are presented to demonstrate the market dynamics as well as the global properties of the network, i.e., resource price and network topology, that emerge from local interactions among the group of peers.

Pre-emptive Channel Borrowing and Traffic Overflowing Channel Allocation Scheme for Multimedia Overlay Networks

This paper proposes a channel allocation scheme for multimedia wireless networks,in which a twolayer macro-cell or micro-cell architecture is considered.Macro-cells are used to access high-mobility services;while micro-cells,which are overlaid by the macro-cells,are used to cater low-mobility services.To analyze the scheme,a multidimensional Markov traffic model is firstly developed,in which traffic characteristic of two special periods of time is considered.And then,a pre-emptive channel-borrowing scheme combined with trafficoverflowing strategy for multimedia(voice,video or data) networks is proposed,in which handoff requests can not only borrow channels from adjacent homogenous cells,but also be overflowed to heterogeneous cells.Priority strategies are also dedicated to high-mobility services for they can pre-empt channels being used by low-mobility services in macro-cells.To meet the high quality of service(QoS) requirements of video services and increase the channel utilization ratio,video services can be transformed between real-time services and non-real-time services as necessary.Simulation results show that our schemes can decrease the blocking probabilities and improve the channel utilization.

Cloud Computing-Based Forensic Analysis for Collaborative Network Security Management System

Internet security problems remain a major challenge with many security concerns such as Internet worms, spam, and phishing attacks. Botnets, well-organized distributed network attacks, consist of a large number of bots that generate huge volumes of spam or launch Distributed Denial of Service （DDoS） attacks on victim hosts. New emerging botnet attacks degrade the status of Internet security further. To address these problems, a practical collaborative network security management system is proposed with an effective collaborative Unified Threat Management （UTM） and traffic probers. A distributed security overlay network with a centralized security center leverages a peer-to-peer communication protocol used in the UTMs collaborative module and connects them virtually to exchange network events and security rules. Security functions for the UTM are retrofitted to share security rules. In this paper, we propose a design and implementation of a cloud-based security center for network security forensic analysis. We propose using cloud storage to keep collected traffic data and then processing it with cloud computing platforms to find the malicious attacks. As a practical example, phishing attack forensic analysis is presented and the required computing and storage resources are evaluated based on real trace data. The cloud- based security center can instruct each collaborative UTM and prober to collect events and raw traffic, send them back for deep analysis, and generate new security rules. These new security rules are enforced by collaborative UTM and the feedback events of such rules are returned to the security center. By this type of close-loop control, the collaborative network security management system can identify and address new distributed attacks more quickly and effectively.