# Krishnaiyan Thulasiraman

According to our database

Collaborative distances:

^{1}, Krishnaiyan Thulasiraman authored at least 111 papers between 1985 and 2023.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2023

Efficient survivable mapping algorithm for logical topology in IP-over-WDM optical networks against node failure.

J. Supercomput., March, 2023

2022

Circuits/cutsets duality and theoretical foundation of a structural approach to survivable logical topology mapping in IP-over-WDM optical networks.

Opt. Switch. Netw., 2022

2021

Symmetric PMC model of diagnosis, <i>b</i>-matchings in graphs and fault identification in <i>t</i>-diagnosable systems.

Theor. Comput. Sci., 2021

AKCE Int. J. Graphs Comb., 2021

2020

Fault tolerance of hypercube like networks: Spanning laceability under edge faults.

Theor. Comput. Sci., 2020

AKCE Int. J. Graphs Comb., 2020

AKCE Int. J. Graphs Comb., 2020

AKCE Int. J. Graphs Comb., 2020

2019

Network Science Meets Circuit Theory: Resistance Distance, Kirchhoff Index, and Foster's Theorems With Generalizations and Unification.

IEEE Trans. Circuits Syst. I Regul. Pap., 2019

2017

Novel Survivable Logical Topology Routing by Logical Protecting Spanning Trees in IP-Over-WDM Networks.

IEEE/ACM Trans. Netw., 2017

Conditional diagnosability of a class of matching composition networks under the comparison model.

Theor. Comput. Sci., 2017

Theor. Comput. Sci., 2017

Weighted Kirchhoff index of a resistance network and generalization of Foster's theorem.

Proceedings of the IEEE International Symposium on Circuits and Systems, 2017

2016

QoS Routing Under Multiple Additive Constraints: A Generalization of the LARAC Algorithm.

IEEE Trans. Emerg. Top. Comput., 2016

Survivable Cloud Network Design Against Multiple Failures Through Protecting Spanning Trees.

CoRR, 2016

Topology Abstraction Service for IP VPNs: Core Network Partitioning for Resource Sharing.

CoRR, 2016

2015

JOCN, 2015

Network science meets circuit theory: Kirchhoff index of a graph and the power of node-to-datum resistance matrix.

Proceedings of the 2015 IEEE International Symposium on Circuits and Systems, 2015

Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

Proceedings of the 2015 IEEE International Conference on Communications, 2015

2014

A Polynomial-Time Algorithm for Computing Disjoint Lightpath Pairs in Minimum Isolated-Failure-Immune WDM Optical Networks.

IEEE/ACM Trans. Netw., 2014

Unified Mathematical Programming Frameworks for Survivable Logical Topology Routing in IP-over-WDM Optical Networks.

JOCN, 2014

J. Appl. Math., 2014

2013

IEEE Trans. Parallel Distributed Syst., 2013

Optimum logical topology routing in an IP-over-WDM optical network and physical link failure localization: An integrated approach.

Proceedings of the 5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2013

2012

Computing a Most Probable Delay Constrained Path: NP-Hardness and Approximation Schemes.

IEEE Trans. Computers, 2012

Novel survivable logical topology routing in IP-over-WDM networks by logical protecting spanning tree set.

Proceedings of the 4th International Congress on Ultra Modern Telecommunications and Control Systems, 2012

Robustness of logical topology mapping algorithms for survivability against multiple failures in an IP-over-WDM optical network.

Proceedings of the Fourth International Conference on Communication Systems and Networks, 2012

2011

Logical topology survivability in IP-over-WDM networks: Survivable lightpath routing for maximum logical topology capacity and minimum spare capacity requirements.

Proceedings of the 8th International Workshop on the Design of Reliable Communication Networks, 2011

2010

Logical topology augmentation for guaranteed survivability under multiple failures in IP-over-WDM optical networks.

Opt. Switch. Netw., 2010

Proceedings of the 6th International Wireless Communications and Mobile Computing Conference, 2010

Primal meets dual: A generalized theory of logical topology survivability in IP-over-WDM optical networks.

Proceedings of the Second International Conference on Communication Systems and Networks, 2010

2009

IEEE Trans. Circuits Syst. II Express Briefs, 2009

Circuits/Cutsets Duality and a Unified Algorithmic Framework for Survivable Logical Topology Design in IP-over-WDM Optical Networks.

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008

IEEE/ACM Trans. Netw., 2008

IEEE/ACM Trans. Netw., 2008

Eur. J. Comb., 2008

Logical Topology Design for IP-over-WDM Networks: A Hybrid Approach for Minimum Protection Capacity.

Proceedings of the 17th International Conference on Computer Communications and Networks, 2008

Dynamic Wavelength Routing in WDM Networks under Multiple Signal Quality Constraints.

Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

2007

IEEE/ACM Trans. Netw., 2007

Constraining Transition Propagation for Low-Power Scan Testing Using a Two-Stage Scan Architecture.

IEEE Trans. Circuits Syst. II Express Briefs, 2007

J. Commun. Networks, 2007

Managed Dynamic VPN Service: Core Capacity Sharing Schemes For Improved VPN Performance.

Proceedings of IEEE International Conference on Communications, 2007

2006

Constrained shortest link-disjoint paths selection: a network programming based approach.

IEEE Trans. Circuits Syst. I Regul. Pap., 2006

QoS Routing in Communication Networks: Approximation Algorithms Based on the Primal Simplex Method of Linear Programming.

