The Experts below are selected from a list of 270 Experts worldwide ranked by ideXlab platform

Uttam Ghosh - One of the best experts on this subject based on the ideXlab platform.

  • WCNC Workshops - Optimized Controller Placement for Soft Handover in Virtualized 5G Network
    2020 IEEE Wireless Communications and Networking Conference Workshops (WCNCW), 2020
    Co-Authors: Deborsi Basu, Abhishek Jain, Raja Datta, Uttam Ghosh
    Abstract:

    Softwarized Network Function Virtualization (sNFV) is driving the next generation 5G telecommunication Networks to fulfill all the real time service demands of mobile users. Seamless connectivity with ultra low latency (ULL) in high mobility scenarios is one of the most necessary and challenging areas where researchers are working intensively. Thanks to Network Function Softwarization that helps to optimize the user data plane and control plane characteristics very easily with the help of Software Defined Networking (SDN). Inside a 5G Network architecture the Serving Gateways (SGW) and Packet Data Gateways (PGW) are responsible for handing over the control functions (e.g signaling and tunnel creation) from one controller to another. SDN brakes SGW to make S/PGW-C at control plane and S/PGW-U at data plane. The UE traffic forwarding decisions are taken at S/PGW-C and further it instructs the S/PGW-U to execute the required data transferring operations. Dynamic up-gradations for uninterrupted signal flow are done at SGW-C using virtual machines running on a federated cloud. In this paper, we focus on a unique and novel SGW Controller Placement Problem (CPP) where a trade off has been made in between the controller load and handover frequency within a Restricted Network latency constraint. The problem formulations are done based on a Mixed Integer linear Optimization Programming model. The Pareto optimal algorithmic solution shows the suitable control plane distributions of SGW-C satisfying all the necessary objectives.

  • optimized controller placement for soft handover in virtualized 5g Network
    Wireless Communications and Networking Conference, 2020
    Co-Authors: Deborsi Basu, Abhishek Jain, Raja Datta, Uttam Ghosh
    Abstract:

    Softwarized Network Function Virtualization (sNFV) is driving the next generation 5G telecommunication Networks to fulfill all the real time service demands of mobile users. Seamless connectivity with ultra low latency (ULL) in high mobility scenarios is one of the most necessary and challenging areas where researchers are working intensively. Thanks to Network Function Softwarization that helps to optimize the user data plane and control plane characteristics very easily with the help of Software Defined Networking (SDN). Inside a 5G Network architecture the Serving Gateways (SGW) and Packet Data Gateways (PGW) are responsible for handing over the control functions (e.g signaling and tunnel creation) from one controller to another. SDN brakes SGW to make S/PGW-C at control plane and S/PGW-U at data plane. The UE traffic forwarding decisions are taken at S/PGW-C and further it instructs the S/PGW-U to execute the required data transferring operations. Dynamic up-gradations for uninterrupted signal flow are done at SGW-C using virtual machines running on a federated cloud. In this paper, we focus on a unique and novel SGW Controller Placement Problem (CPP) where a trade off has been made in between the controller load and handover frequency within a Restricted Network latency constraint. The problem formulations are done based on a Mixed Integer linear Optimization Programming model. The Pareto optimal algorithmic solution shows the suitable control plane distributions of SGW-C satisfying all the necessary objectives.

