Contemporary communication networks are expected to support multimedia services which require differentiated Quality-of-Services (QoS). To this end, many traffic scheduling schemes have been proposed and extensively studied. Recently, a hybrid scheduling discipline which integrates priority queueing and Generalized Processor Sharing (GPS) has been emerging as a promising scheme for QoS differentiation. In this paper, we present an analytical performance model for the integrated scheduling system under Markov Modulated Poisson Processes (MMPPs), which can qualitatively model the time-varying arrival rate and capture the important correlation between the inter-arrival times. We decompose the complex system into a group of single-server single-queue (SSSQ) systems at two steps. The first step is to divide the priority queueing level into a SSSQ system and a GPS system. At the second step, we adopt a bounding approach to decompose the GPS system into two SSSQ systems and derive the performance bounds for their queue length distributions. The comparison between analytical and simulation results validates the accuracy of the analytical model.
{"title":"Modelling an Integrated Scheduling Scheme under Bursty MMPP Traffic","authors":"Lei Liu, X. Jin, G. Min","doi":"10.1109/WAINA.2009.155","DOIUrl":"https://doi.org/10.1109/WAINA.2009.155","url":null,"abstract":"Contemporary communication networks are expected to support multimedia services which require differentiated Quality-of-Services (QoS). To this end, many traffic scheduling schemes have been proposed and extensively studied. Recently, a hybrid scheduling discipline which integrates priority queueing and Generalized Processor Sharing (GPS) has been emerging as a promising scheme for QoS differentiation. In this paper, we present an analytical performance model for the integrated scheduling system under Markov Modulated Poisson Processes (MMPPs), which can qualitatively model the time-varying arrival rate and capture the important correlation between the inter-arrival times. We decompose the complex system into a group of single-server single-queue (SSSQ) systems at two steps. The first step is to divide the priority queueing level into a SSSQ system and a GPS system. At the second step, we adopt a bounding approach to decompose the GPS system into two SSSQ systems and derive the performance bounds for their queue length distributions. The comparison between analytical and simulation results validates the accuracy of the analytical model.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114697605","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}
When humans interact with machines in their daily networks, it is important that security of the communications is offered, and where the involved shared secrets used to achieve this are easily remembered by humans. Password-based authenticated group key exchange (PAGKE) schemes allow group users to share a session key based on a human-memorizable password. In this paper, we consider two PAGKE schemes that build on the seminal scheme of Burmester and Desmedt. Weshow an undetectable online dictionary attack on the first scheme, and exploit the partnering definition to break the key indistinguishability of the second scheme.
{"title":"Security of Two Recent Constant-Round Password Authenticated Group Key Exchange Schemes","authors":"R. Phan","doi":"10.1109/WAINA.2009.42","DOIUrl":"https://doi.org/10.1109/WAINA.2009.42","url":null,"abstract":"When humans interact with machines in their daily networks, it is important that security of the communications is offered, and where the involved shared secrets used to achieve this are easily remembered by humans. Password-based authenticated group key exchange (PAGKE) schemes allow group users to share a session key based on a human-memorizable password. In this paper, we consider two PAGKE schemes that build on the seminal scheme of Burmester and Desmedt. Weshow an undetectable online dictionary attack on the first scheme, and exploit the partnering definition to break the key indistinguishability of the second scheme.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124225527","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}
Nobuyoshi Sato, S. Odashima, J. Suzuki, T. Ishikawa, Y. Murata
In quality control of industrial products, it is important that materials, parts, and design but also production processes themselves. Generally, most production lines have processes to confirm quality of works in former processes in everywhere. However, there are some processes of which quality cannot be confirmed in later processes. For example, to fix a part using some screws, procedure to move the part onto correct pace and order to fasten screws is defined in most process. However, detecting violation of the procedure by visual or another way is hard in later processes. Therefore, we have been developing a system that guarantees quality of a process by tracing motions of worker's arms and hands by using terrestrial magnetism sensors and acceleration sensors. As a prototype system, we developed a system that traces worker’s motion and judges his/her work is correct or not at a process to attach a fuel tank in automobile assembly factory. In this paper, based on days long examination of the prototype system we will describe a method to judge worker's motion and its evaluation.
{"title":"A Trial of a Worker's Motion Trace System Using Terrestrial Magnetism and Acceleration Sensors","authors":"Nobuyoshi Sato, S. Odashima, J. Suzuki, T. Ishikawa, Y. Murata","doi":"10.1109/WAINA.2009.40","DOIUrl":"https://doi.org/10.1109/WAINA.2009.40","url":null,"abstract":"In quality control of industrial products, it is important that materials, parts, and design but also production processes themselves. Generally, most production lines have processes to confirm quality of works in former processes in everywhere. However, there are some processes of which quality cannot be confirmed in later processes. For example, to fix a part using some screws, procedure to move the part onto correct pace and order to fasten screws is defined in most process. However, detecting violation of the procedure by visual or another way is hard in later processes. Therefore, we have been developing a system that guarantees quality of a process by tracing motions of worker's arms and hands by using terrestrial magnetism sensors and acceleration sensors. As a prototype system, we developed a system that traces worker’s motion and judges his/her work is correct or not at a process to attach a fuel tank in automobile assembly factory. In this paper, based on days long examination of the prototype system we will describe a method to judge worker's motion and its evaluation.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125639464","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}
Underwater acoustic communication networking is an innovative area, which faces difficult medium problems, such as long propagation time and dynamic network topology. Our challenge is to develop a MAC protocol which provides a stable and efficient underwater acoustic network for a system with high message rate. In previous work, a TDMA based algorithm was implemented and tested in various sea trials [1]. The result was a reliable but inefficient network since the TDMA protocol does not utilize the network resources providing reuse in the code domain (using the CDMA concept) or in the frequency domain (using the FDMA concept). In this paper we introduce a quality measure taking into account both the reliability and efficiency requirements of the network. From this measure a novel MAC protocol, combining the TDMA scheme and multiple access techniques, was derived. The suggested MAC protocol confronts the acoustic underwater network challenges, such as the "near-far" problem and fast time varying topology. Results from network simulations, demonstrating the efficacy of the proposed networking scheme, are presented showing a significant efficiency increase with respect to the TDMA protocol without deteriorating the network stability and reliability.
{"title":"A Novel Spatially Shared TDMA Protocol and Quality Measure for Ad Hoc Underwater Acoustic Network","authors":"R. Diamant, Michael Pinkhasevich, Ido Achrak","doi":"10.1109/WAINA.2009.116","DOIUrl":"https://doi.org/10.1109/WAINA.2009.116","url":null,"abstract":"Underwater acoustic communication networking is an innovative area, which faces difficult medium problems, such as long propagation time and dynamic network topology. Our challenge is to develop a MAC protocol which provides a stable and efficient underwater acoustic network for a system with high message rate. In previous work, a TDMA based algorithm was implemented and tested in various sea trials [1]. The result was a reliable but inefficient network since the TDMA protocol does not utilize the network resources providing reuse in the code domain (using the CDMA concept) or in the frequency domain (using the FDMA concept). In this paper we introduce a quality measure taking into account both the reliability and efficiency requirements of the network. From this measure a novel MAC protocol, combining the TDMA scheme and multiple access techniques, was derived. The suggested MAC protocol confronts the acoustic underwater network challenges, such as the \"near-far\" problem and fast time varying topology. Results from network simulations, demonstrating the efficacy of the proposed networking scheme, are presented showing a significant efficiency increase with respect to the TDMA protocol without deteriorating the network stability and reliability.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121865061","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}
Mining and extracting quality knowledge from online discussions is significant for the industrial and marketing sector, as well as for e-commerce applications. Most of the existing techniques model a discussion as a social network of users represented by a user-based graph. In this paper, we propose a new framework for discussion analysis. It is based on message-based graphs where each vertex represents amessage object and each edge points out which message the specific node replies to. The edges can be weighted by the keywords that characterize the exchanged messages. This model allows a content-oriented representation of the discussion and it facilitates the identification of discussion chains. We compare the two representations (user-based and message-based graphs) and we analyze the different information that can be extracted from them. Our experiments with real data validate the proposed framework and show the additional information that can be extracted from a message-based graph.
{"title":"A Content-Oriented Framework for Online Discussion Analysis","authors":"Anna Stavrianou, J. Chauchat, Julien Velcin","doi":"10.1109/WAINA.2009.57","DOIUrl":"https://doi.org/10.1109/WAINA.2009.57","url":null,"abstract":"Mining and extracting quality knowledge from online discussions is significant for the industrial and marketing sector, as well as for e-commerce applications. Most of the existing techniques model a discussion as a social network of users represented by a user-based graph. In this paper, we propose a new framework for discussion analysis. It is based on message-based graphs where each vertex represents amessage object and each edge points out which message the specific node replies to. The edges can be weighted by the keywords that characterize the exchanged messages. This model allows a content-oriented representation of the discussion and it facilitates the identification of discussion chains. We compare the two representations (user-based and message-based graphs) and we analyze the different information that can be extracted from them. Our experiments with real data validate the proposed framework and show the additional information that can be extracted from a message-based graph.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134056476","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}
Unlike in terrestrial sensor networks where the locations of destination nodes are often assumed to be fixed and accurately known, such assumptions are usually not valid in underwater sensor networks where the destination nodes tend to be mobile inherently, either due to their self-propelling capability, or due to random motion caused by ocean currents. As a result, many existing location-based routing protocols do not work well in underwater environments. We propose a location-based routing protocol that is designed for mobile underwater acoustic sensor networks, called "Sector-based Routing with Destination Location Prediction (SBR-DLP)". While the SBR-DLP also assumes that a node knows its own location like many other location-based routing protocols, it predicts the location of the destination node, and therefore, relaxes the need for precise knowledge of the destination's location. Through simulations, the SBR-DLP is shown to enhance the packet delivery ratio significantly when all nodes are mobile.
{"title":"Sector-Based Routing with Destination Location Prediction for Underwater Mobile Networks","authors":"N. Chirdchoo, Wee-Seng Soh, K. Chua","doi":"10.1109/WAINA.2009.105","DOIUrl":"https://doi.org/10.1109/WAINA.2009.105","url":null,"abstract":"Unlike in terrestrial sensor networks where the locations of destination nodes are often assumed to be fixed and accurately known, such assumptions are usually not valid in underwater sensor networks where the destination nodes tend to be mobile inherently, either due to their self-propelling capability, or due to random motion caused by ocean currents. As a result, many existing location-based routing protocols do not work well in underwater environments. We propose a location-based routing protocol that is designed for mobile underwater acoustic sensor networks, called \"Sector-based Routing with Destination Location Prediction (SBR-DLP)\". While the SBR-DLP also assumes that a node knows its own location like many other location-based routing protocols, it predicts the location of the destination node, and therefore, relaxes the need for precise knowledge of the destination's location. Through simulations, the SBR-DLP is shown to enhance the packet delivery ratio significantly when all nodes are mobile.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"14 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133614539","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}
M. Ameling, Bernhard Wolf, J. E. Armendáriz-Iñigo, A. Schill
Replication in distributed systems is a solution to improve availability and reliability. To replicate business objects cached by the middleware we aim at replica control at application level. To reach an efficient replication within a service-oriented environment we have to understand the structure of business objects to be able to reduce data transfer and processing time of messages.In this paper, we introduce a general cost model for business objects to predict the processing time of BOs in dependency of their structure. A BO model is proposed to create profiles of BOs. A system model is introduced to predict the processing time. We experimentally prove that we are able to specify system parameters and BO model parameters for our cost model. The proposed solution enables the determination of the processing time of BOs at a sender during the update process of BOs. Finally, we introduce a how to modify the update process for an efficient replication with our cost model.
{"title":"A Cost Model for Efficient Business Object Replication","authors":"M. Ameling, Bernhard Wolf, J. E. Armendáriz-Iñigo, A. Schill","doi":"10.1109/WAINA.2009.110","DOIUrl":"https://doi.org/10.1109/WAINA.2009.110","url":null,"abstract":"Replication in distributed systems is a solution to improve availability and reliability. To replicate business objects cached by the middleware we aim at replica control at application level. To reach an efficient replication within a service-oriented environment we have to understand the structure of business objects to be able to reduce data transfer and processing time of messages.In this paper, we introduce a general cost model for business objects to predict the processing time of BOs in dependency of their structure. A BO model is proposed to create profiles of BOs. A system model is introduced to predict the processing time. We experimentally prove that we are able to specify system parameters and BO model parameters for our cost model. The proposed solution enables the determination of the processing time of BOs at a sender during the update process of BOs. Finally, we introduce a how to modify the update process for an efficient replication with our cost model.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115526603","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}
Hirokazu Ookuzu, Yosuke Sato, K. Hashimoto, Y. Shibata
In this paper, a new teleconference system by using Gigabit Ethernet based omni-directional camera system and flexible middleware system in realtime and bi-directional video transmission is introduced. The omni-directional image has more advantages than conventional one-directional camera in that it provides a wider view than a single directional camera and able to realize flexible teleconferencing even between remotely separated small rooms. System architecture and functions of the middleware for high-definition omni-directional video control and effective video transmission system using Windows Media Video(WMV) format [4] are precisely described. QoS control function is also introduced to dynamically control the frame rate of video depending on the changes of network and CPU load. The prototype system of a teleconference is constructed to apply for remote healthcare education and evaluate the performance of our suggested high-definition omni-directional video system. Through the performance evaluation of the prototyped system, we could verify the usefulness of our proposed system.
{"title":"A New Teleconference System for Healthcare Applications by GigaEther-based Omni-directional Video Transmission","authors":"Hirokazu Ookuzu, Yosuke Sato, K. Hashimoto, Y. Shibata","doi":"10.1109/WAINA.2009.162","DOIUrl":"https://doi.org/10.1109/WAINA.2009.162","url":null,"abstract":"In this paper, a new teleconference system by using Gigabit Ethernet based omni-directional camera system and flexible middleware system in realtime and bi-directional video transmission is introduced. The omni-directional image has more advantages than conventional one-directional camera in that it provides a wider view than a single directional camera and able to realize flexible teleconferencing even between remotely separated small rooms. System architecture and functions of the middleware for high-definition omni-directional video control and effective video transmission system using Windows Media Video(WMV) format [4] are precisely described. QoS control function is also introduced to dynamically control the frame rate of video depending on the changes of network and CPU load. The prototype system of a teleconference is constructed to apply for remote healthcare education and evaluate the performance of our suggested high-definition omni-directional video system. Through the performance evaluation of the prototyped system, we could verify the usefulness of our proposed system.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124138608","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}
In order to investigate the performance of priority protocols in an eCommerce system, we simulate their behaviour when composed with clients with differing behaviour. As suspected, we find that the interaction between the clients and the server is an important factor in the performance of the protocols.
{"title":"Investigating Interactions between Clients and Server in the Performance Analysis of eCommerce Systems","authors":"R. Holton, I. Awan, M. Younas","doi":"10.1109/WAINA.2009.137","DOIUrl":"https://doi.org/10.1109/WAINA.2009.137","url":null,"abstract":"In order to investigate the performance of priority protocols in an eCommerce system, we simulate their behaviour when composed with clients with differing behaviour. As suspected, we find that the interaction between the clients and the server is an important factor in the performance of the protocols.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114594153","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}
The development of specific communication services is currently still very time and cost consuming. The need for specific business-to-business services, in particular for medium and small sized enterprises, demands for efficient service development methods. This paper presents a service creation environment that supports the application developer to compose a service based on reusable components hiding the underlying heterogeneous communication networks. Thereby the developer does not need any detailed knowledge of communication protocols and is able to focus on the application logic instead. For service creation the developer describes the business process through elementary communication service components and a control logic based on the Business Process Execution Language (BPEL). A parser translates the business process description into Java code and supports the deployment of the service in a service execution environment based on JAIN SLEE. The service creation environment supports fast and individual adaptation of business processes to changing requirements.
{"title":"Service Creation Environment for Business-to-Business Services","authors":"R. Lasch, Björn Ricks, R. Tönjes","doi":"10.1109/WAINA.2009.26","DOIUrl":"https://doi.org/10.1109/WAINA.2009.26","url":null,"abstract":"The development of specific communication services is currently still very time and cost consuming. The need for specific business-to-business services, in particular for medium and small sized enterprises, demands for efficient service development methods. This paper presents a service creation environment that supports the application developer to compose a service based on reusable components hiding the underlying heterogeneous communication networks. Thereby the developer does not need any detailed knowledge of communication protocols and is able to focus on the application logic instead. For service creation the developer describes the business process through elementary communication service components and a control logic based on the Business Process Execution Language (BPEL). A parser translates the business process description into Java code and supports the deployment of the service in a service execution environment based on JAIN SLEE. The service creation environment supports fast and individual adaptation of business processes to changing requirements.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116893016","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
扫码关注我们
求助内容：
应助结果提醒方式：