首页 | 本学科首页   官方微博 | 高级检索  
     


Data Transfer for HIPERLAN
Authors:Jacquet  Philippe  Minet  Pascale  Mühlethaler  Paul  Rivierre  Nicolas
Affiliation:(1) INRIA, Le Chesnay, France
Abstract:HIPERLAN offers a high speed (23.5 Mbit/s) radio LAN and therefore HIPERLAN is likely to support various kinds of traffic requirements. A Data Transfer function is in charge of handling various traffics which can result in simultaneous services. HIPERLAN nodes are not necessarily within direct radio range; and in some cases packets are forwarded by intermediate stations from the source node to the destination node. Since HIPERLAN is more than a single hop network, the support of specific traffics like Time Bounded traffics require a dedicated architecture which can not be centralized. This paper describes the architecture of the Data Transfer in HIPERLAN which allows the support of various traffics. This approach is not based on a connection oriented protocol nor on a centralized architecture but on a connection-less mode where users provide quality of services parameters to indicate its requirements. HIPERLAN architecture for data transfer is based on a mix of two main mechanisms: hierarchically independent priority levels and an earliest dead line first algorithm. This paper describes and explains the architecture choices made in HIPERLAN. Results of simulation and analytical models are given.
Keywords:HIPERLAN  data transfer  time bounded services  QoS parameters  access priority scheme  deadline  Earliest Deadline First algorithm (EDF)
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号