CORNet: An OBS metro ring network with QoS support and fairness control

The rapid evolution of networks has been driven by new advances in enabling technologies and the explosive growth of Internet traffic. Optical Burst Switching (OBS) is not only cost-effective, but also provides high throughput, high bandwidth utilization, and low transmission latency. These benefits make OBS a viable solution for next-generation Metro Area Networks (MANs) in which the traffic models will be changed more dramatically than in today’s networks. This paper employs Wavelength Division Multiplexing (WDM) technology to construct a loss-free OBS metro ring architecture designated as the Collision-free Optic-burst Ring Network (CORNet). The proposed architecture ensures a collision-free transmission of data bursts, while retaining the advantage of the statistical multiplexing provided by conventional OBS networks. A novel distributed Medium Access Control (MAC) protocol to integrate the support of differentiated service and fairness access in CORNet is presented. The proposed Quality of Service (QoS) provisioning mechanism adopts a bandwidth-reservation approach which combines real-time transmission establishment and termination routines. Furthermore, a credit-based fairness control scheme is designed to guarantee the transmission fairness of best-effort traffic. Simulation results are presented to demonstrate that the proposed CORNet system provides good performance for real-time traffic while simultaneously providing significant performance improvements for best-effort traffic.     

Novel reinforcement learning-based approaches to reduce loss probability in buffer-less OBS networks

Optical Burst Switching (OBS) is a promising switching paradigm for the next generation Internet. A buffer-less OBS network can be implemented simply and cost-effectively without the need for either wavelength converters or optical buffers which are, currently, neither cost-effective nor technologically mature. However, this type of OBS networks suffers from relatively high loss probability caused by wavelength contentions at core nodes. This could prevent or, at least, delay the adoption of OBS networks as a solution for the next generation optical Internet. To enhance the performance of buffer-less OBS networks, we propose three approaches: (a) a reactive approach, called Reinforcement Learning-Based Deflection Routing Scheme (RLDRS) that aims to resolve wavelength contentions, after they occur, using deflection routing; (b) a proactive multi-path approach, called Reinforcement Learning-Based Alternative Routing (RLAR), that aims to reduce wavelength contentions; and (c) an approach, called Integrated Reinforcement Learning-based Routing and Contention Resolution (IRLRCR), that combines RLAR and RLDRS to conjointly deal with wavelength contentions proactively and reactively. Simulation results show that both RLAR and RLDRS reduce, effectively, loss probability in buffer-less OBS networks and outperform the existing multi-path and deflection routing approaches, respectively. Moreover, simulation results show that a substantial performance improvement, in terms of loss probability, is obtained using IRLRCR.     

An integrated congestion control mechanism for optimized performance using two-step rate controller in optical burst switching networks

Optical burst switching (OBS) is a promising solution to implement the optical internet backbone. However, the lack of adequate congestion-control mechanisms may result in high burst loss. Schemes such as fiber delay line (FDL), wavelength conversion, and deflection routing to reduce burst collision are unable to prevent the network congestion effectively. To address this problem, we propose and investigate a global solution, called Integrated Congestion-Control Mechanism (ICCM), for OBS networks. ICCM, which combines congestion avoidance with recovery mechanism, restricts the amount of burst flows entering the network according to the feedback information from core routers to edge routers to prevent network congestion. Also, a flow-policing scheme is proposed to intentionally drop the overloaded traffic with a certain probability at a core router to support fairness among flows. Moreover, the transmission rate of each flow is controlled to achieve optimized performance such as maximizing throughput or minimizing loss probability using two-step rate controller at the edge router. Simulation results show that ICCM effectively eliminates congestion within the network and that, when combined with a flow-policing mechanism, the fairness for competing flows can be supported while maintaining effective network performance.     

Algorithms for burst rescheduling in WDM optical burst switching networks

