Jason P. Jue

• PhD
• Professor (Full) at The University of Texas at Dallas

The emergence of diverse network applications demands more flexible and responsive resource allocation for networks. Network slicing is a key enabling technology that provides each network service with a tailored set of network resources to satisfy specific service requirements. The focus of this paper is the network slicing of access networks real...

Availability is a key service metric when deploying service function chains (SFCs) over network slices in 5G networks. We study the problem of determining the composition of a slice for a service function chain and the mapping of the slice to the physical transport network in a way that guarantees availability of the SFC while minimizing cost. To i...

The increasing demand for diverse network services entails more flexible networks that are realized by virtualized network equipment and functions. When such advanced network systems face a massive failure by natural disasters or attacks, the recovery of the entire system may be conducted progressively due to limited repair resources. The prioritiz...

When a neural network is partitioned and distributed across physical nodes, failure of physical nodes causes the failure of the neural units that are placed on those nodes, which results in a significant performance drop. Current approaches focus on resiliency of training in distributed neural networks. However, resiliency of inference in distribut...

We propose an approach to localize probabilistic correlated failures in a multilayer network where service function graphs (SFGs) are deployed over a physical network infrastructure. The proposed method utilizes logical link monitoring and Bayesian networks.

Partitioning and distributing deep neural networks (DNNs) over physical nodes such as edge, fog, or cloud nodes, could enhance sensor fusion, and reduce bandwidth and inference latency. However, when a DNN is distributed over physical nodes, failure of the physical nodes causes the failure of the DNN units that are placed on these nodes. The perfor...

Partitioning and distributing deep neural networks (DNNs) over physical nodes such as edge, fog, or cloud nodes, could enhance sensor fusion, and reduce bandwidth and inference latency. However, when a DNN is distributed over physical nodes, failure of the physical nodes causes the failure of the DNN units that are placed on those nodes. The perfor...

The increasing reliance upon cloud services entails more flexible networks that are realized by virtualized network equipment and functions. When such advanced network systems face a massive failure by natural disasters or attacks, the recovery of the entire systems may be conducted in a progressive way due to limited repair resources. The prioriti...

The interdependency between different network layers is commonly observed in Cyber Physical Systems and communication networks adopting the dissociation of logic and hardware implementation, such as Software Defined Networking and Network Function Virtualization. This paper formulates an optimization problem to improve the survivability of interdep...

With the Internet of Things (IoT) becoming part of our daily life and our environment, we expect rapid growth in the number of connected devices. IoT is expected to connect billions of devices and humans to bring promising advantages for us. With this growth, fog computing, along with its related edge computing paradigms, such as multi-access edge...

Full Text: http://www.utdallas.edu/~ashkan/papers/QDFSP.pdf *************************************************************************************************** Recent advances in the areas of Internet of Things (IoT), Big Data, and Machine Learning have contributed to the rise of a growing number of complex applications. These applications will be...

We propose a proactive dynamic network slicing scheme that utilizes a deep-learning based short-term traffic prediction approach for 5G transport networks. The demonstration shows utilization efficiency improvement from 46.33% to 71.53% under the evaluated scenario.

The interdependency between different network layers is commonly observed in Cyber Physical Systems and communication networks adopting the dissociation of logic and hardware implementation, such as Software Defined Networking and Network Function Virtualization. This paper formulates an optimization problem to improve the survivability of interdep...

48 pages, 7 tables, 11 figures, Open Access ***************************************************************************************** The data (categories and features/objectives of the papers) of this survey are available at https://github.com/ashkan-software/fog-survey-data ************************************************************************...

48 pages, 7 tables, 11 figures, Open Access ***************************************************************************************** The data (categories and features/objectives of the papers) of this survey are available at https://github.com/ashkan-software/fog-survey-data *************************************************************************...

This work presents the problem of survivable path pair routing in multi-domain optical networks with geographically correlated failures. The objective is to minimize the risk of simultaneous failure of both the primary and backup paths. We develop a probabilistic model to calculate the simultaneous failure probability of both the paths under circul...

With the Internet of Things (IoT) becoming a major component of our daily life, understanding how to improve the quality of service (QoS) for IoT applications through fog computing is becoming an important problem. In this paper, we introduce a general framework for IoT-fog-cloud applications, and propose a delay-minimizing collaboration and offloa...

Recent advances in the areas of Internet of Things (IoT), Big Data, and Machine Learning have contributed to the rise of a growing number of complex applications. These applications will be data-intensive, delay-sensitive, and real-time as smart devices prevail more in our daily life. Ensuring Quality of Service (QoS) for delay-sensitive applicatio...

