On the fault tolerance of fat-trees

dc.contributor.author	Νικολετσέας, Σωτήρης	el
dc.contributor.author	Πάντζιου, Γραμματή Ε.	el
dc.contributor.author	Ψύχαρης, Π.	el
dc.contributor.author	Σπυράκης, Παύλος	el
dc.date.accessioned	2015-05-28T19:10:54Z
dc.date.available	2015-05-28T19:10:54Z
dc.date.issued	2015-05-28
dc.identifier.uri	http://hdl.handle.net/11400/11437
dc.rights	Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.source	http://link.springer.com/chapter/10.1007%2FBFb0002735	en
dc.subject	δενδροειδή δίκτυα
dc.subject	οριζόντιο κλάσμα
dc.subject	ασύνδετες πορείες
dc.subject	περιορισμοί εύρους ζώνης
dc.subject	fat-tree networks
dc.subject	linear fraction
dc.subject	disjoint paths
dc.subject	bandwidth constraints
dc.title	On the fault tolerance of fat-trees	en
heal.type	conferenceItem
heal.classification	Επιστήμες
heal.classification	Πληροφορική
heal.classification	Science
heal.classification	Computer science
heal.classificationURI	N/A-Επιστήμες
heal.classificationURI	N/A-Πληροφορική
heal.classificationURI	http://skos.um.es/unescothes/C03532
heal.classificationURI	http://skos.um.es/unescothes/C00750
heal.identifier.secondary	DOI: 10.1007/BFb0002735
heal.language	en
heal.access	campus
heal.recordProvider	Τεχνολογικό Εκπαιδευτικό Ίδρυμα Αθήνας. Σχολή Τεχνολογικών Εφαρμογών. Τμήμα Μηχανικών Πληροφορικής Τ.Ε.	el
heal.publicationDate	1997-08-26
heal.bibliographicCitation	Nikoletseas, S., Pantziou, G., Psyharis, P. and Spirakis, P. (1997) On the fault tolerance of fat-trees. Proceedings of the 3rd Intl. Conference on Parallel Processing - Euro-Par’97. 1300, pp.208-217. Passau, Germany: Springer Berlin Heidelberg	en
heal.abstract	We examine the reliability properties of ideal fat-trees, a general model used to capture both distance and bandwidth constraints of various classes of fat-tree networks. We allow the edges and the vertices of the network to fail independently with probability f, and show that: (1) Any fat-tree G can always be partitioned into an upper (G H) and a lower (G L) part. After the faults, the remaining part of G L guarantees that a linear fraction of the leaves of the fat-tree still connect to the upper part, with high probability. (2) G H is robust, in the sense that, after the faults, at least half of the edge-disjoint paths between any set of “leaves” of G H are preserved with probability tending to 1, even in the case of failure probabilities as high as f < 0.25. The robust properties of G H hold for the case that fat-nodes do not have internal edges and also for the case that fat-nodes are random regular graphs. (3) For the special case of a pruned butterfly, there is a critical probability p c for the existence of a linear sized component surviving the failures and including a large fraction of terminal nodes. We show that p c ≥ 0.42.	en
heal.publisher	Springer Berlin Heidelberg	en
heal.fullTextAvailability	true
heal.conferenceName	Proceedings of the 3rd Intl. Conference on Parallel Processing - Euro-Par’97	en
heal.conferenceItemType	full paper