Pub Date : 2006-06-19DOI: 10.1109/IWQOS.2006.250468
Wenjun Gu, Xiaole Bai, S. Chellappan, D. Xuan
Secure communications are highly demanded by many wireless sensor network (WSN) applications. The random key pre-distribution (RKP) scheme has become well accepted in achieving secure communications in WSNs. However, due to its randomness in key distribution and strong constraint in key path construction, the RKP scheme can only be applied in highly dense networks, which are not always feasible in practice. In this paper, we propose a methodology called network decoupling to solve this problem. With this methodology, a wireless sensor network is decoupled into a logical key-sharing network and a physical neighborhood network, which significantly releases the constraint in key path construction of the RKP scheme. We design a secure neighbor establishment protocol (called RKP-DE) as well as a set of link and path dependency elimination rules in decoupled wireless sensor networks. Our analytical and simulation data demonstrate the performance enhancement of our solution and its applicability in non-highly dense wireless sensor networks
{"title":"Network Decoupling for Secure Communications in Wireless Sensor Networks","authors":"Wenjun Gu, Xiaole Bai, S. Chellappan, D. Xuan","doi":"10.1109/IWQOS.2006.250468","DOIUrl":"https://doi.org/10.1109/IWQOS.2006.250468","url":null,"abstract":"Secure communications are highly demanded by many wireless sensor network (WSN) applications. The random key pre-distribution (RKP) scheme has become well accepted in achieving secure communications in WSNs. However, due to its randomness in key distribution and strong constraint in key path construction, the RKP scheme can only be applied in highly dense networks, which are not always feasible in practice. In this paper, we propose a methodology called network decoupling to solve this problem. With this methodology, a wireless sensor network is decoupled into a logical key-sharing network and a physical neighborhood network, which significantly releases the constraint in key path construction of the RKP scheme. We design a secure neighbor establishment protocol (called RKP-DE) as well as a set of link and path dependency elimination rules in decoupled wireless sensor networks. Our analytical and simulation data demonstrate the performance enhancement of our solution and its applicability in non-highly dense wireless sensor networks","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114657799","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 : 2006-06-19DOI: 10.1109/IWQOS.2006.250481
S. Avallone
Different architectures have been proposed and standardized to support quality of service (QoS) in the Internet. The goal was to provide the users with a certain level of QoS guarantees. The traffic engineering (TE) concept was then introduced to account for resource optimization, as well as users' QoS requirements, and inspired new architectures. Routing has also been a flourishing research field. Proposed QoS routing algorithms seek a multi-constrained optimal path, while traffic engineering algorithms aim at maximizing throughput and the number of admitted requests. However, architectures and routing algorithms have been developed rather independently of each other. The aim of this work is to present a framework which provides predictable communication services to flows without requiring sophisticated queuing at individual routers. We show that the routing algorithm plays a key role to assure both QoS and resource optimization
{"title":"A simple framework for QoS provisioning in traffic engineered networks","authors":"S. Avallone","doi":"10.1109/IWQOS.2006.250481","DOIUrl":"https://doi.org/10.1109/IWQOS.2006.250481","url":null,"abstract":"Different architectures have been proposed and standardized to support quality of service (QoS) in the Internet. The goal was to provide the users with a certain level of QoS guarantees. The traffic engineering (TE) concept was then introduced to account for resource optimization, as well as users' QoS requirements, and inspired new architectures. Routing has also been a flourishing research field. Proposed QoS routing algorithms seek a multi-constrained optimal path, while traffic engineering algorithms aim at maximizing throughput and the number of admitted requests. However, architectures and routing algorithms have been developed rather independently of each other. The aim of this work is to present a framework which provides predictable communication services to flows without requiring sophisticated queuing at individual routers. We show that the routing algorithm plays a key role to assure both QoS and resource optimization","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124665930","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 : 2006-06-19DOI: 10.1109/IWQOS.2006.250476
I. Widya, B. Beijnum, A. Salden
This paper addresses how quality of context (QoC) can be used to optimize end-to-end mobile healthcare (m-health) data delivery services in the presence of alternative delivery paths, which is quite common in a pervasive computing and communication environment. We propose min-max-plus based algebraic QoC models for computing the quality of delivered data impeded by the QoS of the resources along the alternative delivery paths. The constructed algebraic structures in those models directly relate to the resource configurations represented as directed graphs. The properties of the applied algebras correspond to the properties of the operations of the addressed QoS dimensions. To rank all the possible resource configurations and therewith select from those the most optimal one(s) we introduce a workflow management metric based on the quality dimensions like freshness and availability. We focus on the pre-establishment phase of m-health data delivery services; dynamic QoC issues existing during service execution are not considered
{"title":"QoC-based Optimization of End-to-End M-Health Data Delivery Services","authors":"I. Widya, B. Beijnum, A. Salden","doi":"10.1109/IWQOS.2006.250476","DOIUrl":"https://doi.org/10.1109/IWQOS.2006.250476","url":null,"abstract":"This paper addresses how quality of context (QoC) can be used to optimize end-to-end mobile healthcare (m-health) data delivery services in the presence of alternative delivery paths, which is quite common in a pervasive computing and communication environment. We propose min-max-plus based algebraic QoC models for computing the quality of delivered data impeded by the QoS of the resources along the alternative delivery paths. The constructed algebraic structures in those models directly relate to the resource configurations represented as directed graphs. The properties of the applied algebras correspond to the properties of the operations of the addressed QoS dimensions. To rank all the possible resource configurations and therewith select from those the most optimal one(s) we introduce a workflow management metric based on the quality dimensions like freshness and availability. We focus on the pre-establishment phase of m-health data delivery services; dynamic QoC issues existing during service execution are not considered","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126087949","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 : 2006-06-01DOI: 10.1109/IWQOS.2006.250489
Jason Parekh, Gueyoung Jung, G. Swint, C. Pu, Akhil Sahai
In this work, the performance of various machine learning classifiers with regard to bottleneck detection in enterprise, multi-tier applications governed by service level objectives is described. Specifically, in this paper, it demonstrates the effectiveness of three classifiers, a tree-augmented Naive Bayesian network, a J48 decision tree, and LogitBoost, using our bottleneck detection process, which delves into a new area of performance analysis based on the trends of metrics (first order derivative) rather than the metric value itself. Furthermore, the efficiency of each classifier by measuring the convergence speed, or the number of staging trials required in order to provide positive results is illustrated. Finally, the effectiveness of the classifiers used in the bottleneck detection process as each classifier strongly identifies the enterprise system bottleneck
{"title":"Issues in Bottleneck Detection in Multi-Tier Enterprise Applications","authors":"Jason Parekh, Gueyoung Jung, G. Swint, C. Pu, Akhil Sahai","doi":"10.1109/IWQOS.2006.250489","DOIUrl":"https://doi.org/10.1109/IWQOS.2006.250489","url":null,"abstract":"In this work, the performance of various machine learning classifiers with regard to bottleneck detection in enterprise, multi-tier applications governed by service level objectives is described. Specifically, in this paper, it demonstrates the effectiveness of three classifiers, a tree-augmented Naive Bayesian network, a J48 decision tree, and LogitBoost, using our bottleneck detection process, which delves into a new area of performance analysis based on the trends of metrics (first order derivative) rather than the metric value itself. Furthermore, the efficiency of each classifier by measuring the convergence speed, or the number of staging trials required in order to provide positive results is illustrated. Finally, the effectiveness of the classifiers used in the bottleneck detection process as each classifier strongly identifies the enterprise system bottleneck","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129894335","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 : 2005-07-03DOI: 10.1109/IWQOS.2006.250477
M. Fidler
Network calculus is a min-plus system theory for performance evaluation of queuing networks. Its elegance steins from intuitive convolution formulas for concatenation of deterministic servers. Recent research dispenses with the worst-case assumptions of network calculus to develop a probabilistic equivalent that benefits from statistical multiplexing. Significant achievements have been made, owing for example to the theory of effective bandwidths; however, the outstanding scalability set up by concatenation of deterministic servers has not been shown. This paper establishes a concise, probabilistic network calculus with moment generating functions. The presented work features closed-form, end-to-end, probabilistic performance bounds that achieve the objective of scaling linearly in the number of servers in series. The consistent application of moment generating functions put forth in this paper utilizes independence beyond the scope of current statistical multiplexing of flows. A relevant additional gain is demonstrated for tandem servers with independent cross-traffic
{"title":"An End-to-End Probabilistic Network Calculus with Moment Generating Functions","authors":"M. Fidler","doi":"10.1109/IWQOS.2006.250477","DOIUrl":"https://doi.org/10.1109/IWQOS.2006.250477","url":null,"abstract":"Network calculus is a min-plus system theory for performance evaluation of queuing networks. Its elegance steins from intuitive convolution formulas for concatenation of deterministic servers. Recent research dispenses with the worst-case assumptions of network calculus to develop a probabilistic equivalent that benefits from statistical multiplexing. Significant achievements have been made, owing for example to the theory of effective bandwidths; however, the outstanding scalability set up by concatenation of deterministic servers has not been shown. This paper establishes a concise, probabilistic network calculus with moment generating functions. The presented work features closed-form, end-to-end, probabilistic performance bounds that achieve the objective of scaling linearly in the number of servers in series. The consistent application of moment generating functions put forth in this paper utilizes independence beyond the scope of current statistical multiplexing of flows. A relevant additional gain is demonstrated for tandem servers with independent cross-traffic","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125169855","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 : 1900-01-01DOI: 10.1109/IWQOS.2006.250445
M. Kâafar, T. Turletti, W. Dabbous
Recent proposals in multicast overlay construction have demonstrated the importance of exploiting underlying network topology. However, these topology-aware proposals often rely on incremental and periodic refinements to improve the system performance. These approaches are therefore neither scalable, as they induce high communication cost due to refinement overhead, nor efficient because long convergence time is necessary to obtain a stabilized structure. In this paper, we propose a highly scalable locating algorithm that gradually directs newcomers to their a set of their closest nodes without inducing high overhead. On the basis of this locating process, we build a robust and scalable topology-aware clustered hierarchical overlay scheme, called LCC. We conducted both simulations and PlanetLab experiments to evaluate the performance of LCC. Results show that the locating process entails modest resources in terms of time and bandwidth. Moreover, LCC demonstrates promising performance to support large scale multicast applications
{"title":"A Locating-First Approach for Scalable Overlay Multicast","authors":"M. Kâafar, T. Turletti, W. Dabbous","doi":"10.1109/IWQOS.2006.250445","DOIUrl":"https://doi.org/10.1109/IWQOS.2006.250445","url":null,"abstract":"Recent proposals in multicast overlay construction have demonstrated the importance of exploiting underlying network topology. However, these topology-aware proposals often rely on incremental and periodic refinements to improve the system performance. These approaches are therefore neither scalable, as they induce high communication cost due to refinement overhead, nor efficient because long convergence time is necessary to obtain a stabilized structure. In this paper, we propose a highly scalable locating algorithm that gradually directs newcomers to their a set of their closest nodes without inducing high overhead. On the basis of this locating process, we build a robust and scalable topology-aware clustered hierarchical overlay scheme, called LCC. We conducted both simulations and PlanetLab experiments to evaluate the performance of LCC. Results show that the locating process entails modest resources in terms of time and bandwidth. Moreover, LCC demonstrates promising performance to support large scale multicast applications","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121370140","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
扫码关注我们
求助内容：
应助结果提醒方式：