Pub Date : 2003-12-01DOI: 10.1109/WORDS.2003.1267505
Hui Ding, Can Zheng, G. Agha, L. Sha
We develop an effective approach to formally specify and automatically verify the dependability of object-oriented real-time systems based on the Actor model and Real-Time Maude. Our approach decomposes an application into functional components represented as concurrent objects or actors, and separately specifies the timing constraints using RTSynchronizer. It achieves the goal of automatically verifying the dependability and timing properties of the target system by implementing the operational semantics of Actor and RTSynchronizer in Real-Time Maude, which supports executable specification and various temporal model checking analysis. We demonstrate the effectiveness of our approach by an annotated case study of the Simplex architecture.
{"title":"Automated Veri.cation of the Dependability of Object-Oriented Real-Time Systems","authors":"Hui Ding, Can Zheng, G. Agha, L. Sha","doi":"10.1109/WORDS.2003.1267505","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1267505","url":null,"abstract":"We develop an effective approach to formally specify and automatically verify the dependability of object-oriented real-time systems based on the Actor model and Real-Time Maude. Our approach decomposes an application into functional components represented as concurrent objects or actors, and separately specifies the timing constraints using RTSynchronizer. It achieves the goal of automatically verifying the dependability and timing properties of the target system by implementing the operational semantics of Actor and RTSynchronizer in Real-Time Maude, which supports executable specification and various temporal model checking analysis. We demonstrate the effectiveness of our approach by an annotated case study of the Simplex architecture.","PeriodicalId":350761,"journal":{"name":"2003 The Ninth IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115326711","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 : 2003-12-01DOI: 10.1109/WORDS.2003.1267502
Y. Kakuda, K. Suezawa, S. Inoue, H. Nakazato
This paper discusses a fault tolerant technique called redundant path design in wavelength division multiplexing networks, in which backup paths between source and destination nodes, such that when primary paths between them fail the primary paths are quickly switched to the backup paths, are prepared. Unlike the previous centralized approaches, this paper proposes two multiagent-based methods called Method 1 and Method 2, which is an improvement of Method 1, and evaluates optimality and efficiency of the proposed methods by simulation experiments. The simulation results show that, compared with Method 1, Method 2 has higher optimality with reasonable time.
{"title":"Redundant Optical Path Design Based on Multiagents and Its Experimental Evaluation","authors":"Y. Kakuda, K. Suezawa, S. Inoue, H. Nakazato","doi":"10.1109/WORDS.2003.1267502","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1267502","url":null,"abstract":"This paper discusses a fault tolerant technique called redundant path design in wavelength division multiplexing networks, in which backup paths between source and destination nodes, such that when primary paths between them fail the primary paths are quickly switched to the backup paths, are prepared. Unlike the previous centralized approaches, this paper proposes two multiagent-based methods called Method 1 and Method 2, which is an improvement of Method 1, and evaluates optimality and efficiency of the proposed methods by simulation experiments. The simulation results show that, compared with Method 1, Method 2 has higher optimality with reasonable time.","PeriodicalId":350761,"journal":{"name":"2003 The Ninth IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129345212","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 : 2003-12-01DOI: 10.1109/WORDS.2003.1267548
R. Iyer, Shuo Chen, Jun Xu, Z. Kalbarczyk
This paper combines an analysis of data on security vulnerabilities (published in the Bugtraq database) and a focused source-code examination to (i) develop a finite state machine (FSM) model to depict and reason about security vulnerabilities and (ii) to extract characteristics shared by a large class of commonly seen vulnerabilities (e.g., integer overflow, heap overflow, format string, and stack buffer overflow). This information is used to devise Transparent Runtime Randomization (TRR), a generic, randomization-based technique for protecting against a wide range of security attacks. TRR dynamically and randomly relocates a program’s stack, heap, shared libraries, and parts of its runtime control data structures inside the application memory address space. Making a program’s memory layout different each time it runs foils the attacker’s assumptions about the memory layout of the vulnerable program and defeats potential attacks. TRR is implemented by changing the Linux dynamic program loader; hence, it is transparent to applications. TRR incurs less than 9% program startup overhead and no runtime overhead.
{"title":"Security Vulnerabilities - From Data Analysis to Protection Mechanisms","authors":"R. Iyer, Shuo Chen, Jun Xu, Z. Kalbarczyk","doi":"10.1109/WORDS.2003.1267548","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1267548","url":null,"abstract":"This paper combines an analysis of data on security vulnerabilities (published in the Bugtraq database) and a focused source-code examination to (i) develop a finite state machine (FSM) model to depict and reason about security vulnerabilities and (ii) to extract characteristics shared by a large class of commonly seen vulnerabilities (e.g., integer overflow, heap overflow, format string, and stack buffer overflow). This information is used to devise Transparent Runtime Randomization (TRR), a generic, randomization-based technique for protecting against a wide range of security attacks. TRR dynamically and randomly relocates a program’s stack, heap, shared libraries, and parts of its runtime control data structures inside the application memory address space. Making a program’s memory layout different each time it runs foils the attacker’s assumptions about the memory layout of the vulnerable program and defeats potential attacks. TRR is implemented by changing the Linux dynamic program loader; hence, it is transparent to applications. TRR incurs less than 9% program startup overhead and no runtime overhead.","PeriodicalId":350761,"journal":{"name":"2003 The Ninth IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123087244","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 : 2003-12-01DOI: 10.1109/WORDS.2003.1267508
T. Nakajima
Our future daily lives will be augmented by various computers and sensors, and our environments change their behavior according to the current situation. Each person will have many personal devices such as celluar phones, PDA's, MP3 Players voice recorders. Also, many appliances will be available near us such as various displays, televisions, and information kiosk. We believe that these devices and appliances are communicated in a spontaneous way, and provide useful information to us. It is important to offer middleware infrastructures to hide a variety of complexities from application programmers to make easy to develop pervasive computing applications. However, we have not enough experiences how to build middleware for pervasive computing, and it is important to share knowledge among research communities. In this paper, we present three middleware infrastructures for pervasive computing, that have been developed in our projects. These middleware infrastructures hide various complexities such as context-awareness to make it easy to develop pervasive computing applications. We found that hiding context-awareness requires to take into account human factors when designing middleware. We show the overview of our middlewares, and discuss some human factor issues while designing our middlewares.
{"title":"Middleware Design and Human Factor","authors":"T. Nakajima","doi":"10.1109/WORDS.2003.1267508","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1267508","url":null,"abstract":"Our future daily lives will be augmented by various computers and sensors, and our environments change their behavior according to the current situation. Each person will have many personal devices such as celluar phones, PDA's, MP3 Players voice recorders. Also, many appliances will be available near us such as various displays, televisions, and information kiosk. We believe that these devices and appliances are communicated in a spontaneous way, and provide useful information to us. It is important to offer middleware infrastructures to hide a variety of complexities from application programmers to make easy to develop pervasive computing applications. However, we have not enough experiences how to build middleware for pervasive computing, and it is important to share knowledge among research communities. In this paper, we present three middleware infrastructures for pervasive computing, that have been developed in our projects. These middleware infrastructures hide various complexities such as context-awareness to make it easy to develop pervasive computing applications. We found that hiding context-awareness requires to take into account human factors when designing middleware. We show the overview of our middlewares, and discuss some human factor issues while designing our middlewares.","PeriodicalId":350761,"journal":{"name":"2003 The Ninth IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":" 47","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120934060","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 : 2003-12-01DOI: 10.1109/WORDS.2003.1267525
T. Nakajima
Ubiquitous computing environments create a seamless boundary between atoms and bits. Especially, in the near future , embedding various types of sensors in our daily lives enables an application to customize their behavior according to its user's situation. Also, physical objects in our daily lives can be used to manipulate information in cyber spaces. however, the vision requires a new software infrastructure that collaborates various appliances in a spontaneous way. The paper proposes an architecture to realize the vision in our daily computing environments by creating a society of appliances. Our architecture is called Pervasive Servers, that embeds micro servers called stationary pervasive servers everywhere. Also, a personal pervasive server that is carried by each person coordinates the embedded servers that are near the person. The architecture is very attractive because it is easy to personalize the coordination according to each person's policy. We also show that there are several useful applications based on the architecture.
{"title":"A Presence Service Architecture for Supporting Spontaneous Interaction","authors":"T. Nakajima","doi":"10.1109/WORDS.2003.1267525","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1267525","url":null,"abstract":"Ubiquitous computing environments create a seamless boundary between atoms and bits. Especially, in the near future , embedding various types of sensors in our daily lives enables an application to customize their behavior according to its user's situation. Also, physical objects in our daily lives can be used to manipulate information in cyber spaces. however, the vision requires a new software infrastructure that collaborates various appliances in a spontaneous way. The paper proposes an architecture to realize the vision in our daily computing environments by creating a society of appliances. Our architecture is called Pervasive Servers, that embeds micro servers called stationary pervasive servers everywhere. Also, a personal pervasive server that is carried by each person coordinates the embedded servers that are near the person. The architecture is very attractive because it is easy to personalize the coordination according to each person's policy. We also show that there are several useful applications based on the architecture.","PeriodicalId":350761,"journal":{"name":"2003 The Ninth IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"370 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124643825","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 : 2003-10-03DOI: 10.1109/WORDS.2003.1267492
M. Ceruti, J. L. Kaina
This paper presents a report of an ongoing research project to test and evaluate temporal and other dependability properties of the battlefield single integrated picture (SIP). It explores modeling and simulations of information flows in the battlespace with a view toward enhancing the SIP. The main emphasis will be on level-one data fusion, i.e. detection, identification and tracking of platforms and classifying them as friendly, neutral or hostile. Thus, the study will focus on metrics that pertain directly to the flow of relevant information in the battlespace during the time period of a particular target-classification task, and the dependability of that information.
{"title":"Enhancing Dependability of the Battlefield Single Integrated Picture through Metrics for Modeling and Simulation of Time-Critical Scenarios","authors":"M. Ceruti, J. L. Kaina","doi":"10.1109/WORDS.2003.1267492","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1267492","url":null,"abstract":"This paper presents a report of an ongoing research project to test and evaluate temporal and other dependability properties of the battlefield single integrated picture (SIP). It explores modeling and simulations of information flows in the battlespace with a view toward enhancing the SIP. The main emphasis will be on level-one data fusion, i.e. detection, identification and tracking of platforms and classifying them as friendly, neutral or hostile. Thus, the study will focus on metrics that pertain directly to the flow of relevant information in the battlespace during the time period of a particular target-classification task, and the dependability of that information.","PeriodicalId":350761,"journal":{"name":"2003 The Ninth IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126432109","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 : 2003-10-01DOI: 10.1109/WORDS.2003.1267488
W. Halang
Programs employed for purposes of safety related control must be formally safety licensed, which constitutes a very difficult and hitherto not satisfactorily solved problem. Striving for utmost simplicity and easy comprehensibility of verification methods, the programming methods cause/effect tables and function block diagrams based on verified libraries are assigned to the upper two Safety Integrity Levels SIL 4 and SIL 3, resp., as they are the only ones so far allowing to verify highly safety critical automation software in trustworthy, easy and economic ways. For each of the two SILs a dedicated, a low complexity execution platform is presented supporting the corresponding programming method architecturally. Their hardware is fault detecting or supervised by a fail safe logic, resp., to initiate emergency shut-downs in case of malfunctions. By design, there is no semantic gap between the programming and machine execution levels, enabling the safety licensing of application software by extremely simple, but rigorous methods, viz., diverse back translation and inspection. Operating in strictly periodic fashion, the controllers exhibit fully predictable real time behaviour.
{"title":"Automated Control Systems for the Safety Integrity Levels 3 and 4","authors":"W. Halang","doi":"10.1109/WORDS.2003.1267488","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1267488","url":null,"abstract":"Programs employed for purposes of safety related control must be formally safety licensed, which constitutes a very difficult and hitherto not satisfactorily solved problem. Striving for utmost simplicity and easy comprehensibility of verification methods, the programming methods cause/effect tables and function block diagrams based on verified libraries are assigned to the upper two Safety Integrity Levels SIL 4 and SIL 3, resp., as they are the only ones so far allowing to verify highly safety critical automation software in trustworthy, easy and economic ways. For each of the two SILs a dedicated, a low complexity execution platform is presented supporting the corresponding programming method architecturally. Their hardware is fault detecting or supervised by a fail safe logic, resp., to initiate emergency shut-downs in case of malfunctions. By design, there is no semantic gap between the programming and machine execution levels, enabling the safety licensing of application software by extremely simple, but rigorous methods, viz., diverse back translation and inspection. Operating in strictly periodic fashion, the controllers exhibit fully predictable real time behaviour.","PeriodicalId":350761,"journal":{"name":"2003 The Ninth IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"42 8 Pt 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125753360","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 : 2003-10-01DOI: 10.1109/WORDS.2003.1267506
J. Fraga, Frank Siqueira, F. Favarim
This paper presents a component model for building distributed applications with fault-tolerance requirements. The AFT-CCM model selects the configuration of replicated services during execution time based on QoS requirements specified by the user. The configuration is managed using a set of components that deal with the non-functional aspects of the application. The characteristics of this model and the results obtained with its implementation are described along this paper.
{"title":"An Adaptive Fault-Tolerant Component Model","authors":"J. Fraga, Frank Siqueira, F. Favarim","doi":"10.1109/WORDS.2003.1267506","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1267506","url":null,"abstract":"This paper presents a component model for building distributed applications with fault-tolerance requirements. The AFT-CCM model selects the configuration of replicated services during execution time based on QoS requirements specified by the user. The configuration is managed using a set of components that deal with the non-functional aspects of the application. The characteristics of this model and the results obtained with its implementation are described along this paper.","PeriodicalId":350761,"journal":{"name":"2003 The Ninth IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128423366","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 : 2003-10-01DOI: 10.1109/WORDS.2003.1267543
A. Rasche, Peter Tröger, M. Dirska, A. Polze
The ’Distributed Control Lab’ [6] at Hasso-Plattner-Institute, University of Potsdam allows experimentation with a variety of physical equipment via the web (intra and internet), among them the Lego Mindstorm robots and Foucault’s Pendulum. In order to conduct control experiments, students may write programs, which are validated, run on a simulator, and eventually downloaded on the actual control device. We use online replacement of software components (dynamic re-configuration) as a safeguard mechanism to avoid damage to our hardware. Our research focuses on the extension of middleware concepts to embedded devices. The component-based architecture of the laboratory in conjunction with given timing and safety constraints dictated by the experiments make our infrastructure an ideal candidate for studying system predictability, availability and security in context of middleware-based dynamic control systems. Within this paper we are going to describe our extensible architecture for hosting physical control experiments and focus on Foucault’s Pendulum as a case study. For the Pendulum we have implemented a dynamic recon.guration algorithm, which is able to replace erroneous user-supplied control programs with a verified safety controller at runtime. In addition we are going to discuss the design of custom-built controller hardware which allows us to meet the timing constraints of the Pendulum experiment with a commercial-off-the-shelf (COTS) operating system and middleware. Architectural characteristics of our hardware and software as well as a performance evaluation of the recon.guration process will be discussed in some detail.
{"title":"Foucault's Pendulum in the Distributed Control Lab","authors":"A. Rasche, Peter Tröger, M. Dirska, A. Polze","doi":"10.1109/WORDS.2003.1267543","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1267543","url":null,"abstract":"The ’Distributed Control Lab’ [6] at Hasso-Plattner-Institute, University of Potsdam allows experimentation with a variety of physical equipment via the web (intra and internet), among them the Lego Mindstorm robots and Foucault’s Pendulum. In order to conduct control experiments, students may write programs, which are validated, run on a simulator, and eventually downloaded on the actual control device. We use online replacement of software components (dynamic re-configuration) as a safeguard mechanism to avoid damage to our hardware. Our research focuses on the extension of middleware concepts to embedded devices. The component-based architecture of the laboratory in conjunction with given timing and safety constraints dictated by the experiments make our infrastructure an ideal candidate for studying system predictability, availability and security in context of middleware-based dynamic control systems. Within this paper we are going to describe our extensible architecture for hosting physical control experiments and focus on Foucault’s Pendulum as a case study. For the Pendulum we have implemented a dynamic recon.guration algorithm, which is able to replace erroneous user-supplied control programs with a verified safety controller at runtime. In addition we are going to discuss the design of custom-built controller hardware which allows us to meet the timing constraints of the Pendulum experiment with a commercial-off-the-shelf (COTS) operating system and middleware. Architectural characteristics of our hardware and software as well as a performance evaluation of the recon.guration process will be discussed in some detail.","PeriodicalId":350761,"journal":{"name":"2003 The Ninth IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128262559","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 : 2003-10-01DOI: 10.1109/WORDS.2003.1267494
Waseem Sheikh, Basit Shafiq, R. Paul, A. Ghafoor
Recent advances in wireless technology and availability of mobile computing devices with networking capabilities have generated a lot of interest in wireless ad hoc networks for quality of service (QoS) based multimedia applications. In this paper, we address the problem of QoS guaranteed transmission of pre-orchestrated multimedia data over multiple heterogeneous virtual channels (MHVCs) in a mobile, multihop, wireless network with no fixed infrastructure. This network consists of mobile multimedia database servers which may be connected to wired networks (e.g. ATM or Internet) via satellite links or stand alone. In order to achieve QoS guaranteed transmission, we propose a QoS routing (QoSR) protocol based on the prediction of users’ mobility profile. The proposed scheme establishes and maintains QoS guaranteed MHVCs between the source and the destination nodes for the duration of the route life time (RLT).
{"title":"Provision of Multimedia Services in a Mobile Ad Hoc Network","authors":"Waseem Sheikh, Basit Shafiq, R. Paul, A. Ghafoor","doi":"10.1109/WORDS.2003.1267494","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1267494","url":null,"abstract":"Recent advances in wireless technology and availability of mobile computing devices with networking capabilities have generated a lot of interest in wireless ad hoc networks for quality of service (QoS) based multimedia applications. In this paper, we address the problem of QoS guaranteed transmission of pre-orchestrated multimedia data over multiple heterogeneous virtual channels (MHVCs) in a mobile, multihop, wireless network with no fixed infrastructure. This network consists of mobile multimedia database servers which may be connected to wired networks (e.g. ATM or Internet) via satellite links or stand alone. In order to achieve QoS guaranteed transmission, we propose a QoS routing (QoSR) protocol based on the prediction of users’ mobility profile. The proposed scheme establishes and maintains QoS guaranteed MHVCs between the source and the destination nodes for the duration of the route life time (RLT).","PeriodicalId":350761,"journal":{"name":"2003 The Ninth IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129996879","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
扫码关注我们
求助内容：
应助结果提醒方式：