IEEE Trans. Computers, 2006

IEEE J. Sel. Areas Commun., 2006

Proceedings of IEEE International Conference on Communications, 2006

Survivability Aware Routing of Logical Topologies: On Thiran-Kurant Approach, Enhancements and Evaluation.

Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

The <i>d</i>-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm.

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2005), 2005

GEN-LARAC: A Generalized Approach to the Constrained Shortest Path Problem Under Multiple Additive Constraints.

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS.

Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Proceedings of the 34th International Conference on Parallel Processing (ICPP 2005), 2005

Establishment of survivable connections in WDM networks using partial path protection.

Proceedings of IEEE International Conference on Communications, 2005

Proceedings of IEEE International Conference on Communications, 2005

Proceedings of the Global Telecommunications Conference, 2005. GLOBECOM '05, St. Louis, Missouri, USA, 28 November, 2005

2004

Approximation and Heuristic Algorithms for Delay Constrained Path Selection under Inaccurate State Information.

Proceedings of the 1st International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE 2004), 2004

Proceedings of the 1st International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE 2004), 2004

2003

Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees.

IEEE J. Sel. Areas Commun., 2003

Context independent unique state identification sequences for testing communication protocols modelled as extended finite state machines.

Comput. Commun., 2003

The multi-level paradigm for distributed fault detection in networks with unreliable processors.

Proceedings of the 2003 International Symposium on Circuits and Systems, 2003

2002

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2002

IEEE Trans. Computers, 2002

QoS issues in redundant trees for protection in vertex-redundant or edge-redundant graphs.

Proceedings of the IEEE International Conference on Communications, 2002

Delay reduction in redundant trees for preplanned protection against single link/node failure in 2-connected graphs.

Proceedings of the Global Telecommunications Conference, 2002

A scalable on-line multilevel distributed network fault detection/monitoring system based on the SNMP protocol.

Proceedings of the Global Telecommunications Conference, 2002

2000

A Matroid-Theoretic Solution to an Assignment Problem in the Conformance Testing of Communication Protocols.

IEEE Trans. Computers, 2000

Global optimization properties of parallel cooperative search algorithms: A simulation study.

Parallel Comput., 2000

Multilevel cooperative search: application to the circuit/hypergraph partitioning problem.

Proceedings of the 2000 International Symposium on Physical Design, 2000

1999

Multi-level Cooperative Search: A New Paradigm for Combinatorial Optimization and an Application to Graph Partitioning.

Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999

1998

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1998

J. Circuits Syst. Comput., 1998

Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1998

1996

IEEE Trans. Computers, 1996

J. Circuits Syst. Comput., 1996

An Algorithm for Steiner Trees in Grid Graphs and its Application to Homotopic Routing.

J. Circuits Syst. Comput., 1996

Corrigendum to 'fault detection and diagnosis capabilities of test sequence selection methods based on the FSM model' : [Computer Comm. 18(1995) 113].

Comput. Commun., 1996

Proceedings of the Proceedings IEEE INFOCOM '96, 1996

1995

A Diagnosis Algorithm for Constant Degree Structures and Its Application to VLSI Circuit Testing.

IEEE Trans. Parallel Distributed Syst., 1995

On Testing and Diagnosis of Communication Protocols Based on the FSM Model.

Comput. Commun., 1995

Fault Detection and Diagnosis Capabilities of Test Sequence Selection Methods Based on the FSM Model.

Comput. Commun., 1995

Parallel computing for network optimization: a cluster-based approach for the dual transshipment problem.

Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

Proceedings of the 1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995, Seattle, Washington, USA, April 30, 1995

Proceedings of the 5th Great Lakes Symposium on VLSI (GLS-VLSI '95), 1995

1994

SIAM J. Comput., 1994

Proceedings of the Seventh International Conference on VLSI Design, 1994

Integrated VLSI layout compaction and wire balancing on a shared memory multiprocessor: evaluation of a parallel algorithm.

Proceedings of the International Symposium on Parallel Architectures, 1994

Proceedings of the 1994 IEEE International Symposium on Circuits and Systems, ISCAS 1994, London, England, UK, May 30, 1994

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Proceedings of the Process in Evolutionary Computation, 1994

1993

IEEE Trans. Computers, 1993

Parallel Process. Lett., 1993

Evol. Comput., 1993

Parallel Network Primal-Dual Method on a Shared Memory Multiprocessor and a Unified Approach to VLSI Layout Compaction and Wire Balancing.

Proceedings of the Sixth International Conference on VLSI Design, 1993

Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993

1992

J. Circuits Syst. Comput., 1992

On Conformance Test and Fault Resolution of Protocols based on FSM Model.

Proceedings of the Computer Networks, 1992

Proceedings of the conference on European design automation, 1992

Graphs - theory and algorithms.

Wiley, ISBN: 978-0-471-51356-8, 1992

1991

J. Circuits Syst. Comput., 1991

Proceedings of the First Great Lakes Symposium on VLSI, 1991

1990

Incremental Distance and Diameter Sequences of a Graph: New Measures of Network Performance.

IEEE Trans. Computers, 1990

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1990

1989

An Efficient Distributed Protocol for Finding Shortest Paths in Networks with Negative Weights.

IEEE Trans. Software Eng., 1989

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1989

Networks, 1989

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

1988

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1988

1987

Inf. Process. Lett., 1987

Proceedings of the Distributed Algorithms, 1987

1985

Proc. IEEE, 1985