A Responsibilitybased Transport Control for Named Data Networking Abstract   Transport Control in Named Data Networking (NDN) architecture is a challenging task. The lack of endtoend communications in this architecture makes traditional, timeoutdriven transport control schemes inefficient and wasteful. Hopbyhop transport control is an alternative solution to tackle this problem that because of the stateful forwarding plan of NDN can be applied more easily than the IP networks. Most existing solutions in this direction assume known link bandwidths and Data packet sizes or require a loopfree multipath forwarding strategy to work well, but these assumptions do not always hold true and there exist no a loopfree multipath forwarding strategy among the existing forwarding strategies for NDN. In this paper, a Responsibilitybased Transport Control (RTC) protocol for NDN is proposed. This protocol does not make strong assumptions about the network and avoids looping paths by applying a windowbased rate control mechanism and a capacityaware, multipath forwarding strategy in each face. In RTC, routers maintain a congestion window in each face and decide on accepting or refusing to take responsibility for forwarding of a newly received Interest packet through exchanging three new control packets. These control packets provide reliable information for managing the congestion windows and capacityaware traffic splitting in routers. They also enable diverse deployment scenarios for NDN such as IPoverly and wireless links. The RTC is implemented in ndnSIM and its capability in managing congestion, achieving high throughput and providing flow fairness are demonstrated through extensive simulations.

Multipath congestion control with network assistance Abstract   The use of multiple transport flows over distinct, if possible, paths, is a wellknown technique for enhancing the performance and stability of data transfer. Multipath TCPxc2xa0(MPTCP), the most popular multipath transport protocol inuse, allows a single receiver to exploit multiple paths from a single sender. Nevertheless, MPTCP cannot fully exploit the potential gains of multipath connectivity, as it must fairly share resources with regular, singlepath TCP, without knowing whether the available paths are distinct or share bottleneck links, due to IPxe2x80x99s design choices. We introduce a hybrid congestion control algorithm for multipath transport that enables higher bandwidth utilization compared to MPTCP, while remaining friendly to TCPlike flows. Our solution employs (i) Normalized Multiflow Congestion Control (NMCC), a novel endtoend congestion control algorithm and (ii) an innetwork module that exposes routing information to the endusers in order to support the greedy friendliness technique. The endtoend NMCC is architectureindependent and can be seamlessly integrated with MPTCP. The innetwork module has been implemented for the PSI InformationCentric Networking architecture, but it can also be integrated with MultiProtocol Label Switching (MPLS) and Software Defined Networking (SDN). Using an actual protocol implementation deployed on our testbed, as well as on a comprehensive packetlevel simulator, we obtain experimental results which demonstrate clear gains for our design in terms of throughput and friendliness to other flows.