{"id":{"repo_id":"usf","oai_identifier":"oai:digitalcommons.usf.edu:etd-5100"},"canonical_url":"https://search.ndltd.org/etd/usf/oai:digitalcommons.usf.edu:etd-5100","repository":{"repo_id":"usf","name":"University of South Florida","base_url":"https://digitalcommons.usf.edu/do/oai/"},"display":{"title":"Modeling the Throughput Performance of the SF-SACK Protocol","abstract":"Besides the two classical techniques used to evaluate the performance of a protocol, computer simulation and experimental measurements, mathematical modeling has been used to study the performance of the TCP protocol. This technique gives an elegant way to gain insights when studying the behavior of a protocol, while providing useful information about its performance. This thesis presents an analytical model for the SF-SACK protocol, a TCP SACK based protocol conceived to be appropriate for data and streaming applications. SF-Sack modifies the multiplicative part of the Additive Increase Multiplicative Decrease of TCP to provide good performance for data and streaming applications, while avoiding the TCP-friendliness problem of the Internet. The modeling of the SF-SACK protocol raises new challenges compared to the classical TCP modeling in two ways: first, the model needs to be adapted to a more complex dynamism of the congestion window, and second, the model needs to incorporate the scheduler that SF-SACK makes use of in order to maintain a periodically updated value of the congestion window. Presented here is a model that is progressively built in order to consider these challenges. The first step is to consider only losses detected by triple-duplicate acknowledgments, with the restriction that one such loss happens each scheduler interval. The second step is to consider losses detected via triple-duplicate acknowledgments, while eliminating the above restriction. Finally, the third step is to include losses detected via time-outs. The result is an analytical characterization of the steady-state send rate and throughput of a SF-SACK flow as a function of the loss probability, the round-trip time (RTT), the time-out interval, and the scheduler interval. The send rate and the throughput of SF-SACK were compared against available results for TCP Reno. The obtained graphs showed that SF-SACK presents a better performance than TCP. The analytical model of the SF-SACK follows the trends of the results that are presently available, using both the ns-2 simulator and experimental measurements.","abstract_html":"Besides the two classical techniques used to evaluate the performance of a protocol, computer simulation and experimental measurements, mathematical modeling has been used to study the performance of the TCP protocol. This technique gives an elegant way to gain insights when studying the behavior of a protocol, while providing useful information about its performance. This thesis presents an analytical model for the SF-SACK protocol, a TCP SACK based protocol conceived to be appropriate for data and streaming applications. SF-Sack modifies the multiplicative part of the Additive Increase Multiplicative Decrease of TCP to provide good performance for data and streaming applications, while avoiding the TCP-friendliness problem of the Internet. The modeling of the SF-SACK protocol raises new challenges compared to the classical TCP modeling in two ways: first, the model needs to be adapted to a more complex dynamism of the congestion window, and second, the model needs to incorporate the scheduler that SF-SACK makes use of in order to maintain a periodically updated value of the congestion window. Presented here is a model that is progressively built in order to consider these challenges. The first step is to consider only losses detected by triple-duplicate acknowledgments, with the restriction that one such loss happens each scheduler interval. The second step is to consider losses detected via triple-duplicate acknowledgments, while eliminating the above restriction. Finally, the third step is to include losses detected via time-outs. The result is an analytical characterization of the steady-state send rate and throughput of a SF-SACK flow as a function of the loss probability, the round-trip time (RTT), the time-out interval, and the scheduler interval. The send rate and the throughput of SF-SACK were compared against available results for TCP Reno. The obtained graphs showed that SF-SACK presents a better performance than TCP. The analytical model of the SF-SACK follows the trends of the results that are presently available, using both the ns-2 simulator and experimental measurements.","abstract_has_math":false,"creators":["Voicu, Laura M."],"institution":"University of South Florida","degree_name":null,"degree_level":"Thesis","degree_discipline":"Computer Science and Engineering","degree_department":null,"school":null,"contributors":["Miguel A. Labrador, Ph.D.","Ken Christensen, Ph.D.","Adriana Iamnitchi, Ph.D."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2006,"date_issued":"2006-03-30T08:00:00Z","date_published":"2006-03-30T08:00:00Z","updated_at":"2026-11-19T08:37:01Z","subjects":["performance evaluation","TCP modeling","congestion window-based protocols","send rate","Markov regenerative processes.","American Studies","Arts and Humanities"],"languages":["EN-US"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usf.edu/etd/3904","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usf.edu/etd/3904","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.usf.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.usf.edu%3Aetd-5100","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Miguel A. Labrador, Ph.D.","Ken Christensen, Ph.D.","Adriana Iamnitchi, Ph.D."]},{"key":"dc:creator","label":"Author","values":["Voicu, Laura M."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2006-03-30T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science and Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis","M.S.Cp.E."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of South Florida"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["performance evaluation","TCP modeling","congestion window-based protocols","send rate","Markov regenerative processes.","American Studies","Arts and Humanities"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["EN-US"]},{"key":"dc:rights.license","label":"Dc Rights License","values":["default"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usf.edu/etd/3904"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Besides the two classical techniques used to evaluate the performance of a protocol, computer simulation and experimental measurements, mathematical modeling has been used to study the performance of the TCP protocol. This technique gives an elegant way to gain insights when studying the behavior of a protocol, while providing useful information about its performance. This thesis presents an analytical model for the SF-SACK protocol, a TCP SACK based protocol conceived to be appropriate for data and streaming applications. SF-Sack modifies the multiplicative part of the Additive Increase Multiplicative Decrease of TCP to provide good performance for data and streaming applications, while avoiding the TCP-friendliness problem of the Internet. The modeling of the SF-SACK protocol raises new challenges compared to the classical TCP modeling in two ways: first, the model needs to be adapted to a more complex dynamism of the congestion window, and second, the model needs to incorporate the scheduler that SF-SACK makes use of in order to maintain a periodically updated value of the congestion window. Presented here is a model that is progressively built in order to consider these challenges. The first step is to consider only losses detected by triple-duplicate acknowledgments, with the restriction that one such loss happens each scheduler interval. The second step is to consider losses detected via triple-duplicate acknowledgments, while eliminating the above restriction. Finally, the third step is to include losses detected via time-outs. The result is an analytical characterization of the steady-state send rate and throughput of a SF-SACK flow as a function of the loss probability, the round-trip time (RTT), the time-out interval, and the scheduler interval. The send rate and the throughput of SF-SACK were compared against available results for TCP Reno. The obtained graphs showed that SF-SACK presents a better performance than TCP. The analytical model of the SF-SACK follows the trends of the results that are presently available, using both the ns-2 simulator and experimental measurements."]},{"key":"dc:title","label":"Title","values":["Modeling the Throughput Performance of the SF-SACK Protocol"]}]}],"canonical_facts":{"dc:contributor":["Miguel A. Labrador, Ph.D.","Ken Christensen, Ph.D.","Adriana Iamnitchi, Ph.D."],"dc:creator":["Voicu, Laura M."],"dc:date":["2006-03-30T08:00:00Z"],"dc:description":["Besides the two classical techniques used to evaluate the performance of a protocol, computer simulation and experimental measurements, mathematical modeling has been used to study the performance of the TCP protocol. This technique gives an elegant way to gain insights when studying the behavior of a protocol, while providing useful information about its performance. This thesis presents an analytical model for the SF-SACK protocol, a TCP SACK based protocol conceived to be appropriate for data and streaming applications. SF-Sack modifies the multiplicative part of the Additive Increase Multiplicative Decrease of TCP to provide good performance for data and streaming applications, while avoiding the TCP-friendliness problem of the Internet. The modeling of the SF-SACK protocol raises new challenges compared to the classical TCP modeling in two ways: first, the model needs to be adapted to a more complex dynamism of the congestion window, and second, the model needs to incorporate the scheduler that SF-SACK makes use of in order to maintain a periodically updated value of the congestion window. Presented here is a model that is progressively built in order to consider these challenges. The first step is to consider only losses detected by triple-duplicate acknowledgments, with the restriction that one such loss happens each scheduler interval. The second step is to consider losses detected via triple-duplicate acknowledgments, while eliminating the above restriction. Finally, the third step is to include losses detected via time-outs. The result is an analytical characterization of the steady-state send rate and throughput of a SF-SACK flow as a function of the loss probability, the round-trip time (RTT), the time-out interval, and the scheduler interval. The send rate and the throughput of SF-SACK were compared against available results for TCP Reno. The obtained graphs showed that SF-SACK presents a better performance than TCP. The analytical model of the SF-SACK follows the trends of the results that are presently available, using both the ns-2 simulator and experimental measurements."],"dc:identifier":["https://digitalcommons.usf.edu/etd/3904"],"dc:language":["EN-US"],"dc:rights.license":["default"],"dc:subject":["performance evaluation","TCP modeling","congestion window-based protocols","send rate","Markov regenerative processes.","American Studies","Arts and Humanities"],"dc:title":["Modeling the Throughput Performance of the SF-SACK Protocol"],"thesis:degree_discipline":["Computer Science and Engineering"],"thesis:degree_level":["Thesis","M.S.Cp.E."],"thesis:institution_name":["University of South Florida"]},"updated_at":"2026-11-19T08:37:01Z"}