Towards line speed and accurateness on-line content popularity monitoring on Content Centric Networking(CCN) routers, we propose a three-stage scheme based on Bloom filters and hash tables for differentiated traffic. ...Towards line speed and accurateness on-line content popularity monitoring on Content Centric Networking(CCN) routers, we propose a three-stage scheme based on Bloom filters and hash tables for differentiated traffic. At the first stage, we decide whether to deliver the content to the next stage depending on traffic types. The second stage consisting of Standard Bloom filters(SBF) and Counting Bloom filters(CBF) identifies the popular content. Meanwhile, a scalable sliding time window based monitoring scheme for different traffic types is proposed to implement frequent and real-time updates by the change of popularities. Hash tables according with sliding window are used to record the popularity at the third stage. Simulation results reveal that this method reaches a 40 Gbps processing speed at lower error probability with less memory, and it is more sensitive to the change of popularity. Additionally, the architecture which can be implemented in CCN router is flexible and scalable.展开更多
Tables should each be presented in portrait （ not landscape） orientation and upright on the page, not sideways. Each table has a short, one-line title in bold text. Tables should be as small as possible. Symbols and...Tables should each be presented in portrait （ not landscape） orientation and upright on the page, not sideways. Each table has a short, one-line title in bold text. Tables should be as small as possible. Symbols and abbreviations are defined immediately below the table, followed by essential descriptive material as briefly as possible.展开更多
By thorough research on the prominent periodic and aperiodic scheduling algorithms,anon-line hard real-time scheduler is presented,which is applicable to the scheduling of packets over a link.This scheduler,based on b...By thorough research on the prominent periodic and aperiodic scheduling algorithms,anon-line hard real-time scheduler is presented,which is applicable to the scheduling of packets over a link.This scheduler,based on both Rate Monotonic,pinwheel scheduling algorithm Sr and Polling Serverscheduling algorithms,can rapidly judge the schedulability and then automatically generate a bus tablefor the scheduling algorithm to schedule the packets as the periodic packets.The implementation of thescheduler is simple and easy to use,and it is effective for the utilization of bus link.The orderly executionof the bus table can not only guarantee the performance of the hard real time but also avoid the blockageand interruption of the message transmission.So the scheduler perfectly meets the demand of hard real-time communication system on the field bus domain.展开更多
基金supported by the Foundation for Innovative Research Groups of the National Natural Science Foundation of China (Grant No.61521003)the National Basic Research Program of China (2012CB315901, 2013CB329104)+1 种基金the National Natural Science Foundation of China (Grant No. 61372121, 61309019, 61309020)the National HighTech Research & Development Program of China (Grant No. 2015AA016102, 2013AA013505)
文摘Towards line speed and accurateness on-line content popularity monitoring on Content Centric Networking(CCN) routers, we propose a three-stage scheme based on Bloom filters and hash tables for differentiated traffic. At the first stage, we decide whether to deliver the content to the next stage depending on traffic types. The second stage consisting of Standard Bloom filters(SBF) and Counting Bloom filters(CBF) identifies the popular content. Meanwhile, a scalable sliding time window based monitoring scheme for different traffic types is proposed to implement frequent and real-time updates by the change of popularities. Hash tables according with sliding window are used to record the popularity at the third stage. Simulation results reveal that this method reaches a 40 Gbps processing speed at lower error probability with less memory, and it is more sensitive to the change of popularity. Additionally, the architecture which can be implemented in CCN router is flexible and scalable.
文摘Tables should each be presented in portrait （ not landscape） orientation and upright on the page, not sideways. Each table has a short, one-line title in bold text. Tables should be as small as possible. Symbols and abbreviations are defined immediately below the table, followed by essential descriptive material as briefly as possible.
基金Supported by the Emphases Science and Technology Project Foundation of Sichuan Province(NO.02GG006-037)
文摘By thorough research on the prominent periodic and aperiodic scheduling algorithms,anon-line hard real-time scheduler is presented,which is applicable to the scheduling of packets over a link.This scheduler,based on both Rate Monotonic,pinwheel scheduling algorithm Sr and Polling Serverscheduling algorithms,can rapidly judge the schedulability and then automatically generate a bus tablefor the scheduling algorithm to schedule the packets as the periodic packets.The implementation of thescheduler is simple and easy to use,and it is effective for the utilization of bus link.The orderly executionof the bus table can not only guarantee the performance of the hard real time but also avoid the blockageand interruption of the message transmission.So the scheduler perfectly meets the demand of hard real-time communication system on the field bus domain.
基金Project(51778540)supported by the National Natural Science Foundation of ChinaProject(2019YFC0605104)supported by the National Key R&D Program of China。