Anna Muraco - One of the best experts on this subject based on the ideXlab platform.

  • social Network types and mental health among lgbt older adults
    Gerontologist, 2017
    Co-Authors: Hyunjun Kim, Karen I Fredriksengoldsen, Amanda E B Bryan, Anna Muraco
    Abstract:

    PURPOSE OF THE STUDY This study was designed to identify social Network types among lesbian, gay, bisexual, and transgender (LGBT) older adults and examine the relationship between social Network type and mental health. DESIGN AND METHODS We analyzed the 2014 survey data of LGBT adults aged 50 and older (N = 2,450) from Aging with Pride: National Health, Aging, and Sexuality/Gender Study. Latent profile analyses were conducted to identify clusters of social Network ties based on 11 indicators. Multiple regression analysis was performed to examine the association between social Network types and mental health. RESULTS We found five social Network types. Ordered from greatest to least access to family, friend, and other non-family Network ties, they were diverse, diverse/no children, immediate family-focused, friend-centered/Restricted, and fully Restricted. The friend-centered/Restricted (33%) and diverse/no children Network types (31%) were the most prevalent. Among individuals with the friend-centered/Restricted type, access to social Networks was limited to friends, and across both types children were not present. The least prevalent type was the fully Restricted Network type (6%). Social Network type was significantly associated with mental health, after controlling for background characteristics and total social Network size; those with the fully Restricted type showed the poorest mental health. IMPLICATIONS Unique social Network types (diverse/no children and friend-centered/Restricted) emerge among LGBT older adults. Moreover, individuals with fully Restricted social Networks are at particular risk due to heightened health needs and limited social resources. This study highlights the importance of understanding heterogeneous social relations and developing tailored interventions to promote social connectedness and mental health in LGBT older adults.

Deborsi Basu - One of the best experts on this subject based on the ideXlab platform.

  • WCNC Workshops - Optimized Controller Placement for Soft Handover in Virtualized 5G Network
    2020 IEEE Wireless Communications and Networking Conference Workshops (WCNCW), 2020
    Co-Authors: Deborsi Basu, Abhishek Jain, Raja Datta, Uttam Ghosh
    Abstract:

    Softwarized Network Function Virtualization (sNFV) is driving the next generation 5G telecommunication Networks to fulfill all the real time service demands of mobile users. Seamless connectivity with ultra low latency (ULL) in high mobility scenarios is one of the most necessary and challenging areas where researchers are working intensively. Thanks to Network Function Softwarization that helps to optimize the user data plane and control plane characteristics very easily with the help of Software Defined Networking (SDN). Inside a 5G Network architecture the Serving Gateways (SGW) and Packet Data Gateways (PGW) are responsible for handing over the control functions (e.g signaling and tunnel creation) from one controller to another. SDN brakes SGW to make S/PGW-C at control plane and S/PGW-U at data plane. The UE traffic forwarding decisions are taken at S/PGW-C and further it instructs the S/PGW-U to execute the required data transferring operations. Dynamic up-gradations for uninterrupted signal flow are done at SGW-C using virtual machines running on a federated cloud. In this paper, we focus on a unique and novel SGW Controller Placement Problem (CPP) where a trade off has been made in between the controller load and handover frequency within a Restricted Network latency constraint. The problem formulations are done based on a Mixed Integer linear Optimization Programming model. The Pareto optimal algorithmic solution shows the suitable control plane distributions of SGW-C satisfying all the necessary objectives.

  • optimized controller placement for soft handover in virtualized 5g Network
    Wireless Communications and Networking Conference, 2020
    Co-Authors: Deborsi Basu, Abhishek Jain, Raja Datta, Uttam Ghosh
    Abstract:

    Softwarized Network Function Virtualization (sNFV) is driving the next generation 5G telecommunication Networks to fulfill all the real time service demands of mobile users. Seamless connectivity with ultra low latency (ULL) in high mobility scenarios is one of the most necessary and challenging areas where researchers are working intensively. Thanks to Network Function Softwarization that helps to optimize the user data plane and control plane characteristics very easily with the help of Software Defined Networking (SDN). Inside a 5G Network architecture the Serving Gateways (SGW) and Packet Data Gateways (PGW) are responsible for handing over the control functions (e.g signaling and tunnel creation) from one controller to another. SDN brakes SGW to make S/PGW-C at control plane and S/PGW-U at data plane. The UE traffic forwarding decisions are taken at S/PGW-C and further it instructs the S/PGW-U to execute the required data transferring operations. Dynamic up-gradations for uninterrupted signal flow are done at SGW-C using virtual machines running on a federated cloud. In this paper, we focus on a unique and novel SGW Controller Placement Problem (CPP) where a trade off has been made in between the controller load and handover frequency within a Restricted Network latency constraint. The problem formulations are done based on a Mixed Integer linear Optimization Programming model. The Pareto optimal algorithmic solution shows the suitable control plane distributions of SGW-C satisfying all the necessary objectives.

