Pub Date : 2012-06-04DOI: 10.1109/IWQoS.2012.6245980
Elisangela Aguiar, Andre Riker, A. Abelém, E. Cerqueira, Mu Mu
As Wireless Mesh Networks (WMNs) have been increasingly deployed, where users can share, create and access videos with different characteristics, the need for new quality estimator mechanisms has become important because operators want to control the quality of video delivery and optimize their network resources, while increasing the user satisfaction. However, the development of in-service Quality of Experience (QoE) estimation schemes for Internet videos (e.g., real-time streaming and gaming) with different complexities, motions, Group of Picture (GoP) sizes and contents remains a significant challenge and is crucial for the success of wireless multimedia systems. To address this challenge, we propose a real-time quality estimator approach, HyQoE, for real-time multimedia applications. The performance evaluation in a WMN scenario demonstrates the high accuracy of HyQoE in estimating the Mean Opinion Score (MOS). Moreover, the results highlight the lack of performance of the well-known objective methods and the Pseudo-Subjective Quality Assessment (PSQA) approach.
{"title":"Video quality estimator for wireless mesh networks","authors":"Elisangela Aguiar, Andre Riker, A. Abelém, E. Cerqueira, Mu Mu","doi":"10.1109/IWQoS.2012.6245980","DOIUrl":"https://doi.org/10.1109/IWQoS.2012.6245980","url":null,"abstract":"As Wireless Mesh Networks (WMNs) have been increasingly deployed, where users can share, create and access videos with different characteristics, the need for new quality estimator mechanisms has become important because operators want to control the quality of video delivery and optimize their network resources, while increasing the user satisfaction. However, the development of in-service Quality of Experience (QoE) estimation schemes for Internet videos (e.g., real-time streaming and gaming) with different complexities, motions, Group of Picture (GoP) sizes and contents remains a significant challenge and is crucial for the success of wireless multimedia systems. To address this challenge, we propose a real-time quality estimator approach, HyQoE, for real-time multimedia applications. The performance evaluation in a WMN scenario demonstrates the high accuracy of HyQoE in estimating the Mean Opinion Score (MOS). Moreover, the results highlight the lack of performance of the well-known objective methods and the Pseudo-Subjective Quality Assessment (PSQA) approach.","PeriodicalId":178333,"journal":{"name":"2012 IEEE 20th International Workshop on Quality of Service","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123692017","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-04DOI: 10.1109/IWQoS.2012.6245971
Shiping Li, Jin Zhao, Xin Wang
Small playback lag in live streaming is important for time-critical and interactive applications such as live stock, market updates, sports and remote education. In this paper, we present Elite addresses the playback lag problem in peer-assisted live streaming systems. Instead of deploying a large initial offset to all the users, Elite seeks the possibility of initializing users with layered proportional initial scheduling point, thus achieving differentiated playback lag service for the system. For saving server bandwidth and reducing lag time, Elite employs a novel strategy which arranges peers into a virtual tree structure and quantifies playback lag of each layer that finally converges to a constant value. This way, Elite can help users to achieve much shorter average playback lag and prioritized service within the same channel. As illustrated in our design, analysis, and simulation studies, Elite is able to fully exploit limited pool of server bandwidth to support peer-assisted live streaming with prioritized playback lag, and achieves shorter average playback lag compared with synchronized strategy, such as R2.
{"title":"Elite: Differentiating the playback lag for peer-assisted live video streaming","authors":"Shiping Li, Jin Zhao, Xin Wang","doi":"10.1109/IWQoS.2012.6245971","DOIUrl":"https://doi.org/10.1109/IWQoS.2012.6245971","url":null,"abstract":"Small playback lag in live streaming is important for time-critical and interactive applications such as live stock, market updates, sports and remote education. In this paper, we present Elite addresses the playback lag problem in peer-assisted live streaming systems. Instead of deploying a large initial offset to all the users, Elite seeks the possibility of initializing users with layered proportional initial scheduling point, thus achieving differentiated playback lag service for the system. For saving server bandwidth and reducing lag time, Elite employs a novel strategy which arranges peers into a virtual tree structure and quantifies playback lag of each layer that finally converges to a constant value. This way, Elite can help users to achieve much shorter average playback lag and prioritized service within the same channel. As illustrated in our design, analysis, and simulation studies, Elite is able to fully exploit limited pool of server bandwidth to support peer-assisted live streaming with prioritized playback lag, and achieves shorter average playback lag compared with synchronized strategy, such as R2.","PeriodicalId":178333,"journal":{"name":"2012 IEEE 20th International Workshop on Quality of Service","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127741818","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-04DOI: 10.1109/IWQoS.2012.6245962
Kai Bu, Xuan Liu, Bin Xiao
Tag cloning attacks threaten a variety of Radio Frequency Identification (RFID) applications but are hard to prevent. To secure RFID applications that confine tagged objects in the same RFID system, this paper studies the cloned-tag identification problem. Although limited existing work has shed some light on the problem, designing fast cloned-tag identification protocols for applications in large-scale RFID systems is yet not thoroughly investigated. To this end, we propose leveraging broadcast and collisions to identify cloned tags. This approach relieves us from resorting to complex cryptography techniques and time-consuming transmission of tag IDs. Based on this approach, we derive a time lower bound on cloned-tag identification and propose a suite of time-efficient protocols toward approaching the time lower bound. The execution time of our protocol is only 1.4 times the value of the time lower bound, being up to 91% less than that of the existing protocol. The proposed protocols may benefit also RFID applications that distribute tagged objects across multiple places.
{"title":"Fast cloned-tag identification protocols for large-scale RFID systems","authors":"Kai Bu, Xuan Liu, Bin Xiao","doi":"10.1109/IWQoS.2012.6245962","DOIUrl":"https://doi.org/10.1109/IWQoS.2012.6245962","url":null,"abstract":"Tag cloning attacks threaten a variety of Radio Frequency Identification (RFID) applications but are hard to prevent. To secure RFID applications that confine tagged objects in the same RFID system, this paper studies the cloned-tag identification problem. Although limited existing work has shed some light on the problem, designing fast cloned-tag identification protocols for applications in large-scale RFID systems is yet not thoroughly investigated. To this end, we propose leveraging broadcast and collisions to identify cloned tags. This approach relieves us from resorting to complex cryptography techniques and time-consuming transmission of tag IDs. Based on this approach, we derive a time lower bound on cloned-tag identification and propose a suite of time-efficient protocols toward approaching the time lower bound. The execution time of our protocol is only 1.4 times the value of the time lower bound, being up to 91% less than that of the existing protocol. The proposed protocols may benefit also RFID applications that distribute tagged objects across multiple places.","PeriodicalId":178333,"journal":{"name":"2012 IEEE 20th International Workshop on Quality of Service","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117103673","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-04DOI: 10.1109/IWQoS.2012.6245969
Pei Huang, Chin-Jung Liu, Li Xiao, Jin Chen
Cognitive radio appears as a promising technology to allocate wireless spectrum between licensed and unlicensed users. Predictive methods for inferring the availability of spectrum holes can help to reduce collision and improve spectrum extraction. This paper introduces a Partial Periodic Pattern Mining (PPPM) algorithm to identify frequent spectrum occupancy patterns that are hidden in the spectrum usage of a channel. The mined frequent patterns are then used to predict future channel states (i.e., busy or idle). PPPM outperforms traditional Frequent Pattern Mining (FPM) by considering real patterns that do not repeat perfectly. Using real life network activities, we show a significant reduction on miss rate in channel state prediction.
{"title":"Mining frequent partial periodic patterns in spectrum usage data","authors":"Pei Huang, Chin-Jung Liu, Li Xiao, Jin Chen","doi":"10.1109/IWQoS.2012.6245969","DOIUrl":"https://doi.org/10.1109/IWQoS.2012.6245969","url":null,"abstract":"Cognitive radio appears as a promising technology to allocate wireless spectrum between licensed and unlicensed users. Predictive methods for inferring the availability of spectrum holes can help to reduce collision and improve spectrum extraction. This paper introduces a Partial Periodic Pattern Mining (PPPM) algorithm to identify frequent spectrum occupancy patterns that are hidden in the spectrum usage of a channel. The mined frequent patterns are then used to predict future channel states (i.e., busy or idle). PPPM outperforms traditional Frequent Pattern Mining (FPM) by considering real patterns that do not repeat perfectly. Using real life network activities, we show a significant reduction on miss rate in channel state prediction.","PeriodicalId":178333,"journal":{"name":"2012 IEEE 20th International Workshop on Quality of Service","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121623366","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-04DOI: 10.1109/IWQOS.2012.6245968
Akihito Hiromori, H. Yamaguchi, T. Higashino
In this paper, we design an efficient method of simulating wireless networks that use CSMA/CA-based protocols in the MAC layer. In the method, a stochastic model to estimate the CSMA/CA frame transmission delay is naturally incorporated into the conventional fully event-based model. The stochastic model can simplify the interactions between a frame transmitter and its surrounding nodes, which alleviates the event scheduling overhead in simulation. The important feature is that the stochastic model can be applied in “per-node” and “time” basis, i.e. we may simulate the behavior of some intended nodes precisely while the others are simplified by the stochastic mode to save computational resources. To the best of our knowledge, this is the first approach to coexistence of the stochastic and event-based models in wireless multi-hop network simulation. We have implemented this scheme in a commercial network simulator and conducted several experiments. From the results, it is confirmed that the proposed method could perform simulation of frame transmission much faster than the fully event-based simulation achieving the same accuracy as the conventional model.
{"title":"Simulating CSMA/CA behavior for performance evaluation of multi-hop wireless networks","authors":"Akihito Hiromori, H. Yamaguchi, T. Higashino","doi":"10.1109/IWQOS.2012.6245968","DOIUrl":"https://doi.org/10.1109/IWQOS.2012.6245968","url":null,"abstract":"In this paper, we design an efficient method of simulating wireless networks that use CSMA/CA-based protocols in the MAC layer. In the method, a stochastic model to estimate the CSMA/CA frame transmission delay is naturally incorporated into the conventional fully event-based model. The stochastic model can simplify the interactions between a frame transmitter and its surrounding nodes, which alleviates the event scheduling overhead in simulation. The important feature is that the stochastic model can be applied in “per-node” and “time” basis, i.e. we may simulate the behavior of some intended nodes precisely while the others are simplified by the stochastic mode to save computational resources. To the best of our knowledge, this is the first approach to coexistence of the stochastic and event-based models in wireless multi-hop network simulation. We have implemented this scheme in a commercial network simulator and conducted several experiments. From the results, it is confirmed that the proposed method could perform simulation of frame transmission much faster than the fully event-based simulation achieving the same accuracy as the conventional model.","PeriodicalId":178333,"journal":{"name":"2012 IEEE 20th International Workshop on Quality of Service","volume":"229 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131544204","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-04DOI: 10.1109/IWQoS.2012.6245988
Jinho Hwang, Timothy Wood
Virtual Desktop Infrastructures (VDIs) are gaining popularity in cloud computing by allowing companies to deploy their office environments in a virtualized setting instead of relying on physical desktop machines. Consolidating many users into a VDI environment can significantly lower IT management expenses and enables new features such as “available-anywhere” desktops. However, barriers to broad adoption include the slow performance of virtualized I/O, CPU scheduling interference problems, and shared-cache contention. In this paper, we propose a new soft real-time scheduling algorithm that employs flexible priority designations (via utility functions) and automated scheduler class detection (via hypervisor monitoring of user behavior) to provide a higher quality user experience. We have implemented our scheduler within the Xen virtualization platform, and demonstrate that the overheads incurred from co-locating large numbers of virtual machines can be reduced from 66% with existing schedulers to under 2% in our system. We evaluate the benefits and overheads of using a smaller scheduling time quantum in a VDI setting, and show that the average overhead time per scheduler call is on the same order as the existing SEDF and Credit schedulers.
{"title":"Adaptive dynamic priority scheduling for virtual desktop infrastructures","authors":"Jinho Hwang, Timothy Wood","doi":"10.1109/IWQoS.2012.6245988","DOIUrl":"https://doi.org/10.1109/IWQoS.2012.6245988","url":null,"abstract":"Virtual Desktop Infrastructures (VDIs) are gaining popularity in cloud computing by allowing companies to deploy their office environments in a virtualized setting instead of relying on physical desktop machines. Consolidating many users into a VDI environment can significantly lower IT management expenses and enables new features such as “available-anywhere” desktops. However, barriers to broad adoption include the slow performance of virtualized I/O, CPU scheduling interference problems, and shared-cache contention. In this paper, we propose a new soft real-time scheduling algorithm that employs flexible priority designations (via utility functions) and automated scheduler class detection (via hypervisor monitoring of user behavior) to provide a higher quality user experience. We have implemented our scheduler within the Xen virtualization platform, and demonstrate that the overheads incurred from co-locating large numbers of virtual machines can be reduced from 66% with existing schedulers to under 2% in our system. We evaluate the benefits and overheads of using a smaller scheduling time quantum in a VDI setting, and show that the average overhead time per scheduler call is on the same order as the existing SEDF and Credit schedulers.","PeriodicalId":178333,"journal":{"name":"2012 IEEE 20th International Workshop on Quality of Service","volume":"39 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123522959","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-04DOI: 10.1109/IWQoS.2012.6245986
Emanuel Heidinger, Nils Kammenhuber, A. Klein, G. Carle
This work addresses the applicability of a switched queuing network as the sole communication network in an aircraft cabin, and proposes an algorithm based on a mixed-integer program to determine hard bounds for the end-to-end delay. These hard bounds guarantee mandatory performance bounds for safety-relevant functions in the aircraft cabin, such as audio announcements or smoke detection. Techniques from the field of deterministic Network Calculus are used to benchmark the results from our novel approach. The results show that our solution allows improved mapping of non-preemptive queuing networks, compared to relevant state-of-the-art approaches.
{"title":"Network Calculus and mixed-integer LP applied to a switched aircraft cabin network","authors":"Emanuel Heidinger, Nils Kammenhuber, A. Klein, G. Carle","doi":"10.1109/IWQoS.2012.6245986","DOIUrl":"https://doi.org/10.1109/IWQoS.2012.6245986","url":null,"abstract":"This work addresses the applicability of a switched queuing network as the sole communication network in an aircraft cabin, and proposes an algorithm based on a mixed-integer program to determine hard bounds for the end-to-end delay. These hard bounds guarantee mandatory performance bounds for safety-relevant functions in the aircraft cabin, such as audio announcements or smoke detection. Techniques from the field of deterministic Network Calculus are used to benchmark the results from our novel approach. The results show that our solution allows improved mapping of non-preemptive queuing networks, compared to relevant state-of-the-art approaches.","PeriodicalId":178333,"journal":{"name":"2012 IEEE 20th International Workshop on Quality of Service","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123857437","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-04DOI: 10.1109/IWQoS.2012.6245992
Qing Li, Mingwei Xu, Meng Chen
The Internet is facing severe routing scalability problem. The Internet Service Providers cannot afford to upgrade their routers at the pace of routing table growth. Therefore, FIB aggregation has been proposed. However, current single-nexthop FIB aggregation solutions cannot provide a satisfactory performance. In this paper, we first propose the next hop of strict partial order (SPO next hop) to construct the Nexthop-Selectable FIB (NSFIB). The approach guarantees that NSFIB-based aggregation performs better than single-nexthop FIB aggregation, especially in larger and denser backbone networks. We then provide the NSFIB-based aggregation algorithms. According to our simulation, our algorithms can shrink the FIB to 5% and the aggregation performance does not degrade when the network density increases, both of which are a great improvement overhead single-nexthop FIB aggregation.
{"title":"Next hop of strict partial order for NSFIB construction & aggregation","authors":"Qing Li, Mingwei Xu, Meng Chen","doi":"10.1109/IWQoS.2012.6245992","DOIUrl":"https://doi.org/10.1109/IWQoS.2012.6245992","url":null,"abstract":"The Internet is facing severe routing scalability problem. The Internet Service Providers cannot afford to upgrade their routers at the pace of routing table growth. Therefore, FIB aggregation has been proposed. However, current single-nexthop FIB aggregation solutions cannot provide a satisfactory performance. In this paper, we first propose the next hop of strict partial order (SPO next hop) to construct the Nexthop-Selectable FIB (NSFIB). The approach guarantees that NSFIB-based aggregation performs better than single-nexthop FIB aggregation, especially in larger and denser backbone networks. We then provide the NSFIB-based aggregation algorithms. According to our simulation, our algorithms can shrink the FIB to 5% and the aggregation performance does not degrade when the network density increases, both of which are a great improvement overhead single-nexthop FIB aggregation.","PeriodicalId":178333,"journal":{"name":"2012 IEEE 20th International Workshop on Quality of Service","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116224639","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-04DOI: 10.1109/IWQoS.2012.6245975
R. Shea, Jiangchuan Liu
Virtualization, which allows multiple Virtual Machines (VMs) to reside on a single physical machine, has become an indispensable technology for today's IT infrastructure. It is known that the overhead for virtualization affects system performance; yet it remains largely unknown whether VMs are more vulnerable to networked Denial of Service (DoS) attacks than conventional physical machines. A clear understanding here is obviously critical to such networked virtualization system as cloud computing platforms. In this paper, we present an initial study on the performance of modern virtualization solutions under DoS attacks. We experiment with the full spectrum of modern virtualization techniques, from paravirtualization, hardware virtualization, to container virtualization, with a comprehensive set of benchmarks. Our results reveal severe vulnerability of modern virtualization: even with relatively light attacks, the file system and memory access performance of VMs degrades at a much higher rate than their non-virtualized counterparts, and this is particularly true for hypervisor-based solutions. We further examine the root causes, with the goal of enhancing the robustness and security of these virtualization systems. Inspired by the findings, we implement a practical modification to the VirtIO drivers in the Linux KVM package, which effectively mitigates the overhead of a DoS attack by up to 40%.
{"title":"Understanding the impact of Denial of Service attacks on Virtual Machines","authors":"R. Shea, Jiangchuan Liu","doi":"10.1109/IWQoS.2012.6245975","DOIUrl":"https://doi.org/10.1109/IWQoS.2012.6245975","url":null,"abstract":"Virtualization, which allows multiple Virtual Machines (VMs) to reside on a single physical machine, has become an indispensable technology for today's IT infrastructure. It is known that the overhead for virtualization affects system performance; yet it remains largely unknown whether VMs are more vulnerable to networked Denial of Service (DoS) attacks than conventional physical machines. A clear understanding here is obviously critical to such networked virtualization system as cloud computing platforms. In this paper, we present an initial study on the performance of modern virtualization solutions under DoS attacks. We experiment with the full spectrum of modern virtualization techniques, from paravirtualization, hardware virtualization, to container virtualization, with a comprehensive set of benchmarks. Our results reveal severe vulnerability of modern virtualization: even with relatively light attacks, the file system and memory access performance of VMs degrades at a much higher rate than their non-virtualized counterparts, and this is particularly true for hypervisor-based solutions. We further examine the root causes, with the goal of enhancing the robustness and security of these virtualization systems. Inspired by the findings, we implement a practical modification to the VirtIO drivers in the Linux KVM package, which effectively mitigates the overhead of a DoS attack by up to 40%.","PeriodicalId":178333,"journal":{"name":"2012 IEEE 20th International Workshop on Quality of Service","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121978160","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-04DOI: 10.1109/IWQoS.2012.6245973
B. Liu, Bo Yuan, Huichen Dai, Hongbo Zhao, Jia Yu, L. Bhuyan
Traditional network processors (NPs) adopt pull model, where NP cores pull packet data from external memory to local memory, triggered by cache miss or fetch instructions. Due to the long latency of data fetching, hardware multithreading is typically used to reduce the waiting time. Multithreading incurs context switch overhead, leading to inefficiency in payload processing applications. We propose a push model for future NP's architectural design to increase throughput and decrease processing delay. A hardware push unit helps to move the segments of a packet to a core's local memory to reduce hardware thread switching. Theoretical analyses are given to compare the pull and push model's performance. Further, we selected our FPGA based THNPU NP platform for verification. Experimental results indicate that the push model not only improves the system throughput, but also reduces the delay, with only a fraction of logic gate increase.
{"title":"Improving the throughput and delay performance of network processors by applying push model","authors":"B. Liu, Bo Yuan, Huichen Dai, Hongbo Zhao, Jia Yu, L. Bhuyan","doi":"10.1109/IWQoS.2012.6245973","DOIUrl":"https://doi.org/10.1109/IWQoS.2012.6245973","url":null,"abstract":"Traditional network processors (NPs) adopt pull model, where NP cores pull packet data from external memory to local memory, triggered by cache miss or fetch instructions. Due to the long latency of data fetching, hardware multithreading is typically used to reduce the waiting time. Multithreading incurs context switch overhead, leading to inefficiency in payload processing applications. We propose a push model for future NP's architectural design to increase throughput and decrease processing delay. A hardware push unit helps to move the segments of a packet to a core's local memory to reduce hardware thread switching. Theoretical analyses are given to compare the pull and push model's performance. Further, we selected our FPGA based THNPU NP platform for verification. Experimental results indicate that the push model not only improves the system throughput, but also reduces the delay, with only a fraction of logic gate increase.","PeriodicalId":178333,"journal":{"name":"2012 IEEE 20th International Workshop on Quality of Service","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132017803","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：