Performance Analysis of a Bandwidth Guaranteed Medium Access Control Protocol for WDM Local Networks

In this paper, we propose and analyze a bandwidth guaranteed medium access control protocol for broadcast-and-select WDM local networks with a star topology. The proposed protocol is based on a combination of contention and dedicated reservation mechanisms for time slotted WDM networks. Every node accesses the data channel by transmitting request packets in minislots on a separate control channel. There are two types of minislots; dedicated minislots and contention minislots. Nodes requiring bandwidth guarantees, called guaranteed nodes, use dedicated minislots that are assigned by the centralized control node. The remaining nodes, called random-access nodes, share contention minislots using a distributed random access mechanism. The dedicated minislots can guarantee a minimum bandwidth for the guaranteed nodes. The contention minislots enable on-demand services at the optical layer and achieve good fairness for the remaining bandwidth. Here, the data channels are dynamically assigned to the minislots successfully returned on a first-come-first-served (FCFS) basis. This protocol can combine the best of centralized and distributed access protocols such as simplicity, efficiency, and flexibility. We analyze the maximum throughput and verify the results by simulation.     

m-DIBCR: MAC Protocol with Multiple-Step Distributed In-Band Channel Reservation

A new medium access control (MAC) protocol to handle packet collisions is proposed. Different from traditional MAC protocols, where only one-step reservation is considered, we propose a multiple-step distributed in-band channel reservation, called m-DIBCR, where m represents the number of steps we consider in the channel reservation. In the protocol, each node maintains m timers, each of which serves as the backoff timer for one of the next m packets to be sent. A node broadcasts the initial values of these timers by piggybacking them in the data packet, and simultaneous transmissions can be avoided when its neighboring nodes overhear these values. Extensive simulations show that, compared with one-step channel reservation, throughput can be dramatically improved by multiple-step channel reservation, especially in networks with high transmission error probabilities and/or a large number of contending nodes.     

A Medium Access Control Protocol for Voice/Data Integrated Wireless CDMA Systems

In this paper, a medium access control protocol is proposed for integrated voice and data services in wireless local networks. Uplink channels for the proposed protocol are composed of time slots with multiple spreading codes per slot based on slotted code division multiple access (CDMA) systems. The proposed protocol uses spreading code sensing and reservation schemes. This protocol gives higher access priority to delay‐sensitive voice traffic than to data traffic. The voice terminal reserves an available spreading code to transmit multiple voice packets during a talkspurt. On the other hand, the data terminal transmits a packet without making a reservation over one of the available spreading codes that are not used by voice terminals. In this protocol, voice packets do not come into collision with data packets. The numerical results show that this protocol can increase the system capacity for voice service by applying the reservation scheme. The performance for data traffic will decrease in the case of high voice traffic load because of its low access priority. But it shows that the data traffic performance can be increased in proportion to the number of spreading codes.     

最小化长传播时延对无线网络多址接入协议的影响(英文)

A multiple access protocol is proposed to greatly improve multiple access performance of wireless networks with long propagation delay. All the nodes with packets to send can make rapid successful reservation in access reservation mini-slots, which is adaptively adjusted according to current traffic load and idle channel resources. A Central Control Node (CCN) coordinates channel reservation and allocates on-demand channel resources to the successfully accessed nodes on two channels. Each node can employ on...     

An in-band signaling protocol for optical packet switching networks

Advances in optical networking reveal that all optical networks offering a multigigabit rate per wavelength will soon become economical as the underlying backbone in wide-area networks, in which the optical switch plays a central role. One of the central issues is the design of efficient signaling protocols which can support diversified traffic types, in particular the bursty IP traffic. This paper introduces a novel signaling protocol called the sampling probe algorithm (or SPA) to be used in a class of optical packet switching systems based on wavelength division multiplexing (WDM). The proposed scheme takes a drastically different approach from all existing signaling protocols. The salient features are 1) the pretransmission coordination is using an in-band signaling protocol, and thus does not require separate control channel(s) for transmission coordination; 2) the protocol is based on a reservation (connection) scheme which is capable of supporting multimedia traffic; 3) a gated service is adopted in which each successful reservation allows multiple packets (train of packets) to be transmitted, which can significantly reduce the per packet overhead; 4) the scheduling algorithm is adaptive by allowing flexible assignment of bandwidth on-demand; 5) the channel status gathering is done in a distributed fashion, and uses a passive listening mechanism, which itself does not interfere with packet transmissions. The results demonstrate that the proposed in-band signaling protocol can achieve high throughput and stability under heavy traffic condition.     

