access deny [1301]
access deny [1026]
Middleboxes have become a vital part of modern networks by providing services such as load balancing, optimization of network traffic, and content filtering. A sequence of middleboxes comprising a logical service is called a Service Function Chain (SFC). In this context, the main issues are to maintain an acceptable level of network path survivability and a fair allocation of the resource between different demands in the event of faults or failures. In this paper, we focus on the problems of traffic engineering, failure recovery, fault prevention, and SFC with reliability and energy consumption constraints in Software Defined Networks (SDN). These types of deployments use Fog computing as an emerging paradigm to manage the distributed small
Middleboxes have become a vital part of modern networks by providing services such as load balancing, optimization of network traffic, and content filtering. A sequence of middleboxes comprising a logical service is called a Service Function Chain (SFC). In this context, the main issues are to maintain an acceptable level of network path survivability and a fair allocation of the resource between different demands in the event of faults or failures. In this paper, we focus on the problems of traffic engineering, failure recovery, fault prevention, and SFC with reliability and energy consumption constraints in Software Defined Networks (SDN). These types of deployments use Fog computing as an emerging paradigm to manage the distributed smal
Sequencing large number of candidate disease genes which cause diseases in order to identify the relationship between them is an expensive and time-consuming task. To handle these challenges, different computational approaches have been developed. Based on the observation that genes associated with similar diseases have a higher likelihood of interaction, a large class of these approaches relay on analyzing the topological properties of biological networks. However, the incomplete and noisy nature of biological networks is known as an important challenge in these approaches. In this paper, we propose a two-step framework for disease gene prioritization:(1) construction of a reliable human FLN using sequence information and machine learning
Network function virtualization (NFV) is a vital player of modern networks providing different types of services such as traffic optimization, content filtering, and load balancing. More precisely, NFV is a provisioning technology aims at reducing the large Capital Expenditure (CAPEX) of network providers by moving services from dedicated hardware to commodity servers using Virtualized Network Functions (VNF). A sequence of VNFs/services following a logical goal is referred to as a Service Function Chain (SFC). The movement toward SFC introduces new challenges to those network services which require high reliability. To address this challenge, redundancy schemes are introduced. Existing redundancy schemes using dedicated protection enhance
Network slicing is a crucial part of the 5G networks that communication service providers (CSPs) seek to deploy. By exploiting three main enabling technologies, namely, software-defined networking (SDN), network function virtualization (NFV), and network slicing, communication services can be served to the end-users in an efficient, scalable, and flexible manner. To adopt these technologies, what is highly important is how to allocate the resources and admit the customers of the CSPs based on the predefined criteria and available resources. In this regard, we propose a novel joint resource and admission management algorithm for slice-enabled networks. In the proposed algorithm, our target is to minimize the network cost of the CSP subject t
Nowadays, data center networks confront a huge amount of data that can cause both network congestion and packet loss; therefore, traffic engineering methods can help to balance the load through the network. In recent years, quite a bit of traffic engineering methods have been proposed in order to reduce network utilization, especially in cloud data center networks. Reducing network utilization; preventing network congestion, which leads to guaranteeing QoS; and optimal using of the existing route are considered as major challenges through all these works. Prevalent traffic engineering algorithms such as ECMP do not have any focus on the current network circumstance, nor do they provide a solution for mice flows. In this work, we propose a n
Network slicing is a crucial part of the 5G networks that communication service providers (CSPs) seek to deploy. By exploiting three main enabling technologies, namely, software-defined networking (SDN), network function virtualization (NFV), and network slicing, communication services can be served to the end-users in an efficient, scalable, and flexible manner. To adopt these technologies, what is highly important is how to allocate the resources and admit the customers of the CSPs based on the predefined criteria and available resources. In this regard, we propose a novel joint resource and admission management algorithm for slice-enabled networks. In the proposed algorithm, our target is to minimize the network cost of the CSP subject t
With 5G networks on the horizon, providing immense radio access rate, mobile core networks will face an extremely heavy load to accommodate the users' requests. Employing Content Delivery Networks inside Mobile Networks (Telco-CDNs) is one of the promising solutions to alleviate the extra load and avoid congestion in the mobile core networks. Our goal is to exploit the users' profiles in cache replacement policies in order to improve their Quality of Experience (QoE). By using the information readily available in Mobile Network Operators (MNOs) such as user locations and their content preference, we propose a novel cache replacement strategy incorporating the users' profile information. We evaluate the proposed method compared to de-facto p
The functional linkage network (FLN) construction is a primary and important step in drug discovery and disease gene prioritization methods. In order to construct FLN, several methods have been introduced based on integration of various biological data. Although, there are impressive ideas behind these methods, they suffer from low quality of the biological data. In this paper, a hierarchical sequence-based approach is proposed to construct FLN. The proposed approach, denoted as S-FLN (Sequence-based Functional Linkage Network), uses the sequence of proteins as the primary data in three main steps. Firstly, the physicochemical properties of amino-acids are employed to describe the functionality of proteins. As the sequence of proteins is a
The highly dynamic nature of the current network traffics, makes the network managers to exploit the flexibility of the state-of-the-art paradigm called SDN. In this way, there has been an increasing interest in hybrid networks of SDN-MPLS. In this paper, a new traffic engineering architecture for SDN-MPLS network is proposed. To this end, OpenFlow-enabled switches are applied over the edge of the network to improve flow-level management flexibility while MPLS routers are considered as the core of the network to make the scheme applicable for existing MPLS networks. The proposed scheme re-assigns flows to the Label-Switched Paths (LSPs) to highly utilize the network resources. In the cases that the flow-level re-routing is insufficient, the
Service Function Chaining (SFC) is a service deployment concept that promises cost efficiency and increases flexibility for computer networks. On the other hand, Software Defined Networking (SDN) provides a powerful infrastructure to implement SFC. In this paper, we mathematically formulate the SFC problem in SDN-based networks. In this way, the energy consumption of the network is minimized while the traffic congestion is controlled through network reconfiguration. Additionally, a low complex heuristic algorithm is proposed to find a near-optimal solution for the mentioned problem. Simulation results show that the proposed heuristic reconfigures the network in a way that the energy consumption is near-optimal while the SFC requirements are
Peer organization is one of the most challenging issues in peer-to-peer (P2P) video streaming systems. Freeriding reduces the overall performance of these systems. The peers placed closer to the video source will have a higher quality of service. Therefore, we can mitigate the free-riding effect and encourage peers to increase uploading participation by putting peers with more upload bandwidth closer to the video sources and setting free riders far from these video sources. In this paper, we propose a distributed incentive mechanism, which extensively enhances meshbased P2P video-on-demand streaming systems. In our proposed mechanism, peers will organize an overlay based on their playback point and contributed upload bandwidth. This mechani
Software-defined networking (SDN) as a new paradigm for networking provides efficient resource reallocation platform in emerging cloud data center networks. The dynamic nature of cloud data center network's traffic, as well as the existence of big flows make it necessary to periodically reprogram the network through the SDN controller. Therefore, it is critical for network researchers to minimize the side-effects of network reconfiguration. In this way, the most challenging issue is the number of rerouted flows that affect the network stability and QoS parameters. As a result, dynamic reconfiguration of the network with minimum overhead (ie minimum flow rerouting) is an interesting problem in SDN-based resource reallocation. In this paper,
The highly dynamic nature of the current network traffics, makes the network managers to exploit the flexibility of the state-of-the-art paradigm called SDN. In this way, there has been an increasing interest in hybrid networks of SDN-MPLS. In this paper, a new traffic engineering architecture for SDN-MPLS network is proposed. To this end, OpenFlow-enabled switches are applied over the edge of the network to improve flow-level management flexibility while MPLS routers are considered as the core of the network to make the scheme applicable for existing MPLS networks. The proposed scheme re-assigns flows to the Label-Switched Paths (LSPs) to highly utilize the network resources. In the cases that the flow-level re-routing is insufficient, the
The proliferation of cloud data center applications and network function virtualization (NFV) boosts dynamic and QoS dependent traffic into the data centers network. Currently, lots of network routing protocols are requirement agnostic, while other QoS-aware protocols are computationally complex and inefficient for small flows. In this paper, a computationally efficient congestion avoidance scheme, called CECT, for software-defined cloud data centers is proposed. The proposed algorithm, CECT, not only minimizes network congestion but also reallocates the resources based on the flow requirements. To this end, we use a routing architecture to reconfigure the network resources triggered by two events: 1) the elapsing of a predefined time inter
Unlike P2P live video streaming in which all the peers in a channel watch a video with tiny differences in viewing points, in P2P video on demand (VoD) streaming systems, neighbor peers may watch the same video with more different viewing points; therefore, using push-based approach is not efficient for such systems, and the overhead of the pull-based approaches is challenging due to the periodical exchange of buffer-maps among the peers. In pull-based P2P VoD systems, to achieve better quality of experience it is necessary to use large buffers at the peers that results in more buffer-maps exchange overhead. In this paper, we study buffer-map exchange challenging in pull-based P2P VoD streaming systems and propose an adaptive mechanism for