Wavelength division multiplexing (WDM) is a promising technology for realizing terabit networks. Optical burst switching (OBS) is a way to efficiently support bursty traffic on WDM-based optical Internet networks. In OBS networks, the control (header) and payload (data) components of a burst are sent separately with a time gap. The control packet first traverses the burst switching nodes and reserves suitable wavelengths on the links for the corresponding data burst by using a scheduling algorithm. Our work is motivated from the observation that the existing scheduling algorithms either have low computational complexity or high performance in terms of burst dropping probability, but not both simultaneously. Since the arrival of bursts is dynamic, it is highly desirable that the scheduling is done as quickly as possible. We develop scheduling algorithms which integrate the merits of both low computational complexity and high burst dropping performance. The key idea is to reschedule an existing burst by assigning a new wavelength to it keeping the burst arrival and leaving time unchanged in order to accommodate the new burst. We propose computationally simple rescheduling algorithms called on-demand burst rescheduling and aggressive burst rescheduling. The effectiveness of the proposed algorithms and the signaling overhead are studied through simulation experiments.     

全光网波长转换器配置问题的一种启发式算法

波长转换技术可以消除全光网络中的波长一致性限制,降低网络阻塞率,因此在具有波长转换器的全光网中,如何通过合理配置、使用数量有限的波长转换器来最大程度的降低网络的阻塞率,这是全光网络需要解决的一个关键问题。因此对网络中通过节点的路由数量、通信量、路由长度及节点处于路由的中心距离进行分析,并给上述四个参数赋予一定的权重进行加权处理,提出了一种基于节点权的全光网络波长转换器配置算法,并针对一般拓扑网络进行了算法演示和分析。     

Performance analysis of a threshold-based dynamic TXOP scheme for intra-AC QoS in wireless LANs

The IEEE 802.11e Enhanced Distributed Channel Access (EDCA) protocol has been proposed for provisioning of differentiated Quality-of-Service (QoS) between various Access Categories (ACs), i.e., inter-AC QoS, in Wireless Local Area Networks (WLANs). However, the EDCA lacks the support of the intra-AC QoS provisioning, which is indispensable in practical WLANs since the network loads are always asymmetric between traffic flows of ACs with the same priority. To address the intra-AC QoS issue, this paper proposes a Threshold-Based Dynamic Transmission Opportunity (TBD-TXOP) scheme which sets the TXOP limits adaptive to the current status of the transmission queue based on the pre-setting threshold. An analytical model is further developed to evaluate the QoS performance of this scheme in terms of throughput, end-to-end delay, and frame loss probability. NS-2 simulation experiments validate the accuracy of the proposed analytical model. The performance results demonstrate the efficacy of TBD-TXOP for the intra-AC QoS differentiation.     

Particle swarm optimization-based DRWA for wavelength continuous WDM optical networks using a novel fitness function

Greater demand of bandwidth and network usage flexibility from customers along with new automated means for network resource management has led to the concept of dynamic resource provisioning in WDM optical networks where unlike the traditional static channel assignment process, network resources can be assigned dynamically. This paper examines a novel particle swarm optimization (PSO)-based scheme to solve dynamic routing and wavelength assignment (dynamic RWA) process needed to provision optical channels for wavelength continuous Wavelength Division Multiplexed (WDM) optical network without any wavelength conversion capability. The proposed PSO scheme employs a novel fitness function which is used during quantization of solutions represented by respective particles of the swarm. The proposed fitness function takes into account the normalized path length of the chosen route and the normalized number of free wavelengths available over the whole route, enabling the PSO-based scheme to be self-tuning by minimizing the need to have a dynamic algorithmic parameter ‘α’ needed for better performance in terms of blocking probability of the connection requests. Simulation results show better performance of the proposed PSO scheme employing novel fitness function for solving dynamic RWA problem, not only in terms of connection blocking probability but also route computation time as compared to other evolutionary schemes like genetic algorithms.     

OBS网络中基于优先级与概率的偏射路由算法*

