Vellore Institute of Technology (VIT) is a private university located in&nbsp;Tamil Nadu, India. Founded in 1984, as Vellore Engineering College, the institution offers 20 undergraduate, 34 postgraduate, four integrated and four research programs. It has campuses in Vellore, Amravati, Bhopal and Chennai.

VIT is one of the top ranked private universities in India according to NIRF, THE and QS Rankings.&nbsp;Govt. of India has recognized&nbsp;VIT, Vellore as an&nbsp;Institution of Eminence. This has allowed VIT to take independent quality initiatives and move up in world ranking.

&nbsp;

&nbsp;

VIT University

Data communication is inevitable in current world of networking and transformation of data securely through the channels is a challenging task due to various threats. This paper presents an efficient cryptographic algorithm for the messages sent across the channels. A graph theoretic approach is implemented for the encryption and decryption process. Messages are converted into graphs and adjacency matrix of the graphs are used for encryption and decryption process. The key which has to be transmitted along with the encrypted message is also encrypted using modular inverse. Then the encrypted message is again converted to a matrix for decryption to get the original message. © 2020, Research Publication. All rights reserved.

Department of Mathematics

School of Advanced Sciences

Vellore Campus

World University root node

Advances in Mathematics: Scientific Journal

Modular inverse based secured data transmission by the application of graph theory

The domain of Computer Vision Algorithms has achieved exemplary development in the past few years. Owing to its wide range of applications, especially in object detection, image classification and image segmentation, it has gained its own significance in this technological era. This paper provides a significant remark on fractal and multifractal methods for object identification in images and also a keen review of various Computer Vision algorithms and their features for detecting objects. We have also significantly analyzed the previous contributions on various algorithms discussed for the object detection process. © 2020, World Academy of Research in Science and Engineering. All rights reserved.

International Journal of Emerging Trends in Engineering Research

An extensive review on recent evolutions in object detection algorithms

The aim of this paper is to present a Statistical Approach to analyse the anxiety level of Engineering Students and the factors causing the anxiety. Anxiety is a response of human body pertained to stress. Generally people face some sort of anxiety when they are met with sudden changes in life, be it positive or negative, the level of anxiety caused and the way they react to such changes varies as per the individual. Especially in student community, throughout their university life, students are met with several occasions of anxiety and in today’s life, managing sudden anxiety is a crucial and challenging task. Thus, in this paper we have presented a Statistical Study on effect of anxiety level of engineering students with the help of the questionnaire and we have proposed some healthy behavior to overcome the anxiety. © 2019 SERSC.

International Journal of Advanced Science and Technology

A statistical exploration on effects of anxiety faced by engineering students

Fractal theory is the propelled technique to analyze the non-linear signals with more complexity.&nbsp; Quantification of chaotic nature and complexity of the multifaceted therapeutic signals requires the estimation of the spectrum of Generalized Fractal Dimensions (GFD) where the complexity means greater inconstancy in the general form of fractal dimension range.&nbsp; This paper has proposed a fuzzy multifractal technique to analyze the age related classifications by using the Fuzzy Generalized Fractal Dimensions (F–GFD) with Gaussian fuzzy valued function through the cardiac inter-beat interval dynamics in electrocardiogram (ECG) signals.&nbsp; It has been revealed that, the designed Fuzzy GFD method accurately categorizes the young and old age subjects by graphical comparison with the typical GFD method.&nbsp; The classification rate of young and elderly subjects has also supported statistically by ANOVA test.&nbsp;&nbsp; Hence the fuzzified multifractal analysis accomplishes significantly to discriminate age groups than the classical multifractal analysis in heartbeat rate time series from ECG signals and also the conventional GFD is a specific case of the proposed F–GFD.

International Journal of Engineering and Technology (UAE)

Fuzzy Generalized Fractal Dimensions Using Inter-Heartbeat Interval Dynamics in ECG Signals for Age Related Discrimination

In this paper, a new concept of fuzzy conservative labelling is introduced. A graph is said to be a fuzzy conservative labeling graph if it has fuzzy conservative labeling. Some theorems on fuzzy conservative labeling are discussed. Fuzzy strongly conservative labeling graph and some theorems on fuzzy strongly conservative labeling are also newly defined. ©IAEME Publication.

International Journal of Civil Engineering and Technology

Fuzzy conservative and fuzzy strongly conservative labeling

Routing data packets in an effective way from source node to destination node is an important phase in the management of network. The efficiency of the routing depends on many factors such as service time, transmission time, waiting time, shortest and feasible path etc. An Optimal Routing Protocol along with M/M/1 queue is proposed in this paper, which combines the feature of shortest path and the waiting time of the packets, to choose the best path for the transmission. In Phase I, multiple possible paths from source to the destination are found out by implementing Breadth First Search Algorithm (BFS). Using BFS algorithm, all paths from source to destination are identified and cost for traversing each path is calculated. In Phase II, each link can be considered as M/M/1 queuing model and the total waiting time is calculated for every path. Total cost of the path is then, the Cost of the chosen path∗Total waiting time of the path. Path corresponding to the least total cost is considered for routing. In case of the link failure or congestion in the chosen path, next path with least total cost becomes the best path and considered for routing. © IAEME Publication.

