Show simple item record

dc.creatorGhanem, Mohamed M.en_US
dc.date.accessioned2012-06-07T22:44:38Z
dc.date.available2012-06-07T22:44:38Z
dc.date.created1996en_US
dc.date.issued1996
dc.identifier.urihttp://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-G48en_US
dc.descriptionDue to the character of the original source materials and the nature of batch digitization, quality control issues may be present in this document. Please report any quality issues you encounter to digital@library.tamu.edu, referencing the URI of the item.en_US
dc.descriptionIncludes bibliographical references.en_US
dc.descriptionIssued also on microfiche from Lange Micrographics.en_US
dc.description.abstractCurrent implementation of multicasting is using UDP protocol which is unreliable. There are many problems in reliable multicasting that make it difficult to implement. A study of the problems of reliable multicasting and an algorithm for reliable multicast protocol are proposed in this thesis. Unfairness when some of the receivers are faster than the others, the overhead at the sender because of managing all the group members and the problem of the traffic congestion at the sender because of the acknowledgments from each receiver are the problems that our proposed algorithm solved. Our proposed protocol is to divide the multicast group into different subgroups in a way that all members of the subgroup are related in speeds, location etc. In this way, we will make the sender send the same message with different speeds to different receiver subgroups. The sender will send as many times as the number of the subgroups. This solution has the advantage that fast receivers will not wait for slow receivers until they receive their message, which will improve the performance of fast receivers. To reduce the number of acknowledgments at the sender, we select from each subgroup a member that sends acknowledgment to the sender. In this way, only one acknowledgment from the subgroup is sent to the receiver rather than every member sending an acknowledgment to the sender, which solves the problem of many acknowledgments at the sender.en_US
dc.format.mediumelectronicen_US
dc.format.mimetypeapplication/pdfen_US
dc.language.isoen_USen_US
dc.publisherTexas A&M Universityen_US
dc.rightsThis thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries in 2008. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use.en_US
dc.subjectcomputer science.en_US
dc.subjectMajor computer science.en_US
dc.titleOn the internet grouping for reliable multicastingen_US
dc.typeThesisen_US
thesis.degree.disciplinecomputer scienceen_US
thesis.degree.nameM.S.en_US
thesis.degree.levelMastersen_US
dc.type.genrethesis
dc.type.materialtexten_US
dc.format.digitalOriginreformatted digitalen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.

Request Open Access