Fetching Popular Data from the Nearest Replica in NDN

@article{Cao2016FetchingPD,
  title={Fetching Popular Data from the Nearest Replica in NDN},
  author={Jianxun Cao and Dan Pei and Xiaoping Zhang and Beichuan Zhang and Youjian Zhao},
  journal={2016 25th International Conference on Computer Communication and Networks (ICCCN)},
  year={2016},
  pages={1-9}
}
As a novel Internet architecture, Named Data Networking (NDN) shifts the communication model from address-centric to content-centric. An NDN router caches the data in its content store, greatly reducing network traffic. NDN adopts the hierarchical naming schema, which allows the name aggregation and enables high scalability. However, in a richly connected topology, the nearest data replica are often not on the path dictated by NDN's tree-like data fetching model. This might result in a lower… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 23 REFERENCES

Scalable namebased packet forwarding : From millions to billions , ” in Proceedings of the 2 nd International Conference on InformationCentric Networking

  • H. Yuan T. Song, P. Crowley, B. Zhang
  • ACM
  • 2015

Similar Papers

Loading similar papers…