End-to-end bandwidth allocation scheme for voice traffic support over MANETs

Multimedia and real-time applications require bandwidth guarantees, which can be achieved by resource reservation. However, bandwidth reservation in ad-hoc networks is a very challenging task due to the instability of radio channels, node mobility and lack of coordination between mobile nodes. Most proposed reservation protocols focus on point-to-point reservations, and only a few work has been done to propose an efficient end-to-end reservation scheme. In this paper, we propose a reservation scheme called End-to-end reservation scheme for voice and data traffic support (EERV). The basic component of our protocol is a handshake mechanism which has the role to establish point-to-point reservations, and to ensure consistency of reservations between neighbor nodes. Both data and voice sources are allowed to establish reservations with priority given to voice sources. This reservation scheme is extended to support the reservation and release of resources along a path in cooperation with the routing layer. Our reservation scheme is based on DSR, a well-known reactive routing protocol. Mobility of nodes and node failure cause frequent reservation breakages resulting in significant performance degradation. In order to resolve this issue we propose a reservation loss detection and reservation recovery mechanisms. We achieved intensive simulations to evaluate the performance of our protocol. Simulation results show the effectiveness of this protocol.     

Network architecture for optical path transport networks

This paper proposes a new layered transport network architecture on which the WDM optical path network can be effectively created. The optical path network will play a key role in the development of the transport network that will realize the bandwidth-abundant B-ISDN. This paper extends the layered transport network architecture described in ITU-T Recommendation G.803 which is applied in existing SDH networks. First, we elucidate an application example of WDM optical path networks. Next, we propose a new layered architecture for WDM-based transport networks that retains maximum commonality with the layered architectures developed for existing B-ISDN networks. The proposed architecture is composed of circuit layer networks, electrical path layer networks, optical layer networks, and physical media (fiber) networks. The optical layer is divided into an optical path layer and an optical section layer. The optical path layer accommodates electrical paths. Optical section layer networks are divided into optical multiplex section (OMS) layer networks and optical repeater section (ORS) layer networks. The OMS layer network is concerned with the end-to-end transfer of information between locations transferring or terminating optical paths, whereas the ORS layer is concerned with the transfer of information between individual optical repeaters. Finally, a detailed functional block model of WDM optical path networks, the function allocation of each layer, and an optical transport module (OTM) are developed     

HORNET: a packet-over-WDM multiple access metropolitan area ring network

Current metropolitan area networks (MANs) based on the SONET transport are not developing at the rate required to support the phenomenal increase in data traffic. To address the needs of future MANs, the Optical Communications Research Laboratory at Stanford University and Sprint Advanced Technology Laboratories are building HORNET (Hybrid Optoelectronic Ring NETwork). HORNET has a multiple access architecture, in which nodes access any WDM channel using a novel media access control protocol and fast tunable laser transmitters. HORNET transports data packets directly over the WDM ring, eliminating the SONET transport. This paper presents the HORNET architecture, the node design consisting of novel packet-over-WDM components, and the experimental testbed with results.     

Efficient QoS support in a slotted multihop WDM metro ring

A novel distributed access protocol for a slotted wavelength-division-multiplexing (WDM) metro ring employing all-optical packet switching and supporting quality-of-service (QoS) classes is presented and analyzed. Since we assume that there are more nodes than available wavelengths in the network, we obtain a scalable multihop WDM ring as underlying network architecture. By dividing each channel into several time slots and further applying destination release and slot reuse, data packets can be efficiently transmitted and received in a statistically multiplexed manner. In our architecture, each node is equipped with one tunable transmitter and one fixed-tuned receiver. Furthermore, as we generally consider so-called a posteriori access strategies, different packet selection schemes are proposed and compared. An analytical model based on the semi-Markov process methodology is developed to quantify the performance of one of these schemes. As a key element of the protocol, an efficient QoS support access mechanism is proposed and its performance is evaluated. The new QoS control scheme adopts a frame-based slot reservation strategy including connection setup and termination, which only slightly increases the signaling and node processing overhead. Thus, an efficient hybrid protocol combining connectionless and connection-oriented packet transmissions is proposed     

