Edge disjoint spanning trees and failure recovery in data communication networks

Edge disjoint spanning trees and failure recovery in data communication networks

Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1983.

Bibliographic Details
Main Author:	Roskind, James Anthony
Other Authors:	Robert G. Gallager.
Format:	Thesis
Language:	eng
Published:	Massachusetts Institute of Technology 2005
Subjects:	Electrical Engineering and Computer Science.
Online Access:	http://hdl.handle.net/1721.1/15483

Similar Items

On Directed Edge-Disjoint Spanning Trees in Product Networks, An Algorithmic Approach
by: A.R. Touzene, et al.
Published: (2014-12-01)

Approximation algorithms for disjoint paths problems
by: Kleinberg, Jon M
Published: (2005)

Disjoint Spanning Tree Based Reliability Evaluation of Wireless Sensor Network
by: Sonam Lata, et al.
Published: (2020-05-01)

Spanning Trees with Disjoint Dominating and 2-Dominating Sets
by: Miotk Mateusz, et al.
Published: (2022-02-01)

Embedding Spanning Disjoint Cycles in Hypercube Networks with Prescribed Edges in Each Cycle
by: Weiyan Wu, et al.
Published: (2023-09-01)

Faster generation of random spanning trees
by: Ma̧dry, Aleksander
Published: (2010)

Time optimal self-stabilizing spanning tree algorithms
by: Aggarwal, Sudhanshu Madan
Published: (2007)

New foundations for efficient authentication, commutative cryptography, and private disjointness testing
by: Weis, Stephen August, 1978-
Published: (2007)

Edge Disjoint Hamilton Cycles in Knödel Graphs
by: Palanivel Subramania Nadar Paulraja, et al.
Published: (2016-07-01)

Disjoint-union partial algebras
by: Robin Hirsch, et al.
Published: (2017-06-01)

Guarded Second-Order Logic, Spanning Trees, and Network Flows
by: Achim Blumensath
Published: (2010-02-01)

Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests
by: Bart Bogaerts, et al.
Published: (2024-02-01)

On spatially disjoint lightpaths in optical networks
by: Ashraf, M. Waqar, et al.
Published: (2018)

Energy efficient node disjoint multipath routing to improve wireless sensor network lifetime
by: Almazroi, Abdulaleem Ali, et al.
Published: (2015)

Reliable data communication in faulty computer networks
by: Spinelli, John Michael
Published: (2005)

Maximally spatial-disjoint lightpaths in optical networks
by: Ashraf, M. Waqar, et al.
Published: (2018)

Directory services for Internet telephony : creating a spanning layer over the Internet and telephone networks
by: Sears, Andrew Lester, 1973-
Published: (2008)

Graphs with many vertex-disjoint cycles
by: Dieter Rautenbach, et al.
Published: (2012-09-01)

Network analysis on safety culture and worker‘s behaviour : A forest of all minimum spanning trees
by: Djauhari, Maman A., et al.
Published: (2012)

Queue occupancy in single-server deterministic service time tree networks
by: Neely, Michael J. (Michael James), 1975-
Published: (2005)

Edge- and Node-Disjoint Paths in P Systems
by: Michael J. Dinneen, et al.
Published: (2010-10-01)

Spread spectrum for indoor wireless data communication
by: Elder, James Michael
Published: (2007)

OPTIMIZATION OF DISJOINTS FOR MINIMIZATION OF FAILURE IN WDM OPTICAL NETWORK
by: A. Renugadevi, et al.
Published: (2015-06-01)

OPTIMIZATION OF DISJOINTS FOR MINIMIZATION OF FAILURE IN WDM OPTICAL NETWORK
by: A. Renugadevi, et al.
Published: (2015-06-01)

A schedule-based approach for flow-control in data communication networks
by: Mukherji, Utpal
Published: (2005)

Round robin scheduling for fair flow control in data communication networks
by: Hahne, Ellen Louise
Published: (2005)

Data communications via cable television networks : technical and policy considerations
by: Estrin, Deborah Lynn
Published: (2007)

Optimised disjoint virtual backbone algorithms for wireless sensor networks
by: Simon T. Obenofunde, et al.
Published: (2021-10-01)

Capacity provisioning, failure recovery and throughput analysis for low earth orbit satellite constellations
by: Sun, Jun, 1975-
Published: (2005)

Solution strategies for the spanning tree detection problem
by: Ye, Min Thu.
Published: (2012)

A VLSI architecture for a data compression engine in a communications network
by: Hou, Brian Ta-Cheng
Published: (2006)

The complexity of quantum disjointness
by: Klauck, Hartmut
Published: (2018)

Clustered Spanning Tree - Conditions for Feasibility
by: Nili Guttmann-Beck, et al.
Published: (2019-08-01)

Flying between obstacles with an autonomous knife-edge maneuver
by: Barry, Andrew J. (Andrew James)
Published: (2013)

Analysis of cascading failures in power networks
by: Abarinov, Irina V., 1976-
Published: (2013)

Effective parallel computation on workstation cluster with a user-level communication network
by: Hoe, James C. (James Chu-Yue)
Published: (2007)

Length 3 Edge-Disjoint Paths Is NP-Hard
by: Alpert, Hannah, et al.
Published: (2017)

Surface Code Compilation via Edge-Disjoint Paths
by: Michael Beverland, et al.
Published: (2022-05-01)

Computational evolutionary genomics : phylogenomic models spanning domains, genes, individuals, and species
by: Wu, Yi-Chieh, Ph. D. Massachusetts Institute of Technology
Published: (2014)

Tropical Vertex-Disjoint Cycles of a Vertex-Colored Digraph: Barter Exchange with Multiple Items Per Agent
by: Timothy Highley, et al.
Published: (2018-07-01)