{"id":{"repo_id":"calgary","oai_identifier":"oai:ucalgary.scholaris.ca:1880/119209"},"canonical_url":"https://search.dev.ndltd.org/etd/calgary/oai:ucalgary.scholaris.ca:1880/119209","repository":{"repo_id":"calgary","name":"University of Calgary","base_url":"https://ucalgary.scholaris.ca/server/oai/request"},"display":{"title":"Opportunistic Packet Forwarding for Proactive Transport in Datacenters","abstract":"Proactive transport protocols in datacenters are designed to avoid congestion by regulating flow sending rates via credit allocation. However, when a new flow starts, it takes one Round-Trip Time (RTT) before credits can be assigned to the new flow. To avoid stalling flows, modern proactive protocols allow a new flow to blast a burst of unscheduled packets at line rate during the pre-credit phase. However, sending too many unscheduled packets could cause temporary traffic spikes that lead to queue build-ups, packet losses, and retransmissions, which are particularly detrimental to short flows. In this thesis, we present the design and evaluation of Opportunistic Packet Forwarding (OPF), a building block for proactive transports designed to minimize pre-credit packet losses with negligible overhead on network switches. The key idea in OPF is to allow pre-credit packets to opportunistically take detours to avoid congested links on the shortest paths, effectively trading off packet losses for slightly increased delay. We have implemented OPF using P4 switches and integrated our implementation with Homa and NDP. Our results on a range of traffic loads show significant improvement in the 99-th percentile of flow completion time for short flows, namely, up to 60% reduction in NDP and 50% in Homa.","abstract_html":"Proactive transport protocols in datacenters are designed to avoid congestion by regulating flow sending rates via credit allocation. However, when a new flow starts, it takes one Round-Trip Time (RTT) before credits can be assigned to the new flow. To avoid stalling flows, modern proactive protocols allow a new flow to blast a burst of unscheduled packets at line rate during the pre-credit phase. However, sending too many unscheduled packets could cause temporary traffic spikes that lead to queue build-ups, packet losses, and retransmissions, which are particularly detrimental to short flows. In this thesis, we present the design and evaluation of Opportunistic Packet Forwarding (OPF), a building block for proactive transports designed to minimize pre-credit packet losses with negligible overhead on network switches. The key idea in OPF is to allow pre-credit packets to opportunistically take detours to avoid congested links on the shortest paths, effectively trading off packet losses for slightly increased delay. We have implemented OPF using P4 switches and integrated our implementation with Homa and NDP. Our results on a range of traffic loads show significant improvement in the 99-th percentile of flow completion time for short flows, namely, up to 60% reduction in NDP and 50% in Homa.","abstract_has_math":false,"creators":["Shani, Amir"],"institution":"Graduate Studies","degree_name":"Master of Science (MSc)","degree_level":null,"degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":["Ghaderi, Majid"],"committee_chairs":[],"committee_members":["Krishnamurthy, Diwakar","Ye, Qiang"],"year":2024,"date_issued":"2024-07-16","date_published":"2024-07-16","updated_at":"2026-07-24T01:30:33Z","subjects":["Software-Defined Networking","Programmable Switches","Datacenter Networks"],"languages":["en"],"rights":["University of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission."],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.11575/PRISM/46805"],"render_values":[{"text":"https://doi.org/10.11575/PRISM/46805","href":"https://doi.org/10.11575/PRISM/46805","code":true}]}]},"links":{"outbound_url":"https://hdl.handle.net/1880/119209","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Ghaderi, Majid"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Krishnamurthy, Diwakar","Ye, Qiang"]},{"key":"dc:creator","label":"Author","values":["Shani, Amir"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2024-07-18T16:37:57Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2024-07-18T16:37:57Z"]},{"key":"dc:date.issued","label":"Date","values":["2024-07-16"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Calgary"]},{"key":"dc:type","label":"Dc Type","values":["master thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MSc)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Calgary"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Software-Defined Networking","Programmable Switches","Datacenter Networks"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["University of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.11575/PRISM/46805"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1880/119209"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Proactive transport protocols in datacenters are designed to avoid congestion by regulating flow sending rates via credit allocation. However, when a new flow starts, it takes one Round-Trip Time (RTT) before credits can be assigned to the new flow. To avoid stalling flows, modern proactive protocols allow a new flow to blast a burst of unscheduled packets at line rate during the pre-credit phase. However, sending too many unscheduled packets could cause temporary traffic spikes that lead to queue build-ups, packet losses, and retransmissions, which are particularly detrimental to short flows. In this thesis, we present the design and evaluation of Opportunistic Packet Forwarding (OPF), a building block for proactive transports designed to minimize pre-credit packet losses with negligible overhead on network switches. The key idea in OPF is to allow pre-credit packets to opportunistically take detours to avoid congested links on the shortest paths, effectively trading off packet losses for slightly increased delay. We have implemented OPF using P4 switches and integrated our implementation with Homa and NDP. Our results on a range of traffic loads show significant improvement in the 99-th percentile of flow completion time for short flows, namely, up to 60% reduction in NDP and 50% in Homa."]},{"key":"dc:title","label":"Title","values":["Opportunistic Packet Forwarding for Proactive Transport in Datacenters"]}]}],"canonical_facts":{"dc:contributor.advisor":["Ghaderi, Majid"],"dc:contributor.committeemember":["Krishnamurthy, Diwakar","Ye, Qiang"],"dc:creator":["Shani, Amir"],"dc:date.accessioned":["2024-07-18T16:37:57Z"],"dc:date.available":["2024-07-18T16:37:57Z"],"dc:date.issued":["2024-07-16"],"dc:description.abstract":["Proactive transport protocols in datacenters are designed to avoid congestion by regulating flow sending rates via credit allocation. However, when a new flow starts, it takes one Round-Trip Time (RTT) before credits can be assigned to the new flow. To avoid stalling flows, modern proactive protocols allow a new flow to blast a burst of unscheduled packets at line rate during the pre-credit phase. However, sending too many unscheduled packets could cause temporary traffic spikes that lead to queue build-ups, packet losses, and retransmissions, which are particularly detrimental to short flows. In this thesis, we present the design and evaluation of Opportunistic Packet Forwarding (OPF), a building block for proactive transports designed to minimize pre-credit packet losses with negligible overhead on network switches. The key idea in OPF is to allow pre-credit packets to opportunistically take detours to avoid congested links on the shortest paths, effectively trading off packet losses for slightly increased delay. We have implemented OPF using P4 switches and integrated our implementation with Homa and NDP. Our results on a range of traffic loads show significant improvement in the 99-th percentile of flow completion time for short flows, namely, up to 60% reduction in NDP and 50% in Homa."],"dc:identifier.doi":["https://doi.org/10.11575/PRISM/46805"],"dc:identifier.uri":["https://hdl.handle.net/1880/119209"],"dc:language.iso":["en"],"dc:publisher.institution":["University of Calgary"],"dc:rights":["University of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission."],"dc:subject":["Software-Defined Networking","Programmable Switches","Datacenter Networks"],"dc:title":["Opportunistic Packet Forwarding for Proactive Transport in Datacenters"],"dc:type":["master thesis"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_name":["Master of Science (MSc)"],"thesis:institution_name":["University of Calgary"]},"updated_at":"2026-07-24T01:30:33Z"}