Please use this identifier to cite or link to this item:
DC FieldValue
dc.titlemem: An architecture to alleviate the memory bottleneck for named data networking
dc.contributor.authorRezazad, M.
dc.contributor.authorTay, Y.C.
dc.identifier.citationRezazad, M., Tay, Y.C. (2013). Ndn. CoNEXT Student Workhop 2013 - Proceedings of the 2013 Workshop : 1-3. ScholarBank@NUS Repository.
dc.description.abstractNamed Data Networking (NDN), as one of the candidates for a future Internet, has the potential to overcome many of the current Internet's difficulties (e.g., security, mobility, multicasting, etc.). However, there are also many open problems to be taken care of before it becomes operational. One of the major concerns is that NDN may be memory-intensive. Using the router's buffer as cache adds a search time to all requests. If the cache hit rate is not high enough (considering current buffer sizes and traffic rates), cache search time may be a burden on the system instead of solving any problems. Huge fast memories are not affordable yet. To balance the memory speed with incoming rate to a router, we propose a memory architecture, called ndn
dc.description.abstractmem, along with a content caching strategy, called CCndn. Using these two ideas, only a small fraction of packets need to engage in a time-intensive cache search process. Simulation results demonstrate the efficacy of our architecture. Copyright 2013 ACM 978-1-4503-2575-2/13/12 ...$15.00.
dc.subjectCache policy
dc.subjectContent networking
dc.subjectMemory architecture
dc.typeConference Paper
dc.description.sourcetitleCoNEXT Student Workhop 2013 - Proceedings of the 2013 Workshop
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.