Files in this item



application/pdfcleanSlateProtocol.pdf (157kB)
A Border Routing & Transport ProtocolPDF


Title:BRTP: Border Routing & Transport Protocol
Author(s):Fesehaye, Debessay
Contributor(s):Nahrstedt, Klara
Subject(s):Congestion control, border routing, clean slate protocol, fairness
Abstract:Any network communication system involves finding a path (routing) and controlling the rate (transport) of communication. Existing routing techniques lack an efficient routing metric which reflects the up-to-date status of the network. Existing transport protocols (TCP) lack the good and up-to-date knowledge of the rate of communication. Cleverly aggregated information from the border routers (ingress and egress) gives enough information about the up-to-date load condition of the core routers. A Border Routing & Transport Protocol (BRTP) server system which has the aggregated information can then compute the best ingress-egress (in-eg) path and rate. The rate of the flows in one in-eg path is then obtained by sharing the ''capacity” (rate) of the in-eg path obtained by the BRTP fairly or proportionally. The final rate at which a flow sends data is then the minimum of the rates (bottleneck rate) it obtains from all in-eg pairs in its path to the destination. This can be done by adding a shim layer to the TCP header of packets which can be overwritten by ingress routers in the path.
Issue Date:2010-08-24
Genre:Presentation / Lecture / Speech
Publication Status:unpublished
Peer Reviewed:not peer reviewed
Date Available in IDEALS:2010-08-24

This item appears in the following Collection(s)

Item Statistics