摘 要：为了保证OBS网络中不同优先级业务的服务质量和解决偏射算法在偏射控制上的问题,提出了一种基于优先级与概率的偏射路由算法。该算法根据突发包的优先级和转发概率来控制突发包的偏射,并从网络突发阻塞概率的意义上寻找最佳偏射路由。当冲突发生时,分割优先级低的突发包,并将分割突发包偏射到空闲的链路上;节点根据链路上指定的权值,按概率为分割突发包选择一条可以使网络突发阻塞概率最小的最佳偏射路由。仿真结果表明,虽然网络中可选路由数目的增加对网络性能的改善非常有限,但是该算法能够有效的降低整个网络的丢包率,并且得到的高优先级突发包的丢失率低于低优先级突发包的丢失率,从而很好的保障了网络的服务质量。故这种方法能够有效的提高OBS网络的性能。     

Dynamic bandwidth provisioning using ARIMA-based traffic forecasting for Mobile WiMAX

With fast proliferation of QoS-enabled wireless packet networks, need for effective QoS control is increasing. In this paper, we focus on QoS provisioning in Mobile WiMAX access service network (ASN). We investigate a dynamic bandwidth provisioning method that can help to increase resource utilization. Our approach consists of two stages: traffic forecasting, followed by bandwidth provisioning. For the first stage, we use auto-regressive integrated moving average (ARIMA) model to forecast traffic based on online measurement. For the second stage, we use a bandwidth provisioning scheme that allocates bandwidths depending on the traffic forecasting. We modeled our problem as a Fractional Knapsack Problem for which we used a greedy algorithm in order to find an approximate solution. Through simulation studies with real-world data sets, we found that our approach could increase the bandwidth for the real-time traffic class and guarantee adequate service quality for the nonreal-time traffic class as well, while maximizing resource utilization.     

Slotted Optical Burst Switching (SOBS) networks

In the paper, we study Optical Burst Switching (OBS) networks. Since OBS still suffers high loss ratio due to the lack of buffer at the OBS core routers, we study methods to reduce the loss without using optical buffers. We consider time-slotted OBS called Slotted OBS (SOBS), where routers are synchronized and only send fixed length bursts at the beginning of time slots. Our simulation results show that SOBS reduces the packet loss probability significantly. Moreover, we show that SOBS can be implemented with little or no additional cost and has other advantages such as providing better support for Quality of Service (QoS).     

c-HyLabs混合光交换网络上的多播机制研究

在WDM网络中有两种全光多播方式,一种是OCS（光电路交换）网络中基于光树的多播,另一种就是在OBS（光突发分组交换）网络中基于突发分组的多播。这两种方式都有各自的优缺点。在分析这两种交换技术优缺点的同时,提出了一种采用混合交换技术的新型光交换网络（c-HyLabs）,并提出了在此网络上实现光多播的机制。通过OPNET的仿真表明,该混合光交换网络在相同条件下其延时及丢包率等性能均优于OBS网络多播。     

A cross-layer elastic CAC and holistic opportunistic scheduling for QoS support in WiMAX

QoS provisioning is an important issue in the deployment of broadband wireless access networks with real-time and non-real-time traffic integration. An opportunistic MAC (OMAC) combines cross-layer design features with opportunistic scheduling scheme to achieve high system utilization while providing QoS support to various applications. A single scheduling algorithm cannot guarantee all the QoS requirements of traffics without the support of a suitable CAC and vice versa. In this paper, we propose a cross-layer MAC scheduling framework and a corresponding opportunistic scheduling algorithm in tandem with the CAC algorithm to support QoS in WiMAX point-to-multipoint (PMP) networks. Extensive experimental simulations have been carried out to evaluate the performance of our proposal. The simulation results show that our proposed solution can improve the performance of WiMAX networks in terms of packet delay, packet loss rate and throughput. The proposed CAC scheme can guarantee the admitted connections to meet their QoS requirements.     

An analytical QoS service model for delay-based differentiation

