A Robust Spanning Tree Topology for Data Collection and Dissemination in Distributed Environments

Large-scale distributed applications are subject to frequent disruptions due to resource contention and failure. Such disruptions are inherently unpredictable and, therefore, robustness is a desirable property for the distributed operating environment. In this work, we describe and evaluate a robust...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on parallel and distributed systems Ročník 18; číslo 5; s. 608 - 620
Hlavní autori:	England, D., Bharadwaj Veeravalli, Weissman, J.B.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.05.2007 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithm design and analysis Algorithms Analytical models Data collection Displays Disruption Distributed algorithms distributed computing divisible load scheduling Energy consumption fault tolerance graph theory Large-scale systems Network topology Networks Power generation Resilience Robustness Scheduling Sensors Software Studies Topology Trees wireless sensor networks
ISSN:	1045-9219, 1558-2183
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	Large-scale distributed applications are subject to frequent disruptions due to resource contention and failure. Such disruptions are inherently unpredictable and, therefore, robustness is a desirable property for the distributed operating environment. In this work, we describe and evaluate a robust topology for applications that operate on a spanning tree overlay network. Unlike previous work that is adaptive or reactive in nature, we take a proactive approach to robustness. The topology itself is able to simultaneously withstand disturbances and exhibit good performance. We present both centralized and distributed algorithms to construct the topology, and then demonstrate its effectiveness through analysis and simulation of two classes of distributed applications: Data collection in sensor networks and data dissemination in divisible load scheduling. The results show that our robust spanning trees achieve a desirable trade-off for two opposing metrics where traditional forms of spanning trees do not. In particular, the trees generated by our algorithms exhibit both resilience to data loss and low power consumption for sensor networks. When used as the overlay network for divisible load scheduling, they display both robustness to link congestion and low values for the makespan of the schedule
AbstractList	Large-scale distributed applications are subject to frequent disruptions due to resource contention and failure. Such disruptions are inherently unpredictable and, therefore, robustness is a desirable property for the distributed operating environmen [abstract truncated by publisher]. When used as the overlay network for divisible load scheduling, they display both robustness to link congestion and low values for the makespan of the schedule Large-scale distributed applications are subject to frequent disruptions due to resource contention and failure. Such disruptions are inherently unpredictable and, therefore, robustness is a desirable property for the distributed operating environment. In this work, we describe and evaluate a robust topology for applications that operate on a spanning tree overlay network. Unlike previous work that is adaptive or reactive in nature, we take a proactive approach to robustness. The topology itself is able to simultaneously withstand disturbances and exhibit good performance. We present both centralized and distributed algorithms to construct the topology, and then demonstrate its effectiveness through analysis and simulation of two classes of distributed applications: Data collection in sensor networks and data dissemination in divisible load scheduling. The results show that our robust spanning trees achieve a desirable trade-off for two opposing metrics where traditional forms of spanning trees do not. In particular, the trees generated by our algorithms exhibit both resilience to data loss and low power consumption for sensor networks. When used as the overlay network for divisible load scheduling, they display both robustness to link congestion and low values for the makespan of the schedule
Author	England, D. Bharadwaj Veeravalli Weissman, J.B.
Author_xml	– sequence: 1 givenname: D. surname: England fullname: England, D. organization: Dept. of Comput. Sci. & Eng., Minnesota Univ., Minneapolis, MN – sequence: 2 surname: Bharadwaj Veeravalli fullname: Bharadwaj Veeravalli – sequence: 3 givenname: J.B. surname: Weissman fullname: Weissman, J.B.
BookMark	eNqFkc9rFDEUx4NUsK1evXgJHvQ068vk97HsVisUFLueQzaTKSmzyZpkCv3vzXTFQ6EKgRcen-97yfd7hk5iih6htwRWhID-tP2-uVn1AHJFgPYv0CnhXHU9UfSk3YHxTvdEv0JnpdwBEMaBnSJ7gX-k3VwqvjnYGEO8xdvsPd6mQ5rS7QMeU8YbWy1ep2nyroYUsY0D3oRS_D5E-9gJcWnUHHZz9QO-jPchp7j3sZbX6OVop-Lf_Knn6Ofny-36qrv-9uXr-uK6c6wntaNix50Uo3RMed6eTrkTvVTWjRyEg9Fpp4UfCJNq0MMIvB2ptNsBE8Ryeo4-Hucecvo1-1LNPhTnp8lGn-ZiNFDBmjvyv6RSIITuFW3kh3-SlDHOpFyWv38C3qU5x_Zfo0lznQrFGsSOkMuplOxH40J99K9mGyZDwCxBmiVIswRpliCbbPVEdshhb_PD84J3R0Hw3v-FGRGgKdDfGSqpQQ
CODEN	ITDSEO
CitedBy_id	crossref_primary_10_3390_s90806028 crossref_primary_10_1007_s10922_016_9367_y crossref_primary_10_1007_s00607_014_0414_9 crossref_primary_10_4018_ijdst_2014070102 crossref_primary_10_1016_j_comcom_2010_02_008 crossref_primary_10_1016_j_procs_2011_04_240 crossref_primary_10_1007_s10951_007_0051_7 crossref_primary_10_1155_2010_402680 crossref_primary_10_1016_j_comcom_2012_11_008 crossref_primary_10_1109_TPDS_2007_70798 crossref_primary_10_1016_j_proeng_2011_08_1064 crossref_primary_10_1007_s11276_015_0971_7 crossref_primary_10_1109_TCYB_2018_2850760 crossref_primary_10_1016_j_adhoc_2013_04_004 crossref_primary_10_3390_s16101576 crossref_primary_10_1109_TPDS_2009_62 crossref_primary_10_3390_s141223017 crossref_primary_10_1109_TC_2010_140
Cites_doi	10.1109/12.324544 10.1109/71.308534 10.1073/pnas.1536783100 10.1002/jos.115 10.1103/PhysRevE.60.1412 10.1109/98.878532 10.1145/1089733.1089736 10.1109/TPDS.2005.117 10.1109/71.679214 10.1109/MCOM.2002.1024422 10.1109/HPDC.2005.1520948 10.1109/TPDS.2004.24 10.1007/11533719_45 10.1007/978-1-349-03521-2 10.1109/TPDS.2005.125 10.1103/PhysRevLett.84.2529 10.1038/35019019 10.1109/7.705897 10.1023/B:CLUS.0000018567.06753.de 10.1109/HOTOS.2001.990056 10.1109/3468.895891
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2007
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2007
DBID	97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3
DOI	10.1109/TPDS.2007.1032
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering Engineering Research Database
DatabaseTitle	CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList	Technology Research Database Technology Research Database Technology Research Database Technology Research Database
Database_xml	– sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science
EISSN	1558-2183
EndPage	620
ExternalDocumentID	2544522131 10_1109_TPDS_2007_1032 4160930
Genre	orig-research
GroupedDBID	--Z -~X .DC 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACIWK AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD HZ~ H~9 ICLAB IEDLZ IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNI RNS RZB TN5 TWZ UHB VH1 AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3
ID	FETCH-LOGICAL-c421t-36b5c76f7c48e515535c6278acf506c0fc9c96ed1478d9df05f05789cb0461a53
IEDL.DBID	RIE
ISICitedReferencesCount	34
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000245136400004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1045-9219
IngestDate	Thu Oct 02 13:52:58 EDT 2025 Sun Sep 28 06:55:00 EDT 2025 Thu Oct 02 12:16:36 EDT 2025 Sun Nov 30 03:44:59 EST 2025 Sat Nov 29 08:12:12 EST 2025 Tue Nov 18 21:45:11 EST 2025 Wed Aug 27 02:52:19 EDT 2025
IsDoiOpenAccess	false
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	5
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c421t-36b5c76f7c48e515535c6278acf506c0fc9c96ed1478d9df05f05789cb0461a53
Notes	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 content type line 23
OpenAccessLink	http://scholarbank.nus.edu.sg/handle/10635/50852
PQID	912193684
PQPubID	23500
PageCount	13
ParticipantIDs	proquest_journals_912193684 proquest_miscellaneous_903640077 proquest_miscellaneous_880669283 crossref_citationtrail_10_1109_TPDS_2007_1032 crossref_primary_10_1109_TPDS_2007_1032 ieee_primary_4160930 proquest_miscellaneous_34454775
PublicationCentury	2000
PublicationDate	2007-05-01
PublicationDateYYYYMMDD	2007-05-01
PublicationDate_xml	– month: 05 year: 2007 text: 2007-05-01 day: 01
PublicationDecade	2000
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE transactions on parallel and distributed systems
PublicationTitleAbbrev	TPDS
PublicationYear	2007
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref13 Byrnes (ref29) 2006 ref11 ref10 ref2 ref1 ref17 Bertsekas (ref14) 1997 Ganesan (ref15) ref16 ref19 ref18 ref24 ref23 West (ref12) 2001 ref26 ref25 England (ref28) 2006 ref20 ref22 ref8 ref7 ref9 Drozdowski (ref21) 1997 ref4 Bharadwaj (ref27) 1996 ref6 Oppenheimer (ref3) ref5
References_xml	– volume-title: Proc. Symp. Operating Systems Principles (SOSP ’01) ident: ref15 article-title: Large-Scale Network Discovery: Design Tradeoffs in Wireless Sensor Systems – ident: ref22 doi: 10.1109/12.324544 – ident: ref23 doi: 10.1109/71.308534 – ident: ref4 doi: 10.1073/pnas.1536783100 – ident: ref11 doi: 10.1002/jos.115 – volume-title: S.O.S. Survivability: Obstacles and Solutions, Proc. Second Bertinoro Workshop Future Directions in Distributed Computing (FuDiCo II) ident: ref3 article-title: Towards a Framework for Automated Robustness Evaluation of Distributed Services – ident: ref8 doi: 10.1103/PhysRevE.60.1412 – ident: ref17 doi: 10.1109/98.878532 – year: 2006 ident: ref28 article-title: Robust Design for Distributed Computing Systems – ident: ref18 doi: 10.1145/1089733.1089736 – ident: ref10 doi: 10.1109/TPDS.2005.117 – ident: ref25 doi: 10.1109/71.679214 – ident: ref16 doi: 10.1109/MCOM.2002.1024422 – ident: ref2 doi: 10.1109/HPDC.2005.1520948 – volume-title: Technical Report MN-ISYE-TR-06-006 year: 2006 ident: ref29 article-title: Divisible Load Scheduling in Distributed Computing Environments: Complexity and Algorithms – ident: ref7 doi: 10.1109/TPDS.2004.24 – volume-title: Selected Problems of Scheduling Tasks in Multiprocessor Computer Systems year: 1997 ident: ref21 – volume-title: Parallel and Distributed Computation: Numerical Methods year: 1997 ident: ref14 – ident: ref19 doi: 10.1007/11533719_45 – ident: ref13 doi: 10.1007/978-1-349-03521-2 – ident: ref9 doi: 10.1109/TPDS.2005.125 – ident: ref6 doi: 10.1103/PhysRevLett.84.2529 – volume-title: Introduction to Graph Theory year: 2001 ident: ref12 – volume-title: Scheduling Divisible Loads in Parallel and Distributed Systems year: 1996 ident: ref27 – ident: ref5 doi: 10.1038/35019019 – ident: ref24 doi: 10.1109/7.705897 – ident: ref26 doi: 10.1023/B:CLUS.0000018567.06753.de – ident: ref1 doi: 10.1109/HOTOS.2001.990056 – ident: ref20 doi: 10.1109/3468.895891
SSID	ssj0014504
Score	2.047495
Snippet	Large-scale distributed applications are subject to frequent disruptions due to resource contention and failure. Such disruptions are inherently unpredictable... When used as the overlay network for divisible load scheduling, they display both robustness to link congestion and low values for the makespan of the schedule
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	608
SubjectTerms	Algorithm design and analysis Algorithms Analytical models Data collection Displays Disruption Distributed algorithms distributed computing divisible load scheduling Energy consumption fault tolerance graph theory Large-scale systems Network topology Networks Power generation Resilience Robustness Scheduling Sensors Software Studies Topology Trees wireless sensor networks
Title	A Robust Spanning Tree Topology for Data Collection and Dissemination in Distributed Environments
URI	https://ieeexplore.ieee.org/document/4160930 https://www.proquest.com/docview/912193684 https://www.proquest.com/docview/34454775 https://www.proquest.com/docview/880669283 https://www.proquest.com/docview/903640077
Volume	18
WOSCitedRecordID	wos000245136400004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-2183 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014504 issn: 1045-9219 databaseCode: RIE dateStart: 19900101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS-wwEB984sF38Pth_cxB8GK03ebzKK7iSURX8FbSJAVBurLbFfzvzaTdougeHvRQ0jmETiaZycz8fgAnCHhS5VVJg7PBKAsOLFVGljQcNk5bjsTTVSSbkHd36vlZ3y_BWd8L472PxWf-HF9jLt-N7Qyvyi6C8xAC8BCg_5FStL1afcaA8UgVGKILTnUwww6gMUv1xeh--NiCFSJ63LcDKDKq_NiG49lys_5_s9qAtc6HJJet0jdhyddbsD7nZyCduW7B3y9gg9tgLsnDuJxNG_L41hIVkdHEezJqaRI-SHBfydA0hsTLhNjvQEztyBBT9lgxE0deahxoebK8I9dfGuV24OnmenR1SzuCBWrZIGtoLkpupaikZcoj10vOrRhIZWzFU2HTymqrhXcZk8ppV6U8PFJpWyJMu-H5P1iux7XfBZJZ5ZzMSxkUzEpvtOLC5zZYPzOpd4ME6PyvF7ZDH0cSjNciRiGpLlBLSIopC9RSAqe9_FuLu7FQcht10kt16khgf67UojPLaaGzsDJyoVgCx_3XYE-YJDG1H8-mRc4Q4kzyBMgCibDjCaGDW7ZYRGN2F5GS9n6f3D6stnfEWDh5AMvNZOYPYcW-Ny_TyVFc2J8XQPaF
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fS9xAEB7ECm0f1GrFaNV9KPSlW5PL_nyUnqJoD6kp-BY2uxsQJCd3uUL_--5scsFS70HIQ9jMw5LZ2Z3Zmfk-gM8IeFLndUWDs8EoCw4sVUZWNBw2TluOxNN1JJuQk4m6v9e3a_B16IXx3sfiM_8NX2Mu303tAq_KToPzEALwEKC_QeasvltryBkwHskCQ3zBqQ6G2EM0Zqk-LW7Hdx1cIeLH_XMERU6V_zbieLpcbL1uXtuw2XuR5KxT-wdY880ObC0ZGkhvsDvw_hnc4C6YM_JzWi3mLbl76qiKSDHznhQdUcIfEhxYMjatIfE6IXY8ENM4MsakPdbMxJGHBgc6pizvyPmzVrmP8OvivPh-SXuKBWrZKGtpLipupailZcoj20vOrRhJZWzNU2HT2mqrhXcZk8ppV6c8PFJpWyFQu-H5Hqw308bvA8msck7mlQwqZpU3WnHhcxvsn5nUu1ECdPnXS9vjjyMNxmMZ45BUl6glpMWUJWopgS-D_FOHvLFSchd1Mkj16kjgcKnUsjfMeamzsDJyoVgCJ8PXYFGYJjGNny7mZc4Q5EzyBMgKibDnCaGDY7ZaRGN-F7GSDl6e3Am8vSx-3JQ3V5PrQ3jX3RhjGeUnWG9nC38EG_Z3-zCfHcdF_hcNm_nO
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Robust+Spanning+Tree+Topology+for+Data+Collection+and+Dissemination+in+Distributed+Environments&rft.jtitle=IEEE+transactions+on+parallel+and+distributed+systems&rft.au=England%2C+D&rft.au=Veeravalli%2C+Bharadwaj&rft.au=Weissman%2C+J.B&rft.date=2007-05-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=1045-9219&rft.eissn=1558-2183&rft.volume=18&rft.issue=5&rft.spage=608&rft_id=info:doi/10.1109%2FTPDS.2007.1032&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=2544522131
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1045-9219&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1045-9219&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1045-9219&client=summon