Pub Date : 2002-07-01DOI: 10.1109/ISCC.2002.1021793
Gergely Seres, Árpád Szlávik, J. Zátonyi, J. Bíró
This paper identifies the requirements placed against a resource manager function for use in QoS-enabled IP networks. The structure of the Internet and the composition of the services motivate the development of on-line resource brokers that can make admission decisions in real time, based on the best up-to-date information available on the state of the network. The difficulties with traffic models and traffic characterisation stimulate the use of measurement-based techniques that bypass the modelling step and provide the resource requirements of the traffic directly. The paper introduces a novel method for the computation of the bandwidth requirement of Internet traffic flows using the many sources asymptotics. The estimator method significantly reduces the computational complexity of the calculations, allowing the real-time operation of the algorithm even in a measurement-based environment. The method delivers bandwidth-type quantity, the format preferred by Internet control applications. The savings arising from the reduced computational complexity compared to existing methods are demonstrated in a numerical example.
{"title":"Alternative admission rules based on the many sources asymptotics","authors":"Gergely Seres, Árpád Szlávik, J. Zátonyi, J. Bíró","doi":"10.1109/ISCC.2002.1021793","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021793","url":null,"abstract":"This paper identifies the requirements placed against a resource manager function for use in QoS-enabled IP networks. The structure of the Internet and the composition of the services motivate the development of on-line resource brokers that can make admission decisions in real time, based on the best up-to-date information available on the state of the network. The difficulties with traffic models and traffic characterisation stimulate the use of measurement-based techniques that bypass the modelling step and provide the resource requirements of the traffic directly. The paper introduces a novel method for the computation of the bandwidth requirement of Internet traffic flows using the many sources asymptotics. The estimator method significantly reduces the computational complexity of the calculations, allowing the real-time operation of the algorithm even in a measurement-based environment. The method delivers bandwidth-type quantity, the format preferred by Internet control applications. The savings arising from the reduced computational complexity compared to existing methods are demonstrated in a numerical example.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133980271","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021768
M. Gerla, Yeng-Zhong Lee, R. Kapoor, T. Kwon, A. Zanella
The standards that are supposed to play a leading role in third-generation mobile telecommunication and personal area networks in the near future are the Universal Mobile Telecommunication System (UMTS) and the Bluetooth (BT) radio technology, respectively. In this paper, we advocate that a hybrid architecture of UMTS and Bluetooth can take advantage of the complementary characteristics of these two technologies and provide a total solution for an indoor communication environment. We envision a cooperating scenario in which small Bluetooth networks (scatternets) offer basic wireless connectivity to several peripheral units scattered over small areas, while indoor UMTS supports communication among scatternets and provides wireless access to the Internet. We focus our analysis on a centralized topology, in which communication occurs only between the peripheral units and the access point. This topology can be used in many different application scenarios and represents an example of cooperation between 3G and PAN technologies. In addition to describing the architecture, we address the issue of fair capacity allocation in such a centralized topology and provide some analytic and simulation results for the topology considered.
{"title":"UMTS-TDD: a solution for internetworking Bluetooth piconets in indoor environments","authors":"M. Gerla, Yeng-Zhong Lee, R. Kapoor, T. Kwon, A. Zanella","doi":"10.1109/ISCC.2002.1021768","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021768","url":null,"abstract":"The standards that are supposed to play a leading role in third-generation mobile telecommunication and personal area networks in the near future are the Universal Mobile Telecommunication System (UMTS) and the Bluetooth (BT) radio technology, respectively. In this paper, we advocate that a hybrid architecture of UMTS and Bluetooth can take advantage of the complementary characteristics of these two technologies and provide a total solution for an indoor communication environment. We envision a cooperating scenario in which small Bluetooth networks (scatternets) offer basic wireless connectivity to several peripheral units scattered over small areas, while indoor UMTS supports communication among scatternets and provides wireless access to the Internet. We focus our analysis on a centralized topology, in which communication occurs only between the peripheral units and the access point. This topology can be used in many different application scenarios and represents an example of cooperation between 3G and PAN technologies. In addition to describing the architecture, we address the issue of fair capacity allocation in such a centralized topology and provide some analytic and simulation results for the topology considered.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128794981","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021701
L. Mengual, N. Barcia, E. Jiménez, Ernestina Menasalvas Ruiz, J. Setien, J. Yágüez
We present an automatic implementation system of security protocols based in formal description techniques. A sufficiently complete and concise formal specification that has allowed us to define the state machine that corresponds to a security protocol has been designed to achieve our goals. This formal specification makes it possible to incorporate in a flexible way the security mechanisms and functions (random numbers generation, timestamps, symmetric-key encryption, public-key cryptography, etc). Our solution implies the incorporation of an additional security layer LEI (Logical Element of Implementation) in the TCP/IP architecture. This additional layer be able both to interpret and to implement any security protocol from its formal specification. Our system provides an applications programming interface (API) for the development of distributed applications in the Internet like the e-commerce, bank transfers, network management or distribution information services that makes transparent to them the problem of security in the communications.
{"title":"Automatic implementation system of security protocols based on formal description techniques","authors":"L. Mengual, N. Barcia, E. Jiménez, Ernestina Menasalvas Ruiz, J. Setien, J. Yágüez","doi":"10.1109/ISCC.2002.1021701","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021701","url":null,"abstract":"We present an automatic implementation system of security protocols based in formal description techniques. A sufficiently complete and concise formal specification that has allowed us to define the state machine that corresponds to a security protocol has been designed to achieve our goals. This formal specification makes it possible to incorporate in a flexible way the security mechanisms and functions (random numbers generation, timestamps, symmetric-key encryption, public-key cryptography, etc). Our solution implies the incorporation of an additional security layer LEI (Logical Element of Implementation) in the TCP/IP architecture. This additional layer be able both to interpret and to implement any security protocol from its formal specification. Our system provides an applications programming interface (API) for the development of distributed applications in the Internet like the e-commerce, bank transfers, network management or distribution information services that makes transparent to them the problem of security in the communications.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130820284","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021728
M. Mosko, J. Garcia-Luna-Aceves
We study the performance of reliable and unreliable all-node broadcast over ad-hoc networks that use contention-based channel access. To obtain analytical results while preserving hidden-terminal and node clustering characteristics of ad-hoc networks, we introduce a novel differential-equation fluid model for information flow through a network of cluster trees, where a spanning tree joins groups of fully connected nodes. Through numerical analysis and simulations in GloMoSim, we show throughput, goodput, and loss rates for reliable and unreliable networks. For reliable broadcast, we also find NAK rates, NAK loss rates, and retransmission rates. We show that using end-to-end sequence numbers, which are common in reliable multicast, for NAK generation in ad-hoc networks creates substantial unnecessary traffic.
{"title":"Performance of group communication over ad-hoc networks","authors":"M. Mosko, J. Garcia-Luna-Aceves","doi":"10.1109/ISCC.2002.1021728","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021728","url":null,"abstract":"We study the performance of reliable and unreliable all-node broadcast over ad-hoc networks that use contention-based channel access. To obtain analytical results while preserving hidden-terminal and node clustering characteristics of ad-hoc networks, we introduce a novel differential-equation fluid model for information flow through a network of cluster trees, where a spanning tree joins groups of fully connected nodes. Through numerical analysis and simulations in GloMoSim, we show throughput, goodput, and loss rates for reliable and unreliable networks. For reliable broadcast, we also find NAK rates, NAK loss rates, and retransmission rates. We show that using end-to-end sequence numbers, which are common in reliable multicast, for NAK generation in ad-hoc networks creates substantial unnecessary traffic.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128311149","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021667
Ashraf Awad, M. W. McKinnon, Raghupathy Sivakumar
We present an algorithm to estimate analytically the frame goodput of a correlated MPEG-2 video source that traverses a first network node's buffer; where frame goodput is defined as the ratio of the number of cells in completely and correctly transmitted frames through the buffer to the total number of cells arriving at the buffer. The effect on the frame goodput of changing the output-to-input line speeds is also investigated. By using this algorithm, a buffer that is three times the maximum frame size is seen to yield loss probability of 10/sup -6/ at a normalized output line rate of 0.28 for a load of 20%. A maximum simulation error margin of /spl plusmn/30% for values of the order of 10/sup -5/ with a 98% confidence was achieved.
{"title":"Goodput estimation for an access node buffer carrying correlated video traffic","authors":"Ashraf Awad, M. W. McKinnon, Raghupathy Sivakumar","doi":"10.1109/ISCC.2002.1021667","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021667","url":null,"abstract":"We present an algorithm to estimate analytically the frame goodput of a correlated MPEG-2 video source that traverses a first network node's buffer; where frame goodput is defined as the ratio of the number of cells in completely and correctly transmitted frames through the buffer to the total number of cells arriving at the buffer. The effect on the frame goodput of changing the output-to-input line speeds is also investigated. By using this algorithm, a buffer that is three times the maximum frame size is seen to yield loss probability of 10/sup -6/ at a normalized output line rate of 0.28 for a load of 20%. A maximum simulation error margin of /spl plusmn/30% for values of the order of 10/sup -5/ with a 98% confidence was achieved.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"93 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132909211","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021691
H. T. Kung, Koan-Sin Tan, P. Hsiao
This paper describes a congestion control method for TCP that adjusts the transmission rate of a TCP connection not only by changing the congestion window size as in normal TCP, but also by delaying the transmission of packets at the sender. We refer to this mechanism as TCP with sender-based delay control, or simply SDC. SDC can keep the window size of a TCP connection above a certain threshold even when its fair share of bandwidth is arbitrarily small. Since TCP fast retransmit and recovery is likely to work when the window size of the connection is sufficiently large, the new scheme can result in reduced-frequency of TCP timeouts for the connection. In particular, SDC allows many TCP flows to share a link without experiencing many timeouts. In addition, SDC reduces a well-known TCP bias against connections with large round trip times. The paper presents the principle behind SDC and simulation results demonstrating its properties and advantages.
{"title":"TCP with sender-based delay control","authors":"H. T. Kung, Koan-Sin Tan, P. Hsiao","doi":"10.1109/ISCC.2002.1021691","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021691","url":null,"abstract":"This paper describes a congestion control method for TCP that adjusts the transmission rate of a TCP connection not only by changing the congestion window size as in normal TCP, but also by delaying the transmission of packets at the sender. We refer to this mechanism as TCP with sender-based delay control, or simply SDC. SDC can keep the window size of a TCP connection above a certain threshold even when its fair share of bandwidth is arbitrarily small. Since TCP fast retransmit and recovery is likely to work when the window size of the connection is sufficiently large, the new scheme can result in reduced-frequency of TCP timeouts for the connection. In particular, SDC allows many TCP flows to share a link without experiencing many timeouts. In addition, SDC reduces a well-known TCP bias against connections with large round trip times. The paper presents the principle behind SDC and simulation results demonstrating its properties and advantages.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132601613","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021670
S. Porcarelli, F. Giandomenico, A. Bondavalli
With reference to the General Packet Radio Service (GPRS), an extension of the Global System for Mobile Communication (GSM) addressing packet-oriented traffic, this paper contributes to the analysis of the service accomplishment level perceived by GPRS users. The proposed modeling approach builds separately the GPRS and user models; the focus is on the GPRS random access procedure on the one side, and different classes of user behavior on the other side. The overall model is composed of the basic submodels. Quantitative analysis, performed using a simulation approach, is carried out, showing the impact of users' characteristics and network load on identified indicators expressing the QoS as perceived by users.
{"title":"Analyzing quality of service of GPRS network systems from a user's perspective","authors":"S. Porcarelli, F. Giandomenico, A. Bondavalli","doi":"10.1109/ISCC.2002.1021670","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021670","url":null,"abstract":"With reference to the General Packet Radio Service (GPRS), an extension of the Global System for Mobile Communication (GSM) addressing packet-oriented traffic, this paper contributes to the analysis of the service accomplishment level perceived by GPRS users. The proposed modeling approach builds separately the GPRS and user models; the focus is on the GPRS random access procedure on the one side, and different classes of user behavior on the other side. The overall model is composed of the basic submodels. Quantitative analysis, performed using a simulation approach, is carried out, showing the impact of users' characteristics and network load on identified indicators expressing the QoS as perceived by users.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131474471","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021730
K. Viswanath, K. Obraczka
The diverse nature of MANETs makes it almost impossible for a single routing protocol to perform well under a wide range of operating conditions. Therefore the solution may be to adopt an adaptive strategy to routing and the co-existence and interoperability of different routing protocols. Considering that MANETs are generally deployed in mission critical applications the adaptive protocol should be capable of providing high reliability and timeliness guarantees in the presence of mobility. To this end we develop an adaptive flooding protocol in which nodes can dynamically switch routing mechanisms based on their perspective of network conditions. We use relative velocity as the switching criterion. Each node periodically computes its velocity relative to that of its neighbor set and based on its computation switches to one of the three modes, i.e. scoped flooding, plain flooding or hyper flooding modes. Simulations using our adaptive protocol under various realistic scenarios have shown that such protocols provide impressive benefits and can be used as the basis for developing adaptive, integrated routing techniques for MANETs of the future.
{"title":"An adaptive approach to group communications in multi hop ad hoc networks","authors":"K. Viswanath, K. Obraczka","doi":"10.1109/ISCC.2002.1021730","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021730","url":null,"abstract":"The diverse nature of MANETs makes it almost impossible for a single routing protocol to perform well under a wide range of operating conditions. Therefore the solution may be to adopt an adaptive strategy to routing and the co-existence and interoperability of different routing protocols. Considering that MANETs are generally deployed in mission critical applications the adaptive protocol should be capable of providing high reliability and timeliness guarantees in the presence of mobility. To this end we develop an adaptive flooding protocol in which nodes can dynamically switch routing mechanisms based on their perspective of network conditions. We use relative velocity as the switching criterion. Each node periodically computes its velocity relative to that of its neighbor set and based on its computation switches to one of the three modes, i.e. scoped flooding, plain flooding or hyper flooding modes. Simulations using our adaptive protocol under various realistic scenarios have shown that such protocols provide impressive benefits and can be used as the basis for developing adaptive, integrated routing techniques for MANETs of the future.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"172 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131967286","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021758
P. Bellavista, Antonio Corradi, Silvia Vecchi
The convergence of mobile telecommunications and the Internet global system forces us to reconsider traditional client/server solutions for network and systems management. The paper claims that accounting in the mobility-enabled Internet requires support infrastructures hosted in the fixed network. These infrastructures should monitor, control and register resource consumption locally within the domains where users/terminals dynamically move to, without requiring continuous connectivity with remote and centralized accounting home managers. In addition, the paper shows that the mobile agent (MA) technology is suitable to overcome the limits of traditional accounting solutions in several mobility-enabled usage scenarios. MA can maximize locality in accessing monitoring data, can enable accounting even in case of temporary disconnection, can install new monitoring/control behavior dynamically, and can support session-dependent solutions. The paper finally presents the design and implementation of the MA-based Middleware for Mobility Accounting Management (MAM/sup 2/), together with some use cases showing the advantages of the MA adoption.
{"title":"Mobile agent solutions for accounting management in mobile computing","authors":"P. Bellavista, Antonio Corradi, Silvia Vecchi","doi":"10.1109/ISCC.2002.1021758","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021758","url":null,"abstract":"The convergence of mobile telecommunications and the Internet global system forces us to reconsider traditional client/server solutions for network and systems management. The paper claims that accounting in the mobility-enabled Internet requires support infrastructures hosted in the fixed network. These infrastructures should monitor, control and register resource consumption locally within the domains where users/terminals dynamically move to, without requiring continuous connectivity with remote and centralized accounting home managers. In addition, the paper shows that the mobile agent (MA) technology is suitable to overcome the limits of traditional accounting solutions in several mobility-enabled usage scenarios. MA can maximize locality in accessing monitoring data, can enable accounting even in case of temporary disconnection, can install new monitoring/control behavior dynamically, and can support session-dependent solutions. The paper finally presents the design and implementation of the MA-based Middleware for Mobility Accounting Management (MAM/sup 2/), together with some use cases showing the advantages of the MA adoption.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"245 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131880969","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 : 2002-07-01DOI: 10.1109/ISCC.2002.1021698
Iara Augustin, A. Yamin, J. Barbosa, C. Geyer
Mobile computing has emerged as a new field, distinct from conventional distributed computing by its focus on mobility and its consequence. The physical and logical mobility needs of applications with new requirements: built-in mobility, adaptability and flexibility. Providing a system architecture that simplifies the task of implementing the mobile applications with adaptive behavior is the objective of the ongoing ISAM project. In order to achieve its goal, ISAM uses, as strategies, an integrated environment that: (a) provides a programming paradigm and its execution environment; (b) treats of adaptation process through multilevel collaborative model, in which both the system and the application contribute for that. We present the ISAM architecture and introduce the relative issues to the treatment of adaptive mobile applications.
{"title":"ISAM, a software architecture for adaptive and distributed mobile applications","authors":"Iara Augustin, A. Yamin, J. Barbosa, C. Geyer","doi":"10.1109/ISCC.2002.1021698","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021698","url":null,"abstract":"Mobile computing has emerged as a new field, distinct from conventional distributed computing by its focus on mobility and its consequence. The physical and logical mobility needs of applications with new requirements: built-in mobility, adaptability and flexibility. Providing a system architecture that simplifies the task of implementing the mobile applications with adaptive behavior is the objective of the ongoing ISAM project. In order to achieve its goal, ISAM uses, as strategies, an integrated environment that: (a) provides a programming paradigm and its execution environment; (b) treats of adaptation process through multilevel collaborative model, in which both the system and the application contribute for that. We present the ISAM architecture and introduce the relative issues to the treatment of adaptive mobile applications.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129582811","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
扫码关注我们
求助内容：
应助结果提醒方式：