Total Minimal Dominating Signed Graph

Cartwright and Harary considered graphs in which vertices represent persons and the edges represent symmetric dyadic relations amongst persons each of which designated as being positive or negative according to whether the nature of the relationship is positive (friendly, like, etc.) or negative (hostile, dislike, etc.). Such a network S is called a signed graph. Signed graphs are much studied in literature because of their extensive use in modeling a variety socio-psychological process and also because of their interesting connections with many classical mathematical systems

Securing Internet Protocol (IP) Storage: A Case Study

Storage networking technology has enjoyed strong growth in recent years, but security concerns and threats facing networked data have grown equally fast. Today, there are many potential threats that are targeted at storage networks, including data modification, destruction and theft, DoS attacks, malware, hardware theft and unauthorized access, among others. In order for a Storage Area Network (SAN) to be secure, each of these threats must be individually addressed. In this paper, we present a comparative study by implementing different security methods in IP Storage network.Comment: 10 Pages, IJNGN Journa

A Note On Line Graphs

In this note we define two generalizations of the line graph and obtain some results. Also, we mark some open problems

On Optimal Weighted-Delay Scheduling in Input-Queued Switches

Motivated by relatively few delay-optimal scheduling results, in comparison to results on throughput optimality, we investigate an input-queued switch scheduling problem in which the objective is to minimize a linear function of the queue-length vector. Theoretical properties of variants of the well-known MaxWeight scheduling algorithm are established within this context, which includes showing that these algorithms exhibit optimal heavy-traffic queue-length scaling. For the case of $2 \times 2$ input-queued switches, we derive an optimal scheduling policy and establish its theoretical properties, demonstrating fundamental differences with the variants of MaxWeight scheduling. Our theoretical results are expected to be of interest more broadly than input-queued switches. Computational experiments demonstrate and quantify the benefits of our optimal scheduling policy

Resource sharing protocol Z39.50: A Bird's Eye View

This article discusses the Z39.50 protocol, its genesis, development and structure. It highlights the basic functions with diagrammatic representation. Briefly describes about record syntaxes and definition. The paper also discusses the advantages and disadvantages of this protocol

Disseminating knowledge resources through Weblogs

Discribes about What is Weblogs? How to create a simple Weblogs