Performance comparison of four token rings in simulated distributed computing environment

Simple item page
dc.contributor.advisorHaddix, Furman
dc.contributor.authorWang, Rong
dc.date.accessioned2020-10-06T15:20:47Z
dc.date.available2020-10-06T15:20:47Z
dc.date.issued2003-12
dc.description.abstractThe concept of self-stabilization was first proposed by Dijkstra. A self-stabilization token ring can make guarantee for a system to recover to a legal state in finite time, regardless of what illegal state the system is in. This property makes it a very preferable way to tolerate arbitrary transient faults. The thesis implements 4 self-stabilizing token ring algorithms, and compares their performance in terms of stabilization time and token delivery time in a distributed computing environment using a simulated application as the test bed.
dc.description.departmentComputer Science
dc.formatText
dc.format.extent156 pages
dc.format.medium1 file (.pdf)
dc.identifier.citationWang, R. (2003). Performance comparison of four token rings in simulated distributed computing environment (Unpublished thesis). Texas State University-San Marcos, San Marcos, Texas.
dc.identifier.urihttps://hdl.handle.net/10877/12729
dc.language.isoen
dc.subjectring networks
dc.subjectcomputer algorithms
dc.titlePerformance comparison of four token rings in simulated distributed computing environment
dc.typeThesis
thesis.degree.departmentComputer Science
thesis.degree.grantorTexas State University-San Marcos
thesis.degree.levelMasters
thesis.degree.nameMaster of Science

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Wang_Rong_2003.pdf
Size:
3.5 MB
Format:
Adobe Portable Document Format
Download

Collections

Graduate Theses and Dissertations