IEEE 802.11移动自组织网络节点竞争窗口长度的概率分布

 在基于IEEE 802.11的移动自组织网络中,MAC(Medium Access Control)层提供了DCF(Distributed Coordinate Function)以控制节点对无线信道的争用.DCF包括了BEB (Binary Exponential Backoff)算法.该文对BEB的重要参数——竞争窗口CW(Contention Window)进行研究,通过随机建模,导出了竞争窗口长度的概率分布,并进行数值分析.研究结果可应用于IEEE 802.11移动自组织网络.     

A review of routing strategies for optical burst switched networks

The exact contribution of this paper is a review of existing state‐of‐the‐art routing strategies for optical burst switched networks developed by researchers to deal with burst contention before it happens. Routing schemes are implemented in space domain, which make them simple and cost effective. Additionally, the paper points out the importance of routing as an effective way to deal with burst contention compared to other solutions. It also underlines the main differences between contention avoidance schemes and contention resolution techniques for optical burst switched networks. We believe that this review will help different optical burst switched researchers involved in the development of route optimization algorithms to control burst contention. Copyright © 2011 John Wiley & Sons, Ltd.     

Analysis of PLR for Shared Switch Fabrics

A modular upgrade design for packet transport switch nodes is presented where packet loss is dramatically reduced by intra‐module and inter‐module buffer sharing. This modular design offers significant cost and power reduction in a high‐data‐rate system where buffers are highly costly and power‐greedy.     

Axiomatizing the Logical Core of XPath 2.0

The first aim of this paper is to present the logical core of XPath 2.0: a logically clean, decidable fragment, which includes most navigational features of XPath 2.0 (complex counting conditions and data joins are not supported, as they lead to undecidability). The second aim is to provide a list of equations completely axiomatizing query equivalence in this language (i.e., all other query equivalences can be derived from these). A preliminary version of this paper was published in the proceedings of ICDT 2007. We would like to thank Jan Hidders for pointing us to the interesting question of stronger forms of completeness (cf. Sect. 4.3). We would also like to thank the anonymous reviewers for their extensive comments, which have greatly improved the quality of the paper. The first author is supported by NWO grant 639.021.508.     

一种基于竞争节点估计的改进DCF机制

对于多跳Mesh网络特有的树状拓扑，距离网关不同跳数的路由器所承载的网络流量不尽相同，与周围节点的竞争情况也不一致，由此传统802．11的DCF机制并不适用。提出了一种基于竞争节点估计的竞争窗调整机制，即利用节点分布式地获取各自的条件碰撞概率，并由此估算其竞争节点个数，在此基础上由最优最小竞争窗与竞争节点个数的关系函数，调整竞争窗大小来提高Mesh网络的总体性能。采用OPNET仿真结果表明，优化后的饱和系统吞吐量可提高70～80％，饱和时延可降低50％以上。     

Scheduling Algorithms for a Slotted Packet Switch with either Fixed or Variable Length Packets

We address the problem of congestion resolution in optical packet switching (OPS). We consider a fairly generic all-optical packet switch architecture with a feedback optical buffer constituted of fiber delay lines (FDL). Two alternatives of switching granularity are addressed for a switch operating in a slotted transfer mode: switching at the slot level (i.e., fixed length packets of a single slot) or at the burst level (variable length packets that are integer multiples of the slot length). For both cases, we show that in spite of the limited queuing resources, acceptable performance in terms of packet loss can be achieved for reasonable hardware resources with an appropriate design of the time/wavelength scheduling algorithms. Depending on the switching units (slots or bursts), an adapted scheduling algorithm needs to be deployed to exploit the bandwidth and buffer resources most efficiently.     

Pre‐reservation of Resources and Controlled Loops for Contention Resolution in OBS Networks

A new scheme to alleviate contention in optical burst switching networks is proposed. It consists of preventively reserving resources in a node, to be used if resources are busy on the next hop node. The burst is sent back to the preceding node and then resent forward. Simulations are carried out to assess the feasibility of the proposed scheme. Its performance is compared with that of contention resolution based on deflection routing.     

Video-graphic query facility for database retrieval

The goal of this project was to develop a prototype to demonstrate the use of video and graphic techniques applied to the human-machine interface for data retrieval from a typical computerized database. Data is presented to a user via video and graphic means; queries are formulated in one of several graphic formats; control operations are handled through joystick, touch panel, or single-keystroke maneuvers. To accomplish this, we made use of videodisc, interactive computer graphics, and relational database technologies. Still pictures, video segments, and pictures of text are used as visual cues to a user who indicates interest in a data item in a pointing gesture by touching the panel through which the item may be seen. The user may find the actual data item s/he desires, then pose a query for additional information in one of four graphic query formats. A specially designed database was developed to handle the video and graphic data needed for this user facility.     

SPC、SPL和SPN波长转换竞争解决的研究

对光分组交换中波长共享(SPC)、链路共享(SPL)和节点共享(SPN)的结构进行了理论分析,推导出三种结构的丢包率公式,并对其系统丢包率与负载、输入光纤端口数和每纤波长数的关系进行了数值计算。结果表明:在相同的波长转换器数目(没有达到极限值)时,SPN结构的丢包率低于SPL的丢包率,并且在接近极限值时,SPN结构所需要的波长转换器数目也小于SPL结构所需要的波长转换器数目。     

A smart exponential‐threshold‐linear backoff mechanism for IEEE 802.11 WLANs

Based on the standardized IEEE 802.11 Distributed Coordination Function (DCF) protocol, this paper proposes a new backoff mechanism, called Smart Exponential‐Threshold‐Linear (SETL) Backoff Mechanism, to enhance the system performance of contention‐based wireless networks. In the IEEE 802.11 DCF scheme, the smaller contention window (CW) will increase the collision probability, but the larger CW will delay the transmission. Hence, in the proposed SETL scheme, a threshold is set to determine the behavior of CW after each transmission. When the CW is smaller than the threshold, the CW of a competing station is exponentially adjusted to lower collision probability. Conversely, if the CW is larger than the threshold, the CW size is tuned linearly to prevent large transmission delay. Through extensive simulations, the results show that the proposed SETL scheme provides a better system throughput and lower collision rate in both light and heavy network loads than the related backoff algorithm schemes, including Binary Exponential Backoff (BEB), Exponential Increase Exponential Decrease (EIED) and Linear Increase Linear Decrease (LILD). Copyright © 2011 John Wiley & Sons, Ltd.