Utilizing Neighbours-Table to Improve Tree Routing Protocol in ZigBee Network

ZigBee is an industrial standard for wireless ad hoc networks based on IEEE 802.15.4. It has been developed for low cost, low data rate and low power consumption. ZigBee??s network layer defines two routing protocols namely Ad Hoc On-demand Distance Vector and Tree Routing (TR). TR protocol follows the tree topology (parent?Cchild) in forwarding the data packets from source nodes to the sink node. However, the source does not find rather nor the location of the sink is close to the source node or if it is not in the sub-tree. In this case it will follow the tree topology which will use a lot of hops to deliver data packets to the sink node. This paper present an improvement of TR protocol for ZigBee network and is called Improved Tree Routing (ImpTR) protocol which is computationally simple in discovering the better path to transmit data packets to the sink node, and does not need any addition in hardware. ImpTR determines the better path to the sink node depending on the tables of the neighbouring nodes, which is part of the existing ZigBee network specification. Results show that the proposed algorithm provides shorter average end-to-end delay, increase throughput, decrease the average number of hops and decrease the energy consumption from the network when compared to the original TR routing protocol.     

Data aggregation in sensor networks using learning automata

One way to reduce energy consumption in wireless sensor networks is to reduce the number of packets being transmitted in the network. As sensor networks are usually deployed with a number of redundant nodes (to overcome the problem of node failures which is common in such networks), many nodes may have almost the same information which can be aggregated in intermediate nodes, and hence reduce the number of transmitted packets. Aggregation ratio is maximized if data packets of all nodes having almost the same information are aggregated together. For this to occur, each node should forward its packets along a path on which maximum number of nodes with almost the same information as the information of the sending node exist. In many real scenarios, such a path has not been remained the same for the overall network lifetime and is changed from time to time. These changes may result from changes occurred in the environment in which the sensor network resides and usually cannot be predicted beforehand. In this paper, a learning automata-based data aggregation method in sensor networks when the environment’s changes cannot be predicted beforehand will be proposed. In the proposed method, each node in the network is equipped with a learning automaton. These learning automata in the network collectively learn the path of aggregation with maximum aggregation ratio for each node for transmitting its packets toward the sink. To evaluate the performance of the proposed method computer simulations have been conducted and the results are compared with the results of three existing methods. The results have shown that the proposed method outperforms all these methods, especially when the environment is highly dynamic.     

Using explicit reservations to arbitrate access to a metropolitan system of slotted interconnected rings combining TDMA and WDMA

A system of slotted interconnected wavelength-division-multiplexing (WDM) rings controlled by a medium access control (MAC) protocol is shown to offer very high utilization within a queuing delay less than a few round-trip times, by means of a very-fast-reacting explicit reservation mechanism. The system can be used to provide interconnectivity in a metropolitan area transferring optical payloads on-the-fly without buffering or converting from the optical domain. All necessary control information is transferred on a dedicated wavelength and is processed in the electrical domain to provide both collision-free packet access at the ring nodes and contention resolution at the hub interconnecting the rings. The end result is a flexible and efficient metropolitan network suitable for bursty data services.     

A multilevel WDM access protocol for an optically interconnectedmultiprocessor system

Scalable, hierarchical, all-optical WDM networks for processor interconnection in multiprocessor systems have been recently considered. The principal objective of this paper is to introduce an access protocol for this type of network which supports a distributed shared memory (DSM) environment. The objectives of the protocol are reduced average latency per packet, support of broadcast/multicast, collisionless communication, and exploitation of inherent DSM traffic characteristics. The protocol is based on a hybrid approach that combines reservation access and preallocated reception channels for a WDM system. The proposed approach trades maximum capacity for reduced communication latency to improve system response. The performance of the protocol is analyzed through semiMarkov analytic and simulation models with varying system parameters such as number of nodes and channels. The performance of the new protocol is compared to a TDM-based protocol and their relative merits are examined     