With the Internet of Things (IoT) becoming a major component of our daily life, understanding how to improve the quality of service (QoS) for IoT applications through fog computing is becoming an important problem. In this paper, we introduce a general framework for IoT-fog-cloud applications, and propose a delay-minimizing collaboration and offloa...

Considering the availability of the datacenter’s network elements, we propose a coordinated protection mechanism that adopts both backup path protection and SFC replicas distributed among datacenters to support high availability while reducing total cost.

This paper discusses the intractability and heuristics of the Cluster Leader Election Problem (CLEP), which is to assign a controller to one of the switches in each cluster of a network. In order to improve scalability in Software Defined Networking (SDN), a network can be clustered into subnetworks and managed by multiple distributed controllers....

We analyze the availability of virtual optical networks (VONs) mapped over a physical optical network with correlated failures, and we propose a correlated-failure-aware VON mapping algorithm to support high availability while reducing the penalty cost and total link cost.

We formulate the routing, modulation, and spectrum assignment problem for multi-path data flow transfers in elastic optical networks, and we design a heuristic algorithm that uses non-disjoint multiple paths to schedule data flow transfers.

In this paper, we propose a multi-path fragmentation-aware routing, modulation and spectrum assignment algorithm (RMSA) for advance reservation (AR) and immediate reservation (IR) requests in elastic optical networks. Immediate reservation requests should be provided with service immediately, while advance reservation requests have specific startin...

We consider the problem of survivable virtual network mapping in a multi-domain optical network with the objective of minimizing total network link cost for a given virtual traffic demand. The survivability constraint guarantees the connectivity of virtual nodes after any single optical link failure. We propose a hierarchical software-defined netwo...

Partitioning a large network into a connected hierarchy is a proven technique for scalability and manageability. Although a significant body of work is devoted to this area of interest, a reference to survivable hierarchical networks where each partition remains -connected is missing (). A -connected partition ensures functional network organizatio...

We study the problem of survivable Virtual Optical Network (VON) mapping in a flexible grid optical network with programmable regenerators that are capable of converting spectrum and modulation format. We propose heuristic algorithms to address the problem with the objective of minimizing blocking probability for dynamic VON requests.

In this paper, we consider the problem of routing, modulation and spectrum assignment (RMSA) with holding time awareness in elastic optical networks. We consider a two dimensional schedule that maintains link resource usage in both spectrum and time domains, and we develop an RMSA algorithm that attempts to reduce resource fragmentation by scheduli...

This paper addresses the minimum network cost problem for survivable virtual optical network mapping in flexible bandwidth optical networks. We develop an ILP model and the LBSD (the largest bandwidth requirement (LB) of virtual links versus the shortest distance (SD)) mapping approach to minimize the network cost for a given set of VONs, and we in...

This paper addresses the problem of spectrum-aware survivable strategies with failure probability constraints under static traffic in flexible bandwidth optical networks. The joint failure probability between primary and backup paths must be below the maximum tolerable joint failure probability for each traffic demand. We develop integer linear pro...

In this paper, we study the problem of survivable impairment-constrained virtual optical network mapping in flexible-grid optical networks (SIC-VONM). The objective is to minimize the total cost of working and backup resources, including transponders, regenerators, and shared infrastructure, for a given set of virtual optical networks, which can su...

Recent advances in flexible and programmable device technologies, such as flexible-spectrum variable-rate transceivers and reconfigurable optical add-drop multiplexers (ROADMs), coupled with emergence of software-defined network paradigms, such as OpenFlow, have enabled the possibility of software-defined elastic optical networks that can be flexib...

We address the problem of providing shared-path protection for a set of connection requests in a flexible bandwidth optical network under the constraint that the joint failure probability of the primary path and backup path of each request is below a given maximum joint failure probability threshold. The overall objective of the problem is to minim...

In a network in which multiple domains are defined due to geographical and/or administrative reasons, only a limited amount of domain information is exchanged by domain service providers. Topology aggregation is a method used to facilitate this limited information exchange. The amount of information provided for each domain may vary based on the te...

This paper addresses the problem of minimizing spectrum usage for shared-path protection with joint failure probability constraint in flexible bandwidth optical networks. To achieve this goal, we propose an integer linear programming (ILP) model for shared-path protection and a heuristic spectrum-aware shared protection (SASP) algorithm that consid...

Survivable energy-aware and spectrum-aware approaches (SEA/SSA) are developed to minimize energy and spectrum consumption in flexible bandwidth virtual optical networks. Simulation results show that SEA and SSA can efficiently reduce energy and spectrum consumption, respectively.