A novel optimal routing protocol with implementation of M/M/1 queuing model

Mathematical models of queuing systems play an important role in the analysis of various networks. Queuing mechanisms are essential to manage congestion in heterogeneous network traffic. By applying appropriate queuing models in the current network scenario, the performance of network can be enhanced in a great way. In this context, to improve the network performance, a Low Latency Weighted Fair Queuing with Differential Packet Dropping (LLWFQD) approach is proposed in this paper. The complexity of the WFQ is solved by differential packet dropping method. In differential packet dropping approach the packets with different flows are dropped to achieve fairness. This packet dropping approach is applied to TCP flows in a queue. The results are analyzed with NS-2 for various bottleneck bandwidth and flow rates by considering the throughput, packet loss and delay as performance measures. The results of LLWFQD model are compared with WFQ and the corresponding improvements are shown in graphs. The results show the performance enhancement of LLWFQD than WFQ.

Fulltext

Indian Journal of Science and Technology

Low Latency Weighted Fair Queuing for Real time flows with Differential Packet Dropping

In current scenario, network traffic flows need a start-time fair queuing algorithm which is computationally efficient and also which can achieve maximum fairness regardless of variation in a network capacity. To enhance the situation of congestion, an improved round robin (IRR) queue management algorithm for elastic and inelastic traffic flows is proposed. In this approach, the traffic flows are categorised into elastic traffic flows and in-elastic traffic flows. The scheduling process in the inelastic flows is handled by the BRR scheduler algorithm since they have large capacity requirements and delay constraints and elastic flows will be scheduled using DRR-SFF. The results are simulated with NS-2 and they show consistent improvement in the performance of the network. © 2015 Inderscience Enterprises Ltd.

International Journal of Mobile Network Design and Innovation

Improved round robin queue management algorithm for elastic and inelastic traffic flows

The Core Stateless Fair Queuing (CSFQ) is a distributed approach of Fair Queuing (FQ). The limitations include its inability to estimate fairness during large traffic flows, which are short and bursty (VoIP or video), and also it utilizes the single FIFO queue at the core router. For improving the fairness and efficiency, we propose an Enhanced Core Stateless Fair Queuing (ECSFQ) with multiple queue priority scheduler. Initially priority scheduler is applied to the flows entering the ingress edge router. If it is real time flow i.e., VoIP or video flow, then the packets are given higher priority else lower priority. In core router, for higher priority flows the Multiple Queue Fair Queuing (MQFQ) is applied that allows a flow to utilize multiple queues to transmit the packets. In case of lower priority, the normal max-min fairness criterion of CSFQ is applied to perform probabilistic packet dropping. By simulation results, we show that this technique improves the throughput of real time flows by reducing the packet loss and delay.

International Arab Journal of Information Technology

Enhanced core stateless fair queuing with multiple queue priority scheduler

In diffserv networks, as the traffic flows vary constantly, it is very difficult to maintain the per-flow state. The computation of rate information of the traffic flow also becomes complex. In this study, we propose a Stateless Aggregate Fair Marking (SAMQ) with Multiple Queue Priority Scheduler for Differentiated Service (DiffServ) networks. Initially, priority scheduler is applied to the flows entering the ingress edge router. If it is real time flow like Voice over IP (VoIP) or Video, then the packets are given higher priority else lower priority. In core router, for higher priority flows the Multiple Queue Fair Queuing (MQFQ) is applied that allows a flow to utilize multiple queues to transmit the packets. In case of lower priority, Stateless Aggregate Fair Marking technique is utilized. This technique applies Core Stateless Fair Queuing (CSFQ) technique for maintaining the rate information of packet flow and distributes the token to each incoming packet without maintaining the per-flow state. By simulation results, we show that this technique improves the throughput of non-real time flows. © 2013 Science Publications.

Journal of Computer Science

Stateless aggregate fair marking scheduler for differentiated service networks

Internet Protocol (IP) has brought rapid development in many applications such as video and audio streaming, Voice-over-IP (VoIP) and e-commerce. However, these applications suffer from congestion problem, which severely worsens the network performance of real time data transmissions. In this paper, we propose a fuzzy based congestion detection technique for queuing in IP networks. This technique classifies the flow as real time and non real time and the priority scheduler prioritizes the classified flows as high and low, respectively. The congestion level of high priority flows is detected by means of fuzzy logic system. The queue delay and arrival rate are considered as input for Fuzzy logic and the level of congestion is estimated. According to the congestion level of flows, they are scheduled in two different queuing mechanisms. We simulate our technique using NS-2 and simulation results prove the efficiency of our approach. It eradicates unsolicited packet drops and improves packet delivery ratio. © 2013 Praise Worthy Prize S.r.l. - All rights reserved.