The increased need for Quality of Service (QoS) in today’s IP networks has concentrated a lot of research and implementation efforts. Carefully designed and managed priority services are essential for quality-demanding traffic, especially in large-scale IP-based environments where aggregation of flows is extensive and a variety of traffic types co-exist. Although individual mechanisms have been widely investigated, not much related work exists on integrated approaches to QoS provisioning that are also feasible to implement. This work presents a thorough approach to the design, dimensioning and provisioning of a high-priority service for high-quality-demanding traffic over an IP network. Our approach employs efficient scheduling and a dynamic admission control scheme while demonstrating an outstanding performance in terms of the quality offered to QoS-demanding traffic. A novel feature is also introduced: while other existing schemes only focus on provisioning of service rate guarantees, ours achieves in addition differentiation of the end-to-end delay perceived by IP flows.     

光突发交换中冲突解决的GHA策略

为了解决光突发交换中突发包竞争问题,针对光突发网络中现有的突发包分割机制,提出新的基于优先级分组复合封装策略,分析冲突长度相对值和偏射路由阈值概念,结合头部丢弃与偏射路由双重机制进行冲突解决。仿真结果表明,该策略有效地较低了网络的丢包率,保证了高优先级IP包的高效传输,较好地支持了网络的QoS。     

光突发交换网络中QoS机制研究与实现

光突发交换作为下一代光互联网最有前途的解决方案已经越来越受到人们的关注,如何增强光突发交换网络的服务质量(QoS)保障能力,已成为光交换领域内的一个重要研究课题。论文对光突发交换网络中基于偏置时间的QoS机制进行了研究,采用低优先级直接丢弃算法,结合突发分片技术和最近可用信道-空隙填充算法,提出了一种新的QoS解决方案,通过建立相应的光突发交换网络模型对该解决方案进行了仿真比较,仿真结果表明该方案可以明显地降低阻塞率,提高信道利用率,为各类业务提供良好的QoS保障。     

Enhanced packet routing queuing model in optical burst switching network using queue-based dynamic optical route scheduling

Optical Burst Switching (OBS) for all future optical network technology signatures. In OBS, the IP packet is known as a large explosion of data that is assembled in the input packets. The pre-assembly burst is sent to its intended location for offset time. It has shown that there are some security issues, but they do not resolve the node's ability to separate them. When they have suffered great losses to ensure that they are indispensable. If they are not safe, it may not waste resources on the optimal path.Current communication paradigms such as broadcast and multicast. Therefore, in optical networks, it is necessary to support these paradigms. Implementation of IP QoS policies does not apply to Optical Burst Switching (OBS) networks. These QoS requirements include controversy, optical signal quality, reliability, and delay.This work recommends the use of shared encryption for secure message traffic on OBS networks. The information is divided into as many strands as possible, and then it transmits at different times between pair of nodes and the different paths or routes. The proposed method to analyze the three strategies likely traffic analysis and route scheduling, packet header analysis,and authentication key verification.This proposed method,Queue-Based Dynamic Optical Route Scheduling (QDORS), provides flexible and efficient integrated packet-based traffic in OBS functions and Internet-based networks. It considered exploding a valid huge amount of data plans to reduce better channel usage, higher efficiency, and blocking probability.     

Performance analysis of a QoS capable cluster interconnect

The growing use of clusters in diverse applications, many of which have real-time constraints, requires quality-of-service (QoS) support from the underlying cluster interconnect. All prior studies on QoS-aware cluster routers/networks have used simulation for performance evaluation. In this paper, we present an analytical model for a wormhole-switched router with QoS provisioning. In particular, the model captures message blocking due to wormhole switching in a pipelined router, and bandwidth sharing due to a rate-based scheduling mechanism, called VirtualClock. Then we extend the model to a hypercube-style cluster network. Average message latency for different traffic classes and deadline missing probability for real-time applications are computed using the model.