The NGI ONRAMP test bed: reconfigurable WDM technology for nextgeneration regional access networks

Next generation internet optical network for regional access using multi-wavelength protocols (NGI ONRAMP) is a pre-competitive consortium sponsored by DARPA. Its mission is to develop architectures, protocols, and algorithms for wavelength division multiplexing (WDM)-based regional access networks that will effectively support the NGI. A reconfigurable WDM test bed is being built to demonstrate some of the key thrusts of the consortium, including dynamic service provisioning and optical flow switching, service protection in the optical domain, medium access control protocols, and network control and management geared for the efficient transport of Internet traffic over WDM networks. The ONRAMP test bed will consist of a feeder network connecting via access nodes to distribution networks on which the end users reside. ONRAMP network reconfiguration is enabled by access nodes that contain both optical and electronic switching components, allowing data traffic to be routed all-optically through the network or to be switched and aggregated by electronic Internet protocol (IP) routers. This paper describes the goals and basic architecture of the ONRAMP test bed, as well as the design, construction, and characterization of the network access nodes. To illustrate test bed operation, we demonstrate optical flow switching over the test bed that achieves Gb/s throughput of TCP data between end user workstations     

WDM光网络中一种优先共享通路保护算法

为了提高波分复用光网络的可靠性,常采用分段共享通路保护算法,该方法通常要求保护通路要均匀分段并且应满足共享风险链路组约束,网络业务的阻塞率也就比较高,因此提出了用优先共享通路保护算法来降低业务阻塞率。通过计算机仿真进行了理论分析和实验验证,取得了两种保护算法下的业务阻塞率和资源预留比的数据。结果表明,优先共享保护通路算法能够有效地融合分段共享通路保护算法的优点,同时在业务的阻塞率和资源预留比方面优于分段共享保护通路算法。     

Performance analysis of multicast routing and wavelength assignment protocol with dynamic traffic grooming in WDM networks

The need for on‐demand provisioning of wavelength‐routed channels with service‐differentiated offerings within the transport layer has become more essential because of the recent emergence of high bit rate Internet protocol (IP) network applications. Diverse optical transport network architectures have been proposed to achieve the above requirements. This approach is determined by fundamental advances in wavelength division multiplexing (WDM) technologies. Because of the availability of ultra long‐reach transport and all‐optical switching, the deployment of all‐optical networks has been made possible. The concurrent transmission of multiple streams of data with the assistance of special properties of fiber optics is called WDM. The WDM network provides the capability of transferring huge amounts of data at high speeds by the users over large distances. There are several network applications that require the support of QoS multicast, such as multimedia conferencing systems, video‐on‐demand systems, real‐time control systems, etc. In a WDM network, the route decision and wavelength assignment of lightpath connections are based mainly on the routing and wavelength assignment (RWA). The multicast RWA's task is to maximize the number of multicast groups admitted or minimize the call‐blocking probability. The dynamic traffic‐grooming problem in wavelength‐routed networks is generally a two‐layered routing problem in which traffic connections are routed over lightpaths in the virtual topology layer and lightpaths are routed over physical links in the physical topology layer. In this paper, a multicast RWA protocol for capacity improvement in WDM networks is designed. In the wavelength assignment technique, paths from the source node to each of the destination nodes and the potential paths are divided into fragments by the junction nodes and these junction nodes have the wavelength conversion capability. By using the concept of fragmentation and grouping, the proposed scheme can be generally applied for the wavelength assignment of multicast in WDM networks. An optimized dynamic traffic grooming algorithm is also developed to address the traffic grooming problem in mesh networks in the multicast scenario for maximizing the resource utilization and minimizing the blocking probability. Copyright © 2011 John Wiley & Sons, Ltd.     