We present an efficient algorithm for mapping a virtual optical network topology onto a physical multi-domain optical network with the objective of minimizing the total network link cost.

Compared to the research in energy-aware wire-less and Ethernet networks, less attention has been given to energy-aware optical counterparts. In this paper, we consider energy-aware traffic grooming problems in optical networks for both static and dynamic cases. Rather than simply considering a logical architecture of an optical node, we specifical...

In this paper, we study the problem of regenerator site (RS) selection for mixed line rate optical networks (MLR-RSS), with the objective of minimizing the number of RSs for a given set of requests. We first provide the problem definition of MLR-RSS and show that the MLR-RSS problem is NP-complete. An integer linear programming model is formulated....

In this paper, we study the problem of survivable impairment-aware virtual optical network mapping in flexible-grid optical networks (SIA-VONM). The objective is to minimize the total cost of transponders, regenerators, and shared infrastructure for a given set of virtual optical networks, which can survive single link failures. We first provide th...

Recently, exible grid transport has gained a lot of attentions due to its higher spectral and energy efficiencies in handling dynamic diverse granularity traffic. In this paper, we introduce exible grid transport architecture and address the dynamic routing, wavelength assignment, and spectrum allocation problem. We develop a novel homogeneous irre...

With the growth of mobile users and the in-creasing deployment of wireless access network infras-tructures, the issue of fault tolerance is becoming an important component of efficient wireless access net-work design. In this work, we study a survivable hier-archical network design problem. Given the available capacity, connectivity, and reliabilit...

In this paper, we aim to minimize the total network cost in flexible-grid optical networks with multiple line rates. Besides transponder cost, regenerator cost, and shared infrastructure cost, the cost of regenerator sites is also considered. We first provide the problem definition and formulate the problem as an integer linear program (ILP). We al...

In a multidomain network, topology aggregation (TA) may be adopted to provide limited information regarding intradomain connectivity without revealing detailed topology information. If the TA information does not include details on the mapping of aggregated links in the TA over the physical topology, then physical disjointness cannot be guaranteed...

In this talk, we address issues related to the composition of virtual optical networks (VONs) over a physical optical network infrastructure that is subject to physical-layer constraints. Several techniques for VON mapping in flexible-grid optical networks, with the objective of minimizing equipment and infrastructure cost, are explored. Additional...

We develop an ILP model and a spectrum-aware dedicated-path protection (SADP) algorithm to minimize the frequency slots consumed in flexible bandwidth optical networks. Simulation results show that ILP and SADP minimize frequency slot consumption.

In multi-domain optical networks, due to confidentiality and management considerations, it may be infeasible to exchange complete domain state information among domains. Topology aggregation (TA) is a widely adopted technique for aggregating a domain’s detailed topology into simpler aggregated topology with limited information. In order to generate...

We investigate the problem of minimizing spectrum resource consumption for a set of connection requests in a flexible bandwidth optical network under the constraint that the failure probability of each connection must be below a specified threshold. To optimize the total frequency slots consumed, three schemes are proposed and evaluated: the rescal...

This paper addresses the problem of survivable traffic assignment with failure probability requirement in flexible bandwidth optical networks. We describe a Survivable Traffic Cognition (STC) algorithm with joint failure probability. Survivable Traffic Assignment (STA) algorithm and Conventional Traffic Assignment (CTA) algorithm are added to illus...

Less attention has been given to energy aware optical counterparts, compared to the research in energy-aware wireless and ethernet networks. In this paper, we consider energy-aware traffic grooming problems in optical networks for both static and dynamic cases. Rather than simply considering a logical architecture of an optical node, we specificall...

Optical networks that support mixed line rates can accommodate diverse connection requests without the need for traffic grooming by assigning the appropriate line rates to match the bandwidth requirements of requests. Higher line rates offer the advantage of a lower per-unit cost of transmission but may suffer from more impairments compared to lowe...

An intelligent virtual optical network embedding approach is proposed, which minimizes the network resource usage of each request. Both transparent and translucent virtual optical link embedding is considered as specifically required by virtual optical links.

In this paper, we study the problem of how to design an energy-efficient simulcast scheme for base stations (BSs) to deliver multiple resolutions of IPTV programs simultaneously in a fixed wireless network. We refer to this problem as the energy-efficient IPTV simulcast (EES) problem. We first provide the problem definition of EES and prove that EE...

