Sanjay Kumar Pal

Computer Network Topology Design in Limelight of Pascal Graph Property

Constantly growing demands of high productivity and security of computer systems and computer networks call the interest of specialists in the environment of construction of optimum topologies of computer mediums. In earliest phases of design, the study of the topological influence of the processes that happen in computer systems and computer networks allows to obtain useful information which possesses a significant value in the subsequent design. It has always been tried to represent the different computer network topologies using appropriate graph models. Graphs have huge contributions towards the performance improvement factor of a network. Some major contributors are de-Bruijn, Hypercube, Mesh and Pascal. They had been studied a lot and different new features were always a part of research outcome. As per the definition of interconnection network it is equivalent that a suitable graph can represent the physical and logical layout very efficiently. In this present study Pascal graph is researched again and a new characteristics has been discovered. From the perspective of network topologies Pascal graph and its properties were first studied more than two decades back. Since then, a numerous graph models have emerged with potentials to be used as network topologies. This new property is guaranteed to make an everlasting mark towards the reliability of this graph to be used as a substantial contributor as a computer network topology. This shows its credentials over so many other topologies. This study reviews the characteristics of the Pascal graph and the new property is established using appropriate algorithm and the results.

PASSWORD ENCRYPTION BASED ON DYNAMIC GRAPH LABELING PRIORITY GENERATION (D.G.L.P.G.) TECHNIQUE

The formalization of speedy technical environment due to the progression in hardware technologies is consistently stimulating the terror of brute force attacks and challenging even the strongest encryption algorithms. Current security requisition can never be truly fulfilled if security system of any real world system is dependent upon only static protection mechanism. A dynamic approach must have to be adopted to integrate dynamic protection mechanism along with static protection mechanism. Within in this scope both static and dynamic password encryption mechanisms face the danger of being attacked. Here we have expressed our concern for dynamic password security system which acts as shield against Man in the Middle attacks. In this paper we propose a password encryption technique based on the “Dynamic Graph Labeling Priority Generation (D.G.L.P.G.) Technique” and “Dynamic False Node Insertion (D.F.N.I) Technique” for dynamic password. The algorithm has achieved very low space complexity and time complexity which is O(log n). The emerged technique fits itself in the boundary of the present requisition and is flexible enough to expand its magnitude with the amplifying needs up to the boundary mark of the presented algorithm.

Origination and Expansion of Graph Theory in Dynamic Areas

The greedy need of this scientific technical world is increasing enormously and scrounging its way to enlarge its dimensions to satisfy its application arena in various practices. This paper is written to present a way to this scientific technical world to expand and hence to awake the passionate researchers to present them a very fascinating subject matter to study and to analyse, that is – ‘Graph theory, the new emerging basis of modern science and technology, which is now becoming a fundamental need of modern computer science and technology’. It is a very newly originated sub-branch of discrete mathematics having a span of less than 300 years, spontaneously growing, being diversified in the domain of science and being applied in various fields, such as classical problems, theorems and their upgraded form, mathematical computation, pattern recognition, scheduling algorithms, molecular chemistry, architectural design, linguistics, computer science/I.T. and communication. A steady approach of analytical research and formulation of new methodologies is needed to increase its fruitfulness to exploit it in the best way.

Hiding Information Using the Graph Colouring Technique

For a computing system to be trusted, it is equally important to verify that the system performs no more and no less functionalities than desired. Traditional testing and verification methods have been developed to validate whether the system meets all the requirements. They cannot detect the existence or show the nonexistence of unknown undesired functionalities. Security of software as well as information is a significant issue in the Internet age. In order to prevent software from piracy, unauthorised modification and to maintain secrecy of the information embedded into software, many techniques have been developed. Watermarking is a technique that can be used to protect software by embedding some secret information into the software to identify its copyright owner. In this paper, we propose a constrained-based watermarking technique and lay out a theoretical framework to evaluate watermarking techniques for intellectual property protection (IPP). On the basis of this framework, we analyse a watermarking technique for the graph colouring (GC) problem. Since credibility and overhead are the most important criteria for any efficient watermarking technique, we derive formulae that illustrate the trade-off between credibility and overhead. Asymptotically, we prove that for almost all random graphs, an arbitrarily high credibility can be achieved with at most one-colour overhead for proposed watermarking techniques.

Graph colouring in the limelight of degree sequence

Design and analysis of new algorithms are an ever going phenomena in the life of computer scientists. NP problems are attracting designers to design both heuristic and approximate algorithms that can result in better optimal and time-space efficient algorithms. Deterministic graph colouring algorithms are generally of contraction and sequential type in nature. Sequential algorithms can be extended by backtracking to relatively euective algorithms for the chromatic number of a graph. Incomplete backtracking leads to new heuristic for graph colouring. In this paper we describe a heuristic algorithm to colour the vertices of a graph which relies upon the comparison of the degrees and structure of the graph. We have compared it with the maximum-degree-node-first and minimum-degree-node-last criteria based algorithms. This paper reviews a broad spectrum of sequential vertex colouring algorithms based on heuristics.

Notice of Violation of IEEE Publication Principles A Pascal Graph Property and Computer Network Topology

It has always been tried to represent the different computer network topologies using appropriate graph models. Graphs have huge contributions towards the performance improvement factor of a network. Some major contributors are de-Bruijn, Hypercube, Mesh and Pascal. They had been studied a lot and different new features were always a part of research outcome. As per the definition of interconnection network it is equivalent that a suitable graph can represent the physical and logical layout very efficiently. In this present study Pascal graph is researched again and a new characteristics has been discovered. From the perspective of network topologies Pascal graph and its properties were first studied more than two decades back. Since then, a numerous graph models have emerged with potentials to be used as network topologies. This new property is guaranteed to make an everlasting mark towards the reliability of this graph to be used as a substantial contributor as a computer network topology. This shows its credentials over so many other topologies. This study reviews the characteristics of the Pascal graph and the new property is established using appropriate algorithm and the results.