University of Calcutta (informally known as Calcutta University or CU) is a collegiate public state university located in Kolkata, West Bengal, India.&nbsp;Within India it is recognized as a &quot;Five-Star University&quot; and accredited &quot;A&quot; Grade by National Assessment and Accreditation Council.

&nbsp;

The University of Calcutta has secured the Fifth position among the Universities of India in the prestigious &quot;Indian University Ranking 2019&quot; list, released by the NIRF of the Ministry of Human Resource Development, Government of India.

&nbsp;

It was established on 24 January 1857, and was one of the first institutions in Asia to be established as a multidisciplinary and Western-style university. Its alumni and faculty include several heads of state, heads of government, social reformers, prominent artists, only academy award winner and Dirac medal winner in India, many Fellows of the Royal Society and five Nobel laureates as of 2019 which is highest in South Asia.

University Of Calcutta

World University root node

GENERAL

Advances in Computing Science-ASIAN 2000: 6th Asian Computing Science {\ldots}

A New Multihop Logical Topology for Reliable

The design of a scalable logical topology for reliable optical communication is discussed. The new topology has a very simple structure and is associated with a simple routing scheme supporting a large number of nodes with small nodal degree and small diameter. The presence of multiple number of paths between any two nodes in exchange of reasonable number of hops in the network, ensures a higher degree of reliability compared to other existing topologies in case of link failure as well as in balancing link loading in the network.

Computer Science and Engineering

IEEE Region 10 Annual International Conference, Proceedings/TENCON

Design of a scalable logical topology for reliable optical communication

A new scalable logical topology for multihop optical networks has been presented in this paper based on de-Bruijn graph. The de-Bruijn graph having simple routing property is a regular non-scalable logical topology having diameter to be of logarithmic value of number of nodes. The proposed topology adds the advantage of scalability over those in de-Bruijn graph, keeping perturbation in the network to a very low level during insertion of nodes, at the cost of marginal variance in degree of the network. © Springer-Verlag Berlin Heidelberg 2000.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A new scalable topology for multihop optical networks

This paper presents a scalable logical topology for multihop optical networks based on de-Bruijn graph, a regular non-scalable one with simple routing strategy. In addition to its scalability property, this new topology maintains the simplicity in routing as in de-Bruijn graph while keeping its diameter same throughout the insertion of nodes as that in a de-Bruijn graph where the diameter is of logarithmic value of its number of nodes. Also, perturbation in the network is maintained at a very low level, while inserting a node in the network.

Design of a new scalable topology for multihop optical networks

This paper presents a new logical topology GIADM-net, a generalised IADM network for enhancing the reliability of optical networks using wavelength division multiplexing. The presence of multiple number of paths of same distance between any two nodes in exchange of reasonable number of hops in the network, ensures a higher degree of reliability compared to other existing topologies in case of link failure, as well as in balancing link loading in the network so as to maximise the network throughput. This GIADM-net, connects any arbitrary no. of nodes in a regular graph as opposed to the cases in De Bruijn graph and shufflenet. The average hopping distance between two nodes, using this topology is smaller, compared to that in GEM net, shufflenet and De Bruijn Graph, at the cost of marginal increase in diameter. © Springer-Verlag Berlin Heidelberg 2000.