Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
IEEE/ACM Transactions on Networking (TON)
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Size-based scheduling to improve web performance
ACM Transactions on Computer Systems (TOCS)
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Lifetime packet discard for efficient real-time transport over cellular links
ACM SIGMOBILE Mobile Computing and Communications Review
Rate control protocol (rcp): congestion control to make flows complete quickly
Rate control protocol (rcp): congestion control to make flows complete quickly
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Netalyzr: illuminating the edge network
IMC '10 Proceedings of the 10th ACM SIGCOMM conference on Internet measurement
On content-centric router design and implications
Proceedings of the Re-Architecting the Internet Workshop
Joint hop-by-hop and receiver-driven interest control protocol for content-centric networks
Proceedings of the second edition of the ICN workshop on Information-centric networking
Reducing server and network load with shared buffering
Proceedings of the 2012 ACM workshop on Capacity sharing
| Hi-index | 0.00 |
Unlike in traditional IP-based end-to-end network sessions, in information-centric networks the data source may change during a communication session. Therefore the response time to subsequent data requests may vary significantly depending on whether data comes from nearby cache, or a distant source. This is a complication for designing resource management, reliability and other algorithms, that traditionally use RTT measurements for determining when data is considered lost and should be retransmitted (along with related congestion control adjustments). This paper discusses a different approach for designing resource management in information-centric networks: data packets are assigned with a lifetime, that is used as a basis for scheduling and resource management in the network, and for congestion control and retransmission logic at the end hosts. We demonstrate an initial evaluation of this approach based on ns-3 simulations on CCN framework.