{"title":"Performance of secure SIP and LoST signaling in a Next Generation 9–1–1 testbed","authors":"U. Desai, S. Alagesan, Anna Goulart, W. Magnussen","doi":"10.1109/CQR.2012.6267108","DOIUrl":"https://doi.org/10.1109/CQR.2012.6267108","url":null,"abstract":"Security is an important concern in Voice over IP (VoIP) applications. An approach to securing the signaling, such as the Session Initiation Protocol (SIP) and Location to Service Translation (LoST) messages, is to use Transport Layer Security (TLS). Several studies have measured the impact of using TLS on SIP. However, there have not been any tests on the impact of TLS or Internet Protocol Security (IPSec) on IP-based emergency calls or Next Generation 9-1-1 (NG-9-1-1). In this paper, we address the practical issues in establishing a secure framework for NG-9-1-1 with performance metrics such as call setup and server processing delays.","PeriodicalId":394442,"journal":{"name":"2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121527439","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}
{"title":"Joint encryption error correction and modulation (JEEM) scheme","authors":"O. Adamo, E. Ayeh, M. Varanasi","doi":"10.1109/CQR.2012.6267103","DOIUrl":"https://doi.org/10.1109/CQR.2012.6267103","url":null,"abstract":"The major challenges facing resource constrained wireless devices are error resilience, security, and speed. In order to address these challenges, we present a physical layer encryption scheme that is capable of providing data reliability, secrecy and integrity. In addition, the scheme is also able to modulate the data. We construct joint encryption, error correction and modulation scheme to facilitate secure, reliable and efficient data transmission. This scheme is based on McEliece public key cryptosystem.","PeriodicalId":394442,"journal":{"name":"2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132541364","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}
{"title":"Evaluation and improvement of end-to-end bandwidth measurement method for power-saving routers","authors":"D. Kobayashi, G. Hasegawa, M. Murata","doi":"10.1109/CQR.2012.6267095","DOIUrl":"https://doi.org/10.1109/CQR.2012.6267095","url":null,"abstract":"The increase in energy consumption associated with ever-intensifying network traffic is becoming a major problem. A number of researchers have focused on technologies that dynamically adjust the processing performance and the link speed of routers according to the network traffic load in order to achieve energy-efficient networking. However, when such power-saving routers are present in an end-to-end network path, the accuracy of existing methods for measuring the end-to-end available bandwidth may degrade because of the variable bandwidth and delays at bottleneck links. Furthermore, the energy efficiency of power-saving routers also decreases under the additional traffic load caused by bandwidth probing. In this paper, we employ a network environment with a power-saving router to evaluate the performance of Pathload, which is a popular tool for measuring the end-to-end available bandwidth. By showing detailed simulation results, we demonstrate that both the measurement accuracy of Pathload and the energy efficiency of routers degrade, particularly when the power saving function of routers is triggered in shorter cycles. We also propose Pathload parameter settings that maintain measurement accuracy without affecting the behavior of power-saving routers.","PeriodicalId":394442,"journal":{"name":"2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130205940","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}
S. Taniguchi, R. Kawate, K. Sato, E. Horiuchi, T. Yokotani
{"title":"Performance evaluation of the simplified WFQ to multiplex a huge number of queues","authors":"S. Taniguchi, R. Kawate, K. Sato, E. Horiuchi, T. Yokotani","doi":"10.1109/CQR.2012.6267099","DOIUrl":"https://doi.org/10.1109/CQR.2012.6267099","url":null,"abstract":"Weighted Fair Queuing (WFQ) is a packet scheduling technique allowing guaranteed bandwidth services. However, it is very difficult to implement the WFQ for a lot of queues, because the amount of required calculations for WFQ is proportional to the number of queues. Therefore we proposed the simplified WFQ (SWFQ) mechanism which can support a huge number of queues with guaranteeing the provisioned bandwidth for each queue while it requires fewer amounts of calculations by using approximation techniques. To compare the details of SWFQ and WFQ, a series of simulations are conducted. The result of the simulation shows that SWFQ can guarantee the bandwidth for each queue as same as WFQ and also shows that the difference between WFQ and SWFQ can be negligible when the granularity of the quantization for an approximation is sufficiently fine. In conclusion, these results clarify that SWFQ is an effective mechanism which can provide the same characteristics as WFQ.","PeriodicalId":394442,"journal":{"name":"2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130598396","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}
Pingguo Huang, Y. Ishibashi, N. Fukushima, S. Sugawara
{"title":"QoE assessment of olfactory media in remote ikebana with haptic media","authors":"Pingguo Huang, Y. Ishibashi, N. Fukushima, S. Sugawara","doi":"10.1109/CQR.2012.6267110","DOIUrl":"https://doi.org/10.1109/CQR.2012.6267110","url":null,"abstract":"In this paper, we handle a remote ikebana (i.e., flower arrangement) system with olfactory and haptic media. In the system, a teacher or a student can hold a flower, adjust the length of the held flower's stem with a pair of scissors, and impale the flower on a flower pinholder in a 3-D virtual space. We make QoE (Quality of Experience) assessment of olfactory media to investigate the influence of the output timing of olfactory media by changing the size of smell space (defined as a sphere in which we can perceive the smell of flower). In the assessment, each subject is asked to move a rose toward or away from his/her viewpoint, and he/she judges how good the output timing of olfactory media is. We illustrate that there exists the optimum value of the smell space size, and the optimum value depends on the average movement speed and the direction of movement.","PeriodicalId":394442,"journal":{"name":"2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"190 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116142179","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}
{"title":"Assignment strategy mechanism for heterogeneous types of mobile users and access points","authors":"T. Kimura, T. Murase, T. Okuda","doi":"10.1109/CQR.2012.6267107","DOIUrl":"https://doi.org/10.1109/CQR.2012.6267107","url":null,"abstract":"This paper discusses a various customer heterogeneous server (VCHS) queuing system strategy for the optimal assignment of mobile users to wireless LAN access points (APs) to optimize user quality of service (QoS). The users and APs have heterogeneous types of service requests and services, such as types of service providers, respectively. It is assumed that users arrive in a stochastic manner and that the proportions of user traffic volumes to each service request are provided. The user only connects to an AP that matches the service with the user request. Then, the user leaves after downloading a specific volume of data. A “group” assignment strategy is proposed to match the service resources to the service request demands. The strategy includes how to make a group from a number of APs proportional to the volume of user traffic to each service request. The evaluations show that the “group” assignment strategy is significantly better than a “random” assignment strategy in terms of mean waiting time. The proposed strategy reduces the mean waiting time by 25%, with more significant decreases as the number of APs with more types of services increases.","PeriodicalId":394442,"journal":{"name":"2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133423062","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}
{"title":"On an efficient computational resource scheduling for prioritized multiple target contents searching in large-scale networks","authors":"C. Miura, S. Sugawara, Y. Ishibashi","doi":"10.1109/CQR.2012.6267112","DOIUrl":"https://doi.org/10.1109/CQR.2012.6267112","url":null,"abstract":"This paper proposes an efficient scheme of computational resource scheduling for target contents searching in large-scale networks, in the case where a user requests prioritized multiple content items. In this scheme, a limited number of available resources are selected for the searching taking account of a content's existence probability, processing capacity, bandwidth and so on, and assigned to each information source to be searched. Computer simulations evaluate the effectiveness of the scheme, and the results show that the scheme achieves lower searching cost, which is calculated taking into account searching priority, than any other schemes for comparison, especially in the case of a lot of searching requests at the same time.","PeriodicalId":394442,"journal":{"name":"2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121516996","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}
{"title":"Evaluation for cost-effective cache deployment in ISP networks","authors":"M. Shibuya, Y. Hei, T. Ogishi","doi":"10.1109/CQR.2012.6267100","DOIUrl":"https://doi.org/10.1109/CQR.2012.6267100","url":null,"abstract":"Internet traffic for video content delivery has grown rapidly because consumer-generated media has been shared throughout the world and the number of contents has increased tremendously. In response to this, ISPs have faced to the issue that how to deliver the massive contents with low cost and without losing network quality. The issue is significant for the ISPs providing Internet access service at a flat fee. One of the solutions to the problem is to cache contents on the servers located in ISP networks. The cache technology itself was developed from ten-odd years ago and several research works were done according to the traffic model in those days. However, most of works focused on the traffic between network providers; i.e. the traffic of inter-domain links. Although ISPs has the issue to reduce intra-domain links as well as inter-domain links, previous works have not answered the question that where cache servers should be located in ISP networks. In this paper, we analyzed the traffic in ISP networks with various conditions on the deployment of cache servers. The simulation considered the network topology including core and access networks, the disk capacity of cache servers and users' access model for requesting contents considering the unbalanced distribution of the populations on geographic locations. As one of results, we found that the traffic of the heaviest used link when the cache servers were deployed on the core network in city area was reduced 38.89% by the ratio of cache server disk size was 1 comparing to the case that the ratio of the cache server disk size was 4.","PeriodicalId":394442,"journal":{"name":"2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125279435","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}
{"title":"Performance study of hybrid DS/FFH spread-spectrum systems in the presence of frequency-selective fading and multiple-access interference","authors":"M. Olama, S. Smith, T. Kuruganti, Xiao Ma","doi":"10.1109/CQR.2012.6267102","DOIUrl":"https://doi.org/10.1109/CQR.2012.6267102","url":null,"abstract":"Hybrid spread-spectrum (HSS) systems have recently received considerable interest in commercial, Smart Grid, and military communication systems because they accommodate high data rates with high link integrity, even in the presence of significant multipath effects and interfering signals. A highly useful form of this modulation scheme is the specific code-related combination of standard direct-sequence spread spectrum (DSSS) with fast frequency-hopping (FFH) spread spectrum, denoted hybrid DS/FFH, wherein multiple frequency hops occur within a single data-bit time. In this paper we perform a simulation-based study of the DS/FFH performance as compared to the existing standard DSSS and FHSS wireless networks. The performance metrics are biterror probability and multiple-access capability. The parameter space of DS/FFH, including the DS spreading rate, frequency hopping rate, carrier frequencies, and numbers of users, is explored to show its performance under frequency-selective Rayleigh fading environments and multiuser interference. Direct digital synthesizers to achieve fast hopping speeds are also considered in our study.","PeriodicalId":394442,"journal":{"name":"2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129900816","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}
{"title":"Traffic classification and observer design of cable networks","authors":"Haihong Gao, T. Best, R. Pendse, M. E. Sawan","doi":"10.1109/CQR.2012.6267105","DOIUrl":"https://doi.org/10.1109/CQR.2012.6267105","url":null,"abstract":"Our previous work suggests that the current congestion controls for cable networks are inadequate when network participants act strategically. A feedback control could result in greater utilization and fairness of cable networks. In order to design a controller for a network, an observer is needed to evaluate the current network state and traffic flows. This paper proposes an observer model and design for cable networks. The observer design is recast into an online traffic classification problem. Using dynamic network traffic phases observed through simulation, the network classifier is designed with a hidden Markov model to determine the network states.","PeriodicalId":394442,"journal":{"name":"2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"233 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116325078","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}