G. Paulus - One of the best experts on this subject based on the ideXlab platform.

  • Unidimensional SPH simulations of reactive shock tubes in an astrophysical perspective
    Shock Waves, 2007
    Co-Authors: Y. Busegnies, J. François, G. Paulus
    Abstract:

    Smoothed Particle Hydrodynamics (SPH) is a Lagrangian method widely used for the modelling of a large variety of astrophysical fluid flows in more than one dimension. Simulations of thermonuclear explosions in stars require, besides the hydrodynamic equations, a realistic equation of state, an energy source term, and a set of nuclear kinetic equations to follow the composition changes of the gas during the explosion. The implementation of a realistic stellar equation of state, and the coupling of hydrodynamics and nuclear burning are investigated in the framework of the simple shock tube geometry. We present and discuss the results of a series of SPH simulations of a detonation in the presence of (1) a single exothermic nuclear reaction, and (2) a Restricted Network of nuclear reactions. Our results are compared to those of identical simulations performed by other authors using a different hydrodynamic method.

  • Unidimensional SPH simulations of reactive shock tubes in an astrophysical perspective
    Shock Waves, 2007
    Co-Authors: Y. Busegnies, J. François, G. Paulus
    Abstract:

    Smoothed Particle Hydrodynamics (SPH) is a Lagrangian method widely used for the modelling of a large variety of astrophysical fluid flows in more than one dimension. Simulations of thermonuclear explosions in stars require, besides the hydrodynamic equations, a realistic equation of state, an energy source term, and a set of nuclear kinetic equations to follow the composition changes of the gas during the explosion. The implementation of a realistic stellar equation of state, and the coupling of hydrodynamics and nuclear burning are investigated in the framework of the simple shock tube geometry. We present and discuss the results of a series of SPH simulations of a detonation in the presence of (1) a single exothermic nuclear reaction, and (2) a Restricted Network of nuclear reactions. Our results are compared to those of identical simulations performed by other authors using a different hydrodynamic method. © Springer-Verlag 2007.SCOPUS: ar.jinfo:eu-repo/semantics/publishe

Burkhard Monien - One of the best experts on this subject based on the ideXlab platform.

  • COMPUTING NASH EQUILIBRIA FOR TWO-PLAYER Restricted Network CONGESTION GAMES IS $\mathcal{PLS}$-COMPLETE
    Parallel Processing Letters, 2012
    Co-Authors: Dominic Dumrauf, Burkhard Monien
    Abstract:

    We determine the complexity of computing pure Nash equilibria in Restricted Network congestion games. Restricted Network congestion games are Network congestion games, where for each player there exits a set of edges which he is not allowed to use. Rosenthal's potential function guarantees the existence of a Nash Equilibrium. We show that computing a Nash equilibrium in a Restricted Network congestion game with two players is $\mathcal{PLS}$-complete, using a tight reduction from MAXCUT. The result holds for directed Networks and for undirected Networks.

  • COMPUTING NASH EQUILIBRIA FOR TWO-PLAYER Restricted Network CONGESTION GAMES IS $\mathcal{PLS}$-COMPLETE
    Parallel Processing Letters, 2012
    Co-Authors: Dominic Dumrauf, Burkhard Monien
    Abstract:

    We determine the complexity of computing pure Nash equilibria in Restricted Network congestion games. Restricted Network congestion games are Network congestion games, where for each player there exits a set of edges which he is not allowed to use. Rosenthal's potential function guarantees the existence of a Nash Equilibrium. We show that computing a Nash equilibrium in a Restricted Network congestion game with two players is [Formula: see text]-complete, using a tight reduction from MAXCUT. The result holds for directed Networks and for undirected Networks.