TY - GEN
T1 - Scalable, network-assisted congestion control for the MobilityFirst future internet architecture
AU - Su, Kai
AU - Ramakrishnan, K. K.
AU - Raychaudhuri, Dipankar
N1 - Funding Information:
This work is supported in part by the NSF grant FIA-NP award no. CNS-134529 and grant no. CNS-1455815.
Publisher Copyright:
© 2016 IEEE.
PY - 2016/8/22
Y1 - 2016/8/22
N2 - MobilityFirst (MF), as a realization of Information Centric Network architecture, places intelligent functionality, such as storage and reliability, inside the network to assist with data delivery. The MF architecture requires effective congestion and flow control to efficiently support data delivery at scale. Traditional end-to-end, window-based congestion control like that used by TCP is unsuitable as it is unable to take advantage of such in-network functionality. We design network-layer assisted congestion control schemes tailored to MF. One approach that works well for hop-by-hop reliable networks is using per-flow queueing and backpressure to alleviate congestion. However, it could become impractical in the presence of a large number of flows, which leads to substantial memory consumption and computational complexity. Building on a more scalable per-interface queueing model, we design congestion control mechanism that embodies traffic source rate control and explicit congestion notification from routers. Sample results show that the proposed scheme is able to achieve similar link utilization and better fairness compared with a per-flow queueing scheme.
AB - MobilityFirst (MF), as a realization of Information Centric Network architecture, places intelligent functionality, such as storage and reliability, inside the network to assist with data delivery. The MF architecture requires effective congestion and flow control to efficiently support data delivery at scale. Traditional end-to-end, window-based congestion control like that used by TCP is unsuitable as it is unable to take advantage of such in-network functionality. We design network-layer assisted congestion control schemes tailored to MF. One approach that works well for hop-by-hop reliable networks is using per-flow queueing and backpressure to alleviate congestion. However, it could become impractical in the presence of a large number of flows, which leads to substantial memory consumption and computational complexity. Building on a more scalable per-interface queueing model, we design congestion control mechanism that embodies traffic source rate control and explicit congestion notification from routers. Sample results show that the proposed scheme is able to achieve similar link utilization and better fairness compared with a per-flow queueing scheme.
UR - http://www.scopus.com/inward/record.url?scp=84987723117&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84987723117&partnerID=8YFLogxK
U2 - 10.1109/LANMAN.2016.7548871
DO - 10.1109/LANMAN.2016.7548871
M3 - Conference contribution
AN - SCOPUS:84987723117
T3 - IEEE Workshop on Local and Metropolitan Area Networks
BT - IEEE LANMAN 2016 - 22nd IEEE International Symposium on Local and Metropolitan Area Networks
PB - IEEE Computer Society
T2 - 22nd IEEE International Symposium on Local and Metropolitan Area Networks, IEEE LANMAN 2016
Y2 - 13 June 2016 through 15 June 2016
ER -