Faculty Publications
Permanent URI for this communityhttps://idr.nitk.ac.in/handle/123456789/18736
Publications by NITK Faculty
Browse
12 results
Search Results
Item Applications of computer in mining industry with special regard to shovel-dumper productivity(2007) Mangalpady, M.; Murthy, Ch.S.N.; Pai, R.; Nand, R.Now-a-days computer is used in every field of engineering, including mining industry, at various stages in various capacities. One of the major problems in surface mining is material handling, which involves transportation of both ore and overburden. Most of the projects make use of shoveldumper system in spite of its huge capital investment and recurring costs. Hence a lot of mind and time has to be devoted before its procurement so as to optimize their number and maximize its utility. This paper addresses various optimization models available for productivity analysis of shovel-dumper fleet. Match factor method is one of the commonly used techniques to know the relative coverage which shovels are getting from truck fleet. Operations research techniques like queuing theory, integer programming, simulation and goal programming consider the probabilistic nature associated with the system. Even though many models are available for optimization and analyzing the productivity of shovel dumper system, further research and study is needed to devise a desirable technique for the same.Item Self-similar behavior of highway road traffic and performance analysis at toll plazas(2012) Perati, M.R.; Raghavendra, K.; Koppula, H.K.R.; Doodipala, M.R.; Dasari, R.Until recently, the Poisson process has been used to model internet and road traffic queues. It has been established that internet traffic exhibits self-similarity, which is very different from the Poisson process. Motivated by this, efforts have been made to examine whether road traffic is also self-similar. Earlier efforts in this direction indicate that road traffic is indeed self-similar. To substantiate this, this paper examines, by various methods, whether real time traffic on a busy national highway in India is self-similar. The results from this examination prove that the traffic observed on the highway is self-similar. This paper also presents a novel method based on percentiles for computing the Hurst parameter, which is an indicator for the intensity of self-similarity. The paper also validates the percentile method with two other existing methods. Additionally, the traffic at a toll plaza on the highway has been modelled as queueing system, and performance measures have also been computed, namely, mean queue length and busy period distribution. The numerical results clearly demonstrate that the analysis presented in this paper can be useful for improved designs of toll plazas.©2012 American Society of Civil Engineers. © ASCE / OCTOBER 2012.Item Evaluation of right-turn lanes at signalized intersection in non-lane-based heterogeneous traffic using microscopic simulation model(Maney Publishing michael.wagreich@univie.ac.at, 2015) Asaithambi, G.; Sivanandan, R.In developing countries like India, the traffic on urban roads is highly heterogeneous in nature, with vehicles of widely varying static and dynamic characteristics. This type of traffic is characterized by lack of queue and lane discipline (lane-less movement) based on availability of spaces near intersections. Moreover, at intersections, straight-through, left-, and right-turning vehicles seek to occupy the same physical space. In such situations, the through vehicles are susceptible to delays in the absence of turn lanes for the left-turning and right-turning vehicles and vice versa. Models suitable for analysis of such traffic flow hardly exist, and most of the available models are limited in scope. In the current study, a microscopic traffic simulation model for signalized intersection is developed specifically for heterogeneous traffic. This model covers different vehicle types and allows for some special behavior, such as seepage of two-wheelers to fronts of queues. Detailed study of queue formation and dissipation were done microscopically under non-lane-based traffic conditions near intersection area. The model was calibrated and tested with data from Chennai city, India, and its predictions were found to be in close agreement with the field data. In addition, the model makes a significant contribution to the study of right-turn lane (RTL) on delays to vehicles. In general, RTL is found to be advantageous for most cases of approach volumes and right-turn proportions. The optimal lengths of RTL are suggested for various approach volumes and right-turn proportions. © 2015 W. S. Maney & Son Ltd.Item Development of Markov Chain-Based Queuing Model and Wireless Infrastructure for EV to Smart Meter Communication in V2G(Walter de Gruyter GmbH, 2015) Hampannavar, S.; Yaragatti, R.Y.The electrical vehicles (EVs) can be connected to the grid for power transaction. The vehicle-to-grid (V2G) supports the grid requirements and helps in maintaining the load demands. The grid control center (GCC), aggregator and EV are three key entities in V2G communication. The GCC sends the information about power requirements to the aggregator. The aggregator after receiving the information from the GCC sends the information to the EVs. Based on the information, the interested EV owners participate in power transaction with the grid. The aggregator facilitates the EVs by providing the parking and charging slot. In this paper the queuing model for EVs connected to the grid and development of wireless infrastructure for the EV to Smart Meter communication is proposed. The queuing model is developed and simulated. The path loss models for WiMAX are analyzed and compared. Also, the physical layer of WiMAX protocol is modeled and simulated for the EV to Smart Meter communication in V2G. © 2015 by De Gruyter 2015.Item Implementation and validation of BLUE and PI queue disciplines in ns-3(Elsevier B.V., 2018) Jain, V.; Mittal, V.; K S, S.; Tahiliani, M.P.High queuing delay arising out of the bufferbloat problem has reignited research in the area of Active Queue Management (AQM). The Internet Engineering Task Force (IETF) has created a new working group to discuss the deployment feasibility of existing and upcoming AQM algorithms (or queuing disciplines) in the Internet. Network simulations are essential to gain an accurate and deep understanding of the network algorithms before they are deployed in the Internet. ns-3 is among the most widely used network simulators, and the recent addition of Linux-like traffic control subsystem in ns-3 makes it highly suitable and reliable for studying the performance of queuing disciplines. However, the current traffic control subsystem in ns-3 has very few queuing disciplines. In an effort to provide support for more queuing disciplines and foster active research in this area, we implement two popular algorithms in ns-3: BLUE and Proportional Integral controller (PI). This paper discusses the implementation and validation of the proposed models in ns-3, and presents a detailed comparative study of both queuing disciplines based on the evaluation guidelines provided in RFC 7928. © 2018 Elsevier B.V.Item Towards a better understanding and analysis of controlled delay (CoDel) algorithm by using fluid modelling(Institution of Engineering and Technology journals@theiet.org, 2019) Patil, S.D.; Tahiliani, M.P.In this study, a modified fluid model is proposed to understand the design of controlled delay (CoDel) algorithm for active queue management (AQM) and analyse its sensitivity to parameter settings. CoDel significantly differs from other AQM algorithms because it operates at the head of the queue and adopts a deterministic packet drop strategy, unlike other algorithms that operate at the tail and adopt a probabilistic packet drop strategy. The correctness of the proposed fluid model is verified by comparing its results with those obtained from ns-2. Subsequently, using the model developed in this study, the authors analyse the performance of CoDel algorithm by changing its internal parameters and modifying its control law. They highlight the role of the internal parameters and control law on the ability of the CoDel algorithm to control queue delay. Their analysis shows that the CoDel algorithm is sensitive to its parameter settings and that its control law requires minor modifications to gain a better control over the queue delay. © The Institution of Engineering and Technology 2018.Item Minstrel PIE: Curtailing queue delay in unresponsive traffic environments(Elsevier B.V., 2019) Patil, S.D.; Tahiliani, M.P.Active Queue Management (AQM) algorithms aim to maintain a proper trade-off between queue delay and bottleneck link utilization. However, it is often noticed that this trade-off is not achieved convincingly when unresponsive UDP flows coexist with responsive TCP flows. This paper proposes an extension to Proportional Integral controller Enhanced (PIE) algorithm called Minstrel PIE, which adapts the reference queue delay to improve the trade-off between queue delay and link utilization when unresponsive flows share the same bottleneck queue as responsive flows. Extensive evaluations through simulations and real time experiments demonstrate that Minstrel PIE improves the performance of PIE in the presence of unresponsive flows, and delivers similar performance otherwise. Moreover, the Minstrel PIE algorithm does not introduce new knobs to improve the performance of PIE and hence, can be easily deployed without any additional complexity. © 2019 Elsevier B.V.Item Revisiting design choices in queue disciplines: The PIE case(Elsevier B.V., 2020) Imputato, P.; Avallone, S.; Tahiliani, M.P.; Ramakrishnan, G.Bloated buffers in the Internet add significant queuing delays and have a direct impact on the user perceived latency. There has been an active interest in addressing the problem of rising queue delays by designing easy-to-deploy and efficient Active Queue Management (AQM) algorithms for bottleneck devices. The real deployment of AQM algorithms is a complex task because the efficiency of every algorithm depends on appropriate setting of its parameters. Hence, the design of AQM algorithms is usually entrusted on simulation environments where it is relatively straightforward to evaluate the algorithms with different parameter configurations. Unfortunately, several factors that affect the efficiency of AQM algorithms in real deployment do not manifest during simulations, and therefore, lead to inefficient design of the AQM algorithm. In this paper, we revisit the design considerations of Proportional Integral controller Enhanced (PIE), an algorithm widely considered for network deployment, and extensively evaluate its performance using a Linux based testbed. Our experimental study reveals some performance anomalies in certain circumstances and we prove that they can be attributed to a specific design choice of PIE, namely the use of the estimated departure rate to compute the expected queuing delay. Therefore, we designed an alternative approach based on packet timestamps, implemented it in the Linux kernel and proved its effectiveness through an experimental campaign. © 2020Item Decentralised priority-based shortest job first queue model for IoT gateways in fog computing(Inderscience Publishers, 2022) Jayashree, N.; Babu, B.S.; Talawar, B.An increased growth in time-critical IoT applications, led to a rise in real-time resource requirements. The stringent deadlines on latency have made IoT applications move out from far away cloud servers to distributed fog computing devices infrastructure which is available locally. To meet the touchstones of deadlines and processing times, there is a need to prioritise the job scheduling through the IoT gateways to appropriate fog devices. Studies showed that the queuing models exhibit uncertainties in choosing suitable computing devices, applying priorities to the jobs, deadline achievements, and minimum latency constraints. In this paper, we propose a Decentralised Priority-based Shortest Job First (DPSJF) queuing model for the IoT gateways for a fog computing infrastructure, which uses the priority-based jobs sorting technique to achieve better performance and also overcome most of the uncertainties in queuing. © © 2022 Inderscience Enterprises Ltd.Item DTPF Algorithm Based Open-Source Time-Sensitive Network Leveraging SDN Architecture(Institute of Electrical and Electronics Engineers Inc., 2023) Hagargund, A.G.; Shet, N.S.V.; Kulkarni, M.Time-Sensitive Networking (TSN) has enabled a lot of advancements in industrial automation, aviation, tactile networking, and other ad-hoc networking applications. The bounded latency, reliability, and self-recovering mechanisms for a network are some of the core attributes of the TSN architecture. The reliability of bench-marking of a given TSN architecture, when done with simulators, will not match with that of hardware systems. But the TSN hardware needs more capital investment along with more development time as it involves understanding the hardware-specific parameters. The research in this paper has solved this shortcoming by implementing an open-source and secured SDN(Software Defined Networking)-based TSN framework integrating IEEE's 802.1 Qbv and 802.1Qcc standards. The novelty of implementation involves i) Realization of Centralized User Configuration (CUC), Centralized Network Configuration (CNC) with open source tools. ii) An algorithm called Dynamic TSN Path Finder (DTPF) is implemented for automatically identifying TSN edges participating in TSN flow. iii) Emulation of hardware environment leveraging Linux-based queuing disciplines and traffic shapers. This unique open source-based TSN architecture is then tested with both TSN and Non-TSN traffic, to demonstrate the gating logic and the delay characteristics based on queuing discipline when applied to virtual queues. © 2013 IEEE.