The performance of interference robust TCP (IRTCPJ. which has been aroaosed in Ill to counter the &necessaFy throughput red&on that b&curs when there is packet loss due to interference in mobile networks, is evaluated experimentally and analyzed. Its performance is compared with regular TCP under varying probabilities of occurrence of interference and varying duration of interference bursts. An experimental setup has been developed to generate and inject interference into the network in a controlled environment. A packet level observation of the entire transmission with TCP and then with IRTCP is also presented. Finally our conclusions along with the scope for future work in this area is presented.
{"title":"Experimental evaluation of throughput performance of IRTCP under noisy channels","authors":"Arun Kumar Somani, Indu Peddibhotla","doi":"10.1145/313256.313280","DOIUrl":"https://doi.org/10.1145/313256.313280","url":null,"abstract":"The performance of interference robust TCP (IRTCPJ. which has been aroaosed in Ill to counter the &necessaFy throughput red&on that b&curs when there is packet loss due to interference in mobile networks, is evaluated experimentally and analyzed. Its performance is compared with regular TCP under varying probabilities of occurrence of interference and varying duration of interference bursts. An experimental setup has been developed to generate and inject interference into the network in a controlled environment. A packet level observation of the entire transmission with TCP and then with IRTCP is also presented. Finally our conclusions along with the scope for future work in this area is presented.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"46 1","pages":"67-74"},"PeriodicalIF":0.0,"publicationDate":"1999-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87982907","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}
Enabling mobility in IP networks is an important issue for making use of the many light-weight devices appearing at the market. The IP mobility support being standardized in the IETF uses tunnelling of IP packets from a Home Agent to a Foreign Agent to make the mobility transparent to the higher layer. There are a number of problems associated with Mobile IP, such as triangular routing, each host needing a home IP address, tunnelling management, etc. In this paper, we propose to use mobility support in the application layer protocol SIP where applicable, in order to support real-time communication in a more efficient way.
{"title":"Mobility support using SIP","authors":"E. Wedlund, H. Schulzrinne","doi":"10.1145/313256.313281","DOIUrl":"https://doi.org/10.1145/313256.313281","url":null,"abstract":"Enabling mobility in IP networks is an important issue for making use of the many light-weight devices appearing at the market. The IP mobility support being standardized in the IETF uses tunnelling of IP packets from a Home Agent to a Foreign Agent to make the mobility transparent to the higher layer. There are a number of problems associated with Mobile IP, such as triangular routing, each host needing a home IP address, tunnelling management, etc. In this paper, we propose to use mobility support in the application layer protocol SIP where applicable, in order to support real-time communication in a more efficient way.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"20 1","pages":"76-82"},"PeriodicalIF":0.0,"publicationDate":"1999-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83605935","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}
A wireless ad hoc multihop network is introduced and protocols for the air interface are described and evaluated. The network nodes are assumed able to route connections according to the current radio connectivity of the network. The decentrally organized network can guarantee the bandwidth contracted to a connection (e.g. ATM connection) in a hidden station environment by means of contention-free data transmission for both, channel and packet switched services, based on real channel connections (RCCs). Channels are established and used for the duration of a so called train of data packets, released when the train ends and reestablished when the next train arrives. Most efficient use of the spectrum capacity is provided by a mechanism for dynamic channel allocation to nodes and services. To guarantee availability of network capacity for the re-establishment of a connection, connection admission control is applied considering the overall interference situation and the current radio connectivity. A performance evaluation of the proposed protocols is presented by means of a simulation study for example scenarios.
{"title":"Performance of a wireless ad hoc network supporting ATM","authors":"M. Lott, B. Walke","doi":"10.1145/313256.313269","DOIUrl":"https://doi.org/10.1145/313256.313269","url":null,"abstract":"A wireless ad hoc multihop network is introduced and protocols for the air interface are described and evaluated. The network nodes are assumed able to route connections according to the current radio connectivity of the network. The decentrally organized network can guarantee the bandwidth contracted to a connection (e.g. ATM connection) in a hidden station environment by means of contention-free data transmission for both, channel and packet switched services, based on real channel connections (RCCs). Channels are established and used for the duration of a so called train of data packets, released when the train ends and reestablished when the next train arrives. Most efficient use of the spectrum capacity is provided by a mechanism for dynamic channel allocation to nodes and services. To guarantee availability of network capacity for the re-establishment of a connection, connection admission control is applied considering the overall interference situation and the current radio connectivity. A performance evaluation of the proposed protocols is presented by means of a simulation study for example scenarios.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"51 1","pages":"18-25"},"PeriodicalIF":0.0,"publicationDate":"1999-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73962399","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}
We present a loop-free routing protocol for ad hoc mobile networks. The protocol is highly adaptive, efficient and scaleable; and is well-suited in large mobile networks whose rate of topological changes is moderate. A key concept in its design is that protocol reaction to link failures is typically localised to a very small region of the network near the change. This desirable behaviour is achieved through the use of a novel mechanism for route discovery, called Relative Distance Micro-discovery (RDM). The concept behind RDM is that a query flood can be localised by knowing the relative distance (RD) between two terminals. To accomplish this, every time a route search between the two terminals is triggered, an iterative algorithm calculates an estimate of their RD, given an average nodal mobility and information about the elapsed time since they last communicated and their previous RD. Based on the newly calculated RD, the query flood is then localised to a limited region of the network centred at the source node of the route discovery and with maximum propagation radius that equals to the estimated relative distance. This ability to localise query flooding into a limited area of the network serves to minimise routing overhead and overall network congestion. Simulation results illustrate its performance and demonstrate its good behaviour comparing to other protocols proposed by IETF Working Group. We refer to the protocol as the Relative Distance Micro-discovery Ad Hoc Routing (RDMAR) protocol.
{"title":"RDMAR: a bandwidth-efficient routing protocol for mobile ad hoc networks","authors":"G. Aggelou, R. Tafazolli","doi":"10.1145/313256.313272","DOIUrl":"https://doi.org/10.1145/313256.313272","url":null,"abstract":"We present a loop-free routing protocol for ad hoc mobile networks. The protocol is highly adaptive, efficient and scaleable; and is well-suited in large mobile networks whose rate of topological changes is moderate. A key concept in its design is that protocol reaction to link failures is typically localised to a very small region of the network near the change. This desirable behaviour is achieved through the use of a novel mechanism for route discovery, called Relative Distance Micro-discovery (RDM). The concept behind RDM is that a query flood can be localised by knowing the relative distance (RD) between two terminals. To accomplish this, every time a route search between the two terminals is triggered, an iterative algorithm calculates an estimate of their RD, given an average nodal mobility and information about the elapsed time since they last communicated and their previous RD. Based on the newly calculated RD, the query flood is then localised to a limited region of the network centred at the source node of the route discovery and with maximum propagation radius that equals to the estimated relative distance. This ability to localise query flooding into a limited area of the network serves to minimise routing overhead and overall network congestion. Simulation results illustrate its performance and demonstrate its good behaviour comparing to other protocols proposed by IETF Working Group. We refer to the protocol as the Relative Distance Micro-discovery Ad Hoc Routing (RDMAR) protocol.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"1 1","pages":"26-33"},"PeriodicalIF":0.0,"publicationDate":"1999-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82864908","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}
Efforts are underway to enhance the htemet with Qtiiq ofService (QoS) =pabfiti=for transporting ~-time dah The Reservation Protocol -) provides a signdhtg sn~anism for end-to-end QoS negotiation. The “He of wireless networks and mobde hosts being able to support mtitimedia appfications~evoice and video that quim QoS has become very signiticanti Reservation of -urces and the maintenance of QoS for the mobde as it mov= from one region to another creaanew set of Menges. Apart from resource -ervation, there is a need for muting techniqu= which help in faster handoff so that QoS can be maintaind. k this paper, a hierarchic archititi based on the mncept of QoS-domains and routing-domains is proposal The architecture W help in maintaining QoS and providing fast handofi in wiml=networh The arcbitec~ uses amoditied RSVP protocol that helps provide QoS support formobde hosts. The moditiedRSVP protocol has been implemented in an qerimenti wireland mobiietibed to t*thefeasibii& and perforrnanm of our approah The qerirnenti ~ts show that the motied RSVP helps in sa@ing wource quests for mobde hosts, after hand-off ocThe implementation of a muting architecb that uses mobde ~ and mute table changes is discussed and its “incorporation into the ~erimenti @tbed is being worked on. Permission to make digital or hard copies ofdl or part of this vork for personal or cl=oom use is-ted without fee protided that copies are not made or dis~iuted for profit or commercial admtage and fiat copiw b=r MS notice and the full citation on the fmt page. To copy othmis% to repubfish, to post on senrers or to redistribute to ~its, requir~ prior sptific permission an&’ora f= lVOl~fOM 98 Dtias TUSA . Copyright Am 1998 1-58113493-7/98/10.-S5.00 b
人们正在努力用服务质量(QoS) =pabfiti=传输~ time - dah来增强互联网。保留协议(Reservation Protocol)为端到端QoS协商提供了一种信令机制。无线网络和移动主机能够支持多媒体应用、语音和视频的QoS要求已经变得非常重要，而移动设备在从一个地区移动到另一个地区时，对信号源的保留和QoS的维护创造了一套新的要求。除了资源预留之外，还需要静音技术，这有助于更快地切换，从而可以维护QoS。本文提出了一种基于QoS域和路由域概念的分层架构，该架构有助于在wimr网络中保持QoS并提供快速的手动传输，该架构使用改进的RSVP协议，有助于为模式主机提供QoS支持。修改后的RSVP协议已经在一个测试中实现，该测试用于测试我们的方法的可行性和性能。测试表明，修改后的RSVP有助于在切换后对mobde主机进行sa@ing源请求。讨论了使用mobde和静音表更改的静音架构的实现，并正在研究将其合并到该测试中。允许您免费制作本作品或部分作品的数字或硬拷贝供个人或房间使用，前提是不为盈利或商业利益而制作或分发副本，并在fmt页面上提供法定副本/ MS通知和完整引用。要复制他人的文章以重新发布，在发送者上发布或重新分发到其上，需要事先获得明确的许可，并获得98 Dtias TUSA的许可。版权所有am1998 1-58113493 / 7/98/10 - s5.00 b
{"title":"An architecture for QoS guarantees and routing in wireless/mobile networks","authors":"I. Mahadevan, K. Sivalingam","doi":"10.1145/288338.288355","DOIUrl":"https://doi.org/10.1145/288338.288355","url":null,"abstract":"Efforts are underway to enhance the htemet with Qtiiq ofService (QoS) =pabfiti=for transporting ~-time dah The Reservation Protocol -) provides a signdhtg sn~anism for end-to-end QoS negotiation. The “He of wireless networks and mobde hosts being able to support mtitimedia appfications~evoice and video that quim QoS has become very signiticanti Reservation of -urces and the maintenance of QoS for the mobde as it mov= from one region to another creaanew set of Menges. Apart from resource -ervation, there is a need for muting techniqu= which help in faster handoff so that QoS can be maintaind. k this paper, a hierarchic archititi based on the mncept of QoS-domains and routing-domains is proposal The architecture W help in maintaining QoS and providing fast handofi in wiml=networh The arcbitec~ uses amoditied RSVP protocol that helps provide QoS support formobde hosts. The moditiedRSVP protocol has been implemented in an qerimenti wireland mobiietibed to t*thefeasibii& and perforrnanm of our approah The qerirnenti ~ts show that the motied RSVP helps in sa@ing wource quests for mobde hosts, after hand-off ocThe implementation of a muting architecb that uses mobde ~ and mute table changes is discussed and its “incorporation into the ~erimenti @tbed is being worked on. Permission to make digital or hard copies ofdl or part of this vork for personal or cl=oom use is-ted without fee protided that copies are not made or dis~iuted for profit or commercial admtage and fiat copiw b=r MS notice and the full citation on the fmt page. To copy othmis% to repubfish, to post on senrers or to redistribute to ~its, requir~ prior sptific permission an&’ora f= lVOl~fOM 98 Dtias TUSA . Copyright Am 1998 1-58113493-7/98/10.-S5.00 b","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"13 1","pages":"11-20"},"PeriodicalIF":0.0,"publicationDate":"1998-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84247171","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 widespread deployment of wired md wirdess networks in both hotiont d md vertid overlays presents new OP portunities and ddenges for devdopers of servic=. Users of these networks have mdtiple end devicw, some of whi& are mobde, whi~ compfi~tes (and sometimes prevents) the transparent use of servica ~oss the networks. This paper presents an artite~e for enabbg the dynamic handoff of dive services moss mdtiple networks (stied networks). The artitetie supports the rapid devdopment of inno~ative new servicw ad enabl~ the use of stic~ ad user-spetic po~ties for -coding and routing information between networks. These pofities dow services to determine the %est” mode and route to use in r-g a partitiar user. The artitetie destibed in this paper is being btit on top of a wpwwide testbed consisting of GSII digitd c~tiar, wirdess and wired E, and pubfic switched tdephone networks. An example appfimtion has been construtied to demonstrate the utfity of the artitecture.
{"title":"The case for services over cascaded networks","authors":"A. Joseph, B. R. Badrinath, R. Katz","doi":"10.1145/288338.288351","DOIUrl":"https://doi.org/10.1145/288338.288351","url":null,"abstract":"The widespread deployment of wired md wirdess networks in both hotiont d md vertid overlays presents new OP portunities and ddenges for devdopers of servic=. Users of these networks have mdtiple end devicw, some of whi& are mobde, whi~ compfi~tes (and sometimes prevents) the transparent use of servica ~oss the networks. This paper presents an artite~e for enabbg the dynamic handoff of dive services moss mdtiple networks (stied networks). The artitetie supports the rapid devdopment of inno~ative new servicw ad enabl~ the use of stic~ ad user-spetic po~ties for -coding and routing information between networks. These pofities dow services to determine the %est” mode and route to use in r-g a partitiar user. The artitetie destibed in this paper is being btit on top of a wpwwide testbed consisting of GSII digitd c~tiar, wirdess and wired E, and pubfic switched tdephone networks. An example appfimtion has been construtied to demonstrate the utfity of the artitecture.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"54 1","pages":"2-10"},"PeriodicalIF":0.0,"publicationDate":"1998-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76467887","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}
This paper presents a framework for provisioning application and channd dependent qu~ty of service in wirdess network-. The framework is based on three Merent adap tation me~anisms that operate over distinct adaptation time scd=. At the pa&et transmission time sc~e, channd prediction determines whether to transmit a packet or not depending on the state of the wird= channd. At the packet schedfig time scale, a channel state dependent schedder compensates flows that experience bad W qurdity wMe attempting to maintain minimum bandwidth G surances. The packet schedfig scheme is complemented by an app~cation-specitic adaptation mechanism that operates over longer time sc~es and takes into account the abdity of fidess app~cations to adapt to changes in adable bandwidth and channd conditions. U*e packet schedding, adaptation takea into account appKcation-levd semantiw and operates over time scales that can be programmed by USfl.
{"title":"A systems approach to prediction, compensation and adaptation in wireless networks","authors":"Javier Gomez, A. Campbell, H. Morikawa","doi":"10.1145/288338.288388","DOIUrl":"https://doi.org/10.1145/288338.288388","url":null,"abstract":"This paper presents a framework for provisioning application and channd dependent qu~ty of service in wirdess network-. The framework is based on three Merent adap tation me~anisms that operate over distinct adaptation time scd=. At the pa&et transmission time sc~e, channd prediction determines whether to transmit a packet or not depending on the state of the wird= channd. At the packet schedfig time scale, a channel state dependent schedder compensates flows that experience bad W qurdity wMe attempting to maintain minimum bandwidth G surances. The packet schedfig scheme is complemented by an app~cation-specitic adaptation mechanism that operates over longer time sc~es and takes into account the abdity of fidess app~cations to adapt to changes in adable bandwidth and channd conditions. U*e packet schedding, adaptation takea into account appKcation-levd semantiw and operates over time scales that can be programmed by USfl.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"17 1","pages":"92-100"},"PeriodicalIF":0.0,"publicationDate":"1998-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81276707","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}
1. ~STWCT Rwent developments in wireless conummimtions have made it possible to provide mtitimedia services for mobtie users. However, mtitimedia servic~that is a m-e of different content ~es including te~ images, audio, and vide=ver wireless W require that the underlying wireless infrastructure supports some kind of Q@tyof-Service concepts and Werent trtic classes. Since many of the current wireless technologies do not support those concepts, we introduce a way of adapting mobtie wireless networks so that some aspects of Qutity-ofService and traffic classw -be supported even if the underlying infrastructure does not support them. Our Nlobfle Network Adapters can overcome most of the titations due to protocol architectures. However, they m not augment the physid characteristic of the underlying technology but they try to use the avtiable resources in the most appropriate way. Our prototype implementation indicates that priori@based mtitipletig of traffic is useti for delivering rd-time and non-rdtime data to and from a mobde terminal. Our solution is able to support both seandess and
{"title":"Introducing quality-of-service and traffic classes into wireless mobile networks","authors":"Jarkko Sevanto, M. Liljeberg, K. Raatikainen","doi":"10.1145/288338.288358","DOIUrl":"https://doi.org/10.1145/288338.288358","url":null,"abstract":"1. ~STWCT Rwent developments in wireless conummimtions have made it possible to provide mtitimedia services for mobtie users. However, mtitimedia servic~that is a m-e of different content ~es including te~ images, audio, and vide=ver wireless W require that the underlying wireless infrastructure supports some kind of Q@tyof-Service concepts and Werent trtic classes. Since many of the current wireless technologies do not support those concepts, we introduce a way of adapting mobtie wireless networks so that some aspects of Qutity-ofService and traffic classw -be supported even if the underlying infrastructure does not support them. Our Nlobfle Network Adapters can overcome most of the titations due to protocol architectures. However, they m not augment the physid characteristic of the underlying technology but they try to use the avtiable resources in the most appropriate way. Our prototype implementation indicates that priori@based mtitipletig of traffic is useti for delivering rd-time and non-rdtime data to and from a mobde terminal. Our solution is able to support both seandess and","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"51 1","pages":"21-29"},"PeriodicalIF":0.0,"publicationDate":"1998-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85838998","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}
We investigate speculative prefetching under a model in which prefetching is neither aborted nor preempted by demand fetch but instead gets equal priority in network bandwidth utilisation. We argue that the non-abortive assumption is appropriate for wireless networks where bandwidth is low and latency is high, and the non-preemptive assumption is appropriate for Internet where prioritization is not always possible. This paper assumes the existence of an access model to provide some knowledge about future accesses and investigates analytically the performance of a prefetcher that utilises this knowledge. In mobile computing, because resources are severely constrained, performance prediction is as important as access prediction. For uniform retrieval time, we derive a theoretical limit of improvement in access time due to prefetching. This leads to the formulation of an optimal algorithrn for prefetching one access ahead. For non-uniform retrieval time, two different types of prefetching of multiple documents, namely mainline and branch prefetch, are evaluated against prefetch of single document. In mainline prefetch, the most probable sequence of future accesses is prefetched. In branch prefetch, a set of different alternatives for future accesses is prefetched. Under some conditions, mainline prefetch may give slight improvement in user-perceived access time over single prefetch with nominal extra retrieval cost, where retrieval cost is defined as the expected network time wasted in non-useful prefetch. Branch prefetch performs better than mainline prefetch but incurs more retrieval cost.
{"title":"Investigation of a prefetch model for low bandwidth networks","authors":"N. Tuah, Mohan J. Kumar, S. Venkatesh","doi":"10.1145/288338.288368","DOIUrl":"https://doi.org/10.1145/288338.288368","url":null,"abstract":"We investigate speculative prefetching under a model in which prefetching is neither aborted nor preempted by demand fetch but instead gets equal priority in network bandwidth utilisation. We argue that the non-abortive assumption is appropriate for wireless networks where bandwidth is low and latency is high, and the non-preemptive assumption is appropriate for Internet where prioritization is not always possible. This paper assumes the existence of an access model to provide some knowledge about future accesses and investigates analytically the performance of a prefetcher that utilises this knowledge. In mobile computing, because resources are severely constrained, performance prediction is as important as access prediction. For uniform retrieval time, we derive a theoretical limit of improvement in access time due to prefetching. This leads to the formulation of an optimal algorithrn for prefetching one access ahead. For non-uniform retrieval time, two different types of prefetching of multiple documents, namely mainline and branch prefetch, are evaluated against prefetch of single document. In mainline prefetch, the most probable sequence of future accesses is prefetched. In branch prefetch, a set of different alternatives for future accesses is prefetched. Under some conditions, mainline prefetch may give slight improvement in user-perceived access time over single prefetch with nominal extra retrieval cost, where retrieval cost is defined as the expected network time wasted in non-useful prefetch. Branch prefetch performs better than mainline prefetch but incurs more retrieval cost.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"41 1","pages":"38-47"},"PeriodicalIF":0.0,"publicationDate":"1998-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88622330","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}
Abshact — The Performance of Wireless mdt“media Networks depends on having a rbust error control scheme and eficient/refiable network transport. This paper presents a new analytic framework for determining g the performance of asynchronous spread spectrum mtitipleaccess networks that uses a hybrid ARQ protocol. The enhanced protocol (de scribed in this paper) can be further used in this mdtiple access network (-d other networks) to provide higher capacity for the network and less time for users to use the commtication M. The two techniques provide the capabilities of investigating different wir+ less mdti-media and mtitipleaccess networks with variety of retransmission protocob, prot~ COIenhancements, and channel conditions.
{"title":"Protocol enhancements in wireless multimedia and multiple-access networks","authors":"A. Daraiseh","doi":"10.1145/288338.288383","DOIUrl":"https://doi.org/10.1145/288338.288383","url":null,"abstract":"Abshact — The Performance of Wireless mdt“media Networks depends on having a rbust error control scheme and eficient/refiable network transport. This paper presents a new analytic framework for determining g the performance of asynchronous spread spectrum mtitipleaccess networks that uses a hybrid ARQ protocol. The enhanced protocol (de scribed in this paper) can be further used in this mdtiple access network (-d other networks) to provide higher capacity for the network and less time for users to use the commtication M. The two techniques provide the capabilities of investigating different wir+ less mdti-media and mtitipleaccess networks with variety of retransmission protocob, prot~ COIenhancements, and channel conditions.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"115 1","pages":"68-72"},"PeriodicalIF":0.0,"publicationDate":"1998-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87950032","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
扫码关注我们
求助内容：
应助结果提醒方式：