We evaluate a 16-port router and hypercubes of different dimensions with a mixed workload of real-time and best-effort (BE) traffic. Comparison with the simulation results shows that the single router and the network models are quite accurate in providing the performance estimates, and thus can be used as efficient design tools.     

Upper-level scheduling supporting multimedia traffic in cellular data networks

Wireless data networks such as cdma2000 1x EV-DO and UMTS HSDPA use downlink scheduling that exploits channel fading to increase the system throughput. As future wireless networks will eventually support multimedia and data traffic together, we need a proper criterion for scheduling that can count various service requirements such as delay and packet loss. Although some previous approaches proposed opportunistic schedulers at the lower layer, it has not been investigated well whether they are able to meet explicit QoS defined at the upper layer. Hence, in this paper, we develop a hierarchical scheduling model that considers QoS provisioning and the time-varying channel feature separately. We focus on the upper-level QoS scheduling that supports various traffic classes in a unified manner. Supposing that a user gets some satisfaction or utility when served, we introduce a novel concept of opportunity cost, which is defined as the maximum utility loss among users incurred by serving a particular user at the current turn. We obtain each user’s net profit by subtracting the opportunity cost from its expected utility, and then select a user with the maximum profit for service. Simulation results reveal that our scheme supports various QoS classes well that are represented by delay and packet loss under various traffic loadings.     

Differentiation, QoS guarantee, and optimization for real-time traffic over one-hop ad hoc networks

Nodes having a self-centrically broadcasting nature of communication form a wireless ad hoc network. Many issues are involved to provide quality of service (QoS) for ad hoc networks, including routing, medium access, resource reservation, mobility management, etc. Previous work mostly focuses on QoS routing with an assumption that the medium access control (MAC) layer can support QoS very well. However, contention-based MAC protocols are adopted in most ad hoc networks since there is no centralized control. QoS support in contention-based MAC layer is a very challenging issue. Carefully designed distributed medium access techniques must be used as foundations for most ad hoc networks. In this paper, we study and enhance distributed medium access techniques for real-time transmissions in the IEEE 802.11 single-hop ad hoc wireless networks. In the IEEE 802.11 MAC, error control adopts positive acknowledgement and retransmission to improve transmission reliability in the wireless medium (WM). However, for real-time multimedia traffic with sensitive delay requirements, retransmitted frames may be too late to be useful due to the fact that the delay of competing the WM is unpredictable. In this paper, we address several MAC issues and QoS issues for delay-sensitive real-time traffic. First, a priority scheme is proposed to differentiate the delay sensitive real-time traffic from the best-effort traffic. In the proposed priority scheme, retransmission is not used for the real-time traffic, and a smaller backoff window size is adopted. Second, we propose several schemes to guarantee QoS requirements. The first scheme is to guarantee frame-dropping probability for the real-time traffic. The second scheme is to guarantee throughput and delay. The last scheme is to guarantee throughput, delay, and frame-dropping probability simultaneously. Finally, we propose adaptive window backoff schemes to optimize throughput with and without QoS constraints.     

A scalable multimedia QoS architecture for ad hoc networks

Communication demands have grown from separate data and voice to integrated multimedia, paving the way to converging fixed, mobile and IP networks. Supporting Multimedia is a challenging task for wireless ad hoc network designers. Multimedia forms high data rate traffic with stringent Quality of Service (QoS) requirements. Wireless ad hoc networks are characterized by frequent topology changes, unreliable wireless channel, network congestion and resource contention. Providing scalable QoS is the most important challenge for multimedia delivery over ad hoc networks. We introduce here a provisioning and routing architecture for ad hoc networks which scales well while provisioning QoS. The proposed architecture is analysed using a mix of HTTP, voice and video streaming applications over 54 Mbps 802.11 g-based ad hoc networks. The architecture is simulated and compared to well-known routing protocols using the OPNET Modeller. The results show that our architecture scales well with increase in the network size, and outperforms well-known routing protocols.