Registered Data

Contents

1 [CT078]

[CT078]

[01980] Semi-Markov modeling for power efficiency of NB-IoT devices in 5G networks

Session Date & Time : 2C (Aug.22, 13:20-15:00)
Type : Contributed Talk
Abstract : In the view of increasing Internet of Things (IoT) connections, narrowband IoT (NB-IoT) is appropriate for delay tolerant data transfer. For efficient powersaving, the extended discontinuous reception (eDRX) mode and Power Saving Mode (PSM) enhances the effect of sleep in addition to the DRX mechanism. This work proposes the two-stage method solution of the semi-Markov model (SMM) for beamforming based DRX mechanism. The numerical results show the effective contribution of the proposed model in enhancing the power saving.
Classification : 60K15, 60K30
Author(s) :
- Vidyottama Jain (Central University of Rajasthan)
- Nikita Garg (Central University of Rajasthan)
- Dharmaraja Selvamuthu (Indian Institute of Technology Delhi)

[00514] Diffusion approximation of a Markov-modulated infinite-server queue

Session Date & Time : 2C (Aug.22, 13:20-15:00)
Type : Contributed Talk
Abstract : In a queue, overdispersion nature of arrivals and stochastic nature of service times can be captured by incorporating modulation into the queue dynamics. We discuss stochastic approximations for an infinite-server queue, where the stochastic arrival and service rates are determined by a Markovian environment. The incorporation of modulation leads to an Ornstein-Uhlenbeck process as its diffusion approximation with the variance parameter capturing the stochastic variations of both modulating and modulated processes.
Classification : 60K25, 60K37
Author(s) :
- Selvaraju Natarajan (Indian Institute of Technology Guwahati, India)
- Ankita Sen (Indian Institute of Technology Guwahati, India)

[01146] Steady-State Analysis of a Single Server Queueing System Subject to Differentiated Vacations and N-Policy

Session Date & Time : 2C (Aug.22, 13:20-15:00)
Type : Contributed Talk
Abstract : An M/M/1 queueing system subject to differentiated vacations and N-policy is studied. When there are no customers, the server takes a vacation and returns to the system if N or more customers are found. Still, if the number of customers in the system is less than “N,” the server takes another vacation type. The explicit expression for steady-state probabilities of the system size is obtained. The exact solutions for some performance measures are also derived.
Classification : 60K25, 68M20, 90B22, Queueing theory
Author(s) :
- SURANGA SAMPATH MIYANAWATHURA IHALA GAMAGE (Wayamba University of Sri Lanka)

[02241] Modeling and Analysis of Queueing Systems in Communication Networks

Session Date & Time : 2C (Aug.22, 13:20-15:00)
Type : Contributed Talk
Abstract : Queueing systems are a ubiquitous feature of communication networks, and are critical to the performance and reliability of such networks. In this talk, we will explore various mathematical models and analytical techniques that can be used to model and analyze queueing systems in communication networks. Our focus will be on how these models can be used to inform network design decisions, and to optimize network performance by minimizing delays, reducing congestion, and improving resource utilization. We will begin by introducing the basic concepts of queueing theory, including arrival processes, service processes, and queueing discipline. We will discuss how queueing models can be used to analyze the behavior of communication networks, and to quantify key performance metrics such as mean response time, throughput, and resource utilization. We will then explore various analytical and simulation-based techniques for evaluating the performance of queueing systems, including Markov chains, stochastic processes, and simulation methods. We will discuss the strengths and limitations of each of these techniques, and explore how they can be used to model and optimize different types of communication networks. Next, we will examine how real-world network data can be used to calibrate and validate queueing models, and how such models can be used to inform network design and capacity planning decisions. We will discuss the challenges of working with real-world network data, and explore strategies for dealing with data quality issues, data sparsity, and data privacy concerns. Finally, we will discuss some of the current research challenges and opportunities in queueing theory and communication network analysis, including the need for more sophisticated models that can capture the dynamics of modern communication networks, the need for more scalable and efficient simulation methods, and the need for more effective optimization techniques for network design and capacity planning. In summary, this talk will provide a comprehensive overview of queueing theory and its applications in communication networks, and will be of interest to software engineers with a strong mathematics background who are interested in the performance and optimization of large-scale communication networks.
Classification : 60K25, 68M10, 90B18, 90B22, 93E03
Author(s) :
- Seyyed Ali Mohammadiyeh (University of Kashanof Kashan)

[02573] Local convergence analysis of modified King's family for multiple roots

Session Date & Time : 2C (Aug.22, 13:20-15:00)
Type : Contributed Talk
Abstract : We Introduce a new optimal King-like family of methods to solve nonlinear equations when the multiplicity of the root is known in advance. Local convergence of fourth order modified King's family, defined by first two steps of the new scheme is also studied. Radius of convergence balls of fourth order scheme are computed and compared with the existing methods. Comparison of these results show the superiority of our schemes over the existing ones.
Classification : 65A05, 65Gxx, 65H05, 65G99
Author(s) :
- Saurabh Bhatia (Panjab University Chandigarh)