RIPT: A Receiver-Initiated Reservation-Based Protocol for Underwater Acoustic Networks

Although there are many MAC protocols that have been proposed for terrestrial wireless networks with a wide variety of aspects, these protocols cannot be applied directly in underwater acoustic networks due to the channel's uniqueness of having low data rate and long propagation delay. In order to achieve a high throughput, both characteristics must be taken into account in the MAC design. We propose a random access MAC protocol for multi-hop underwater acoustic networks based on receiver reservation, which we shall call the "Receiverinitiated Packet Train" (RIPT) protocol. It is a handshakingbased protocol that addresses the channel?s long propagation delay characteristic by utilizing receiver-initiated reservations, as well as by coordinating packets from multiple neighboring nodes to arrive in a packet train manner at the receiver. Our simulation results have confirmed that the RIPT protocol can achieve our goal of having high and stable throughput performance while maintaining low collision rate.     

Hybrid routing and load balancing protocol for wireless sensor network

In wireless sensor network, when the nodes are mobile, the network structure keeps on changing dynamically, that is, new nodes enter the network and old members exit the network. As a result, the path from one node to the other varies from time to time. In addition, if the load on a particular part of the network is high, then the nodes will not be capable of transmitting the data. Thus, data delivery at the destination will be unsuccessful. Moreover, the part of the network involved in transmitting the data should not be overloaded. To overcome these issues, a hybrid routing protocol and load balancing technique is discussed in this paper for the mobile data collectors in which the path from source to destination is ensured before data transmission. The hybrid routing protocol that combines the reactive and proactive approach is used to enhance gradient based routing protocol for low power and lossy networks. This protocol can efficiently handle the movement of multiple sinks. Finally, load balancing is applied over the multiple mobile elements to balance the load of sensor nodes. Simulation results show that this protocol can increase the packet delivery ratio and residual energy with reduced delay and packet drop.     

一种并行传输的水声Ad hoc网络多址接入(PTMA)协议

由于存在"隐藏终端"和"暴露终端"的问题,无线Ad hoc网络的应用受到极大的限制.进一步,由于水声信道的特点,例如有用的频率带宽很窄,强时变、多途和长传播时延,使得设计水声Ad hoc网络具有自身特点和难度.本文中,我们为此提出了一种新的多址接入控制(MAC)协议,即并行传输多址接入(PTMA)协议.该协议基于如下思想:为消除冲突而进行多信道预约,这样能在多个信道上并行地传输数据;为缩短等待clear_-to_-send(CTS)的时间,当request_-to_-send(RTS)刚发送完就立即发送分组数据,而不必收到CTS后再发.通过使用OPNET Modeler/Radio仿真器得到的仿真结果显示:PTMA协议能取得较之于适合无线Ad hoc网络的多址接入协议更高的吞吐性能和较低的端到端传播时延.     

Distributed Optical Control Plane Architectures for Handling Transmission Impairments in Transparent Optical Networks

Transmission impairments in wavelength-division- multiplexing (WDM) transparent optical networks accumulate along an optical path and determine the feasibility of lightpaths; hence, the impairments need to be managed efficiently by the control plane. This paper presents impairment-aware distributed optical control plane (OCP) based on enhancements to resource reservation protocol–traffic engineering (RSVP–TE) signaling protocol (S-OCP). In particular, four architectural options [K-sequential (K-SEQ), K-parallel (K-PAR), hop-by-hop (HbH), and full flooding (FF)] within the S-OCP approach are defined and compared. Simulation results show that a combination of HbH routing and feasibility check can be considered as a good compromise both in terms of blocking probability and control plane overhead. The feasibility of a signaling-based approach for the control plane is further demonstrated by comparing simulation results with the results obtained from the implementation of the proposed architectural options in a commercial generalized multiprotocol label switching (GMPLS) protocol emulator. Furthermore, we argue that the real networks will rarely be homogeneous concerning transponder types, creating the need for a transponder selection policy at the end nodes. We introduce and compare two policies: best-first and worst-first. The results obtained from our experiments show that a worst-first policy for selecting transponders can save up to 50% enhanced transponders thereby reducing the overall cost.