In this paper, we study the problem of regenerator site (RS) selection and regenerator placement for mixed line rate optical networks (MLR-RSSRP). The objective is to minimize the total costs of RSs and regenerators for a given set of requests whose routing is flexible. We first provide the problem definition of MLR-RSSRP, and then formulate the pr...

In Metropolitan Area Networks (MANs), point-to-multipoint applications, such as IPTV, video-on-demand, distance learning, and content distribution, can be efficiently supported through light-tree-based multicastcommunications instead of lightpath-based unicast-communications. The application of multicasting for such traffic is justified by its inhe...

Flexible grid networks enable elastic bandwidth transmission with higher spectral efficiency. In this paper, we address the Routing, Wavelength assignment, and Spectrum Allocation (RWSA) problem in flexible grid networks with the goal of maximizing spectral efficiency. We design a novel algorithm using a hybrid application of naturally-inspired pro...

In a multi-domain network, domains can be defined geographically or administratively. Since only a limited amount of information of each domain is allowed to be broadcasted by domain service providers, Topology Aggregation (TA) is usually adopted. The amount of information provided by each domain may vary based on the service provider. For instance...

Elastic optical networks can increase spectral efficiency by assigning a variable amount of spectral resources to satisfy a traffic request, instead of the fixed amount of spectrum as allocated by current fixed grid optical networks. Waveband networks reduce the number of optical switch ports by aggregating lightpaths into a waveband, and switching...

In this paper, we investigate energy-efficient resilience designs for the translucent optical networks using mixed regenerator placement (MRP). We consider both static and dynamic traffic scenarios and aim to provide 100% restoration against single-link failures while minimizing the total energy-cost on regenerators. For static traffic scenarios, w...

In this paper, we address the problem of traffic grooming and regenerator placement in a WDM optical network in which lightpaths are hop-constrained by physical impairments. The efficient placement of regenerators and electronic grooming equipment at ROADM nodes for a given network topology is required such that all traffic demands can be supported...

We address the cost-effective 2R/3R regenerators placement problem. An optimal polynomial-time algorithm for line network topologies and a heuristic for mesh network topologies are proposed. The benefits of combined 2R/3R regenerators placement are evaluated.

In this paper, we study the problem of reliable collective communication (broadcast or gossip) with the objective of maximizing the reliability of the collective communication. The need for collective communication arises in many problems of parallel and distributed computing, including Grid or cloud computing and database management. We describe t...

In this paper, we study the energy-efficient impairment-constrained regenerator placement (EIRP) problem with the objective of minimizing the total energy consumption in optical networks with mixed line rates. The destination of each path is guaranteed to receive the data correctly from the source based on the regenerator placement. We first provid...

In this paper, we study the problem of regenerator pool site selection for mixed line rate optical networks (MLR-RPSS), with the objective of minimizing the number of regenerator pool sites for a given set of requests. We first provide the problem definition of MLR-RPSS and show that the MLR-RPSS problem is NP-complete. We then present four algorit...

In this paper, we study the problem of regenerator site selection for mixed line rate optical networks. The objective is to minimize the number of regenerator sites for a given set of requests whose routing is flexible. We show that the problem is NP-complete and propose several heuristic algorithms to address the problem. The heuristic algorithms...

Provisioning of a pair of disjoint paths is crucial in WDM network planning and management in order to provide fault tolerant services. However, in networks with asymmetric nodes that have restrictions on the internal connections between outer links, existing methods for node-disjoint paths search have trap problems and require time consuming itera...

In this paper, we address the problem of survivable traffic grooming and regenerator placement in optical wavelength division multiplexing (WDM) networks with impairment constraints. The working connections are protected end to end by provisioning bandwidth along a sequence of lightpaths through either a dedicated or a shared connection-level prote...

We introduce a Wavelength Convertible Flexible Optical WDM (WC-FWDM) network architecture that offers wavelength conversion capability in addition to dynamic allocation of resources as in FWDM networks. We introduce the on-line routing, wavelength assignment and spectrum allocation problem in WC-FWDM networks for the first time, and propose an auxi...

Multicast-enabled FWDM network architecture is introduced and a naturally-inspired algorithm is proposed for the light-tree establishment problem. The algorithm improves spectral efficiency by at least 22% and 17% compared to fixed and flexible-grid solutions respectively.

We propose a “knapsack grooming” algorithm for drop-and-continue lightpath routing, which not only saves energy, but also optimizes network performance in terms of blocking probability, wavelength-link usage, and bandwidth utilization.

We propose an algorithm to find a pair of disjoint inter-domain paths with minimum total cost based on a matrix for each domain that includes information generated by Suurballe's algorithm between the intra-domain aggregated links.