LGRR: A new packet scheduling algorithm for differentiated services packet-switched networks

Since Quality of Service (QoS) support is a mandatory requirement in the next-generation networking, each router in a packet-switched network must provide a better service to higher-priority packets under any situation such as congestion. We propose in this paper the loan-grant based Round Robin (LGRR) packet scheduler for use in each output port of a router in a DiffServ network. LGRR is a frame-based scheduler to pass traffic streams according to their class types and to their immediate upstream source routers. It uses a loan-grant scheme so that a higher priority traffic stream can be processed quickly by requesting a bandwidth loan from the scheduler. To control the amount of transmitted bits from each stream and to prevent malicious abuse, the bandwidth loan must be paid back from the quantum values acquired in future. LGRR gives a fair opportunity to different traffic streams to access to the network bandwidth. It performs better than MDRR+, MDRR++, and OCGRR in handling traffic under both normal and bursty traffic, but it also gives a better loss and delay performance to the higher-priority traffic when traffic load is very high.     

Reconfigurable Optical Bus and Performance Optimization

With the advent of optical fiber and other advanced technologies in solid state,pipelining signals at the wire(or transmission line)level has becomr possible.This has,in turn,made the slotted bus a potential candidate for interconnection networks(IN)for tightly coupled multiprocessor systems.However,a bus an provide only limited bandwidth.Though slotted bus can provide considerably more bandwith in comparison to the traditional non-slotted bus,it is not enough for fine-grain parallel applications run on the shared-memory systems.One well known method to increase the effective bandwidth of a slotted bus in the LAN/MAN environment is to reuse the bandwwidth by reusing slots.However,in a tightly coupled environment reusing slots is not a lucrative option because the significant buffering needs arising from slot reuse will introduce intolerable delay.In this paper we propose a methodology to reuse part of the bandwith available from temporal and spectral bandwidth expansion with none of minimum buffering delay,resulting in significant performance improvement in both the effective throughput and response time(communication latency).The proposed method entails the design and analysis of a re-configurable bus structure with both temporal and spectral bandwidth expansion and a polynomial time algorithm for optimal configurations for given traffic conditionslWe have compared the performance of our reconfigured bus with that of the traditional slotted bus for uniform and localized traffic pattern and founr that the reconfigured bus outperforms the traditional slotted bus substantially in many practical scenarios.     

A high-speed integrated services ATM/STM switch

A new, high-speed switch architecture which uses Asynchronous Transfer Mode (ATM) and Synchronous Transfer Moder (STM) to support integrated voice-data-video, multicasting, and virtual networking services is described. The switch employs autonomous processing units with local memory to store switching information and is built around a modified Banyan network with bit-parallel lines linking its node processors. The system is synchronous and time is slotted with slots organized into frames. Fixed-rate video and other real-time periodic traffic are handled via STM switching, while voice, data, datagrams, and other bursty traffic are ATM switched. Multicasting is realized by allocating dedicated STM bandwidth to real-time periodic sources and virtual ATM bandwidth to bursty sources. Virtual networking is achieved by putting an STM subnetwork into place over which authorized users communicate via ATM and/or STM. Analytic models to determine the switch's performance characteristics are developed and illustrated via examples. The results show that the switch has excellent delay vs. throughput performance for ATM traffic in the presence of STM traffic, and very low blocking-and-loss probability for STM circuit set-up requests in the presence of other traffic.     

Scheduling algorithms for multicast traffic in TDM/WDM networks with arbitrary tuning latencies

We consider all-optical Time Division Multiplexing (TDM)/Wavelength Division Multiplexing (WDM) broadcast and select networks with slotted operation. Each network access node is equipped with one fixed transmitter and one tunable receiver; tuning times are not negligible with respect to the fixed size slot time. We discuss efficient scheduling algorithms to assign TDM/WDM slots to multicast traffic in such networks. The problem is shown to be NP-hard; thus, heuristic algorithms based on the Tabu Search meta-heuristic are proposed, and their performance are assessed using randomly created request matrices based on two types of multicast traffic patterns. We show that significant advantages can be obtained by using these novel algorithms with respect to simpler greedy algorithms, even when restricting CPU times to realistic values to make the algorithms of practical use.     

On the performance of adaptive TDMA protocols in WDM passive star networks with fixed transmitters and tunable receivers

An adaptive time division multiple access (TDMA) protocol for WDM passive star networks using fixed transmitters and tunable receivers is presented. The proposed optical adaptive TDMA (OATDMA) protocol is capable of operating efficiently under bursty and correlated traffic. According to the proposed protocol, the stations which are granted permission to transmit at each time slot, are selected by taking into account the network feedback information. In this way, the number of idle slots is minimized and the network performance is significantly improved. Furthermore, although the traffic parameters are unknown and time-variable, the portion of the bandwidth assigned to each station is dynamically adapted to the station’s needs.     

自适应带宽的最大-最小公平性拥塞控制

带宽共享和拥塞控制对于Internet的健壮性和公平性是很重要的研究课题.对交换设备中流量共享拥塞链路的带宽公平分配进行研究,提出一个优化交换设备带宽的设置算法:根据出端口接收速率自适应设置入端口带宽门限,对入端口的带宽进行动态重新分配,提高资源利用率.模拟实验表明,此算法有以下优点:1)高适应性;2)最大最小公平性;3)快速响应网络变化;4)高可靠性;5)稳定性.     

一种用于提高802. 15. 4网络性能的区分服务模型

IEEE802. 15. 4作为低速率、低功耗的无线传感器网络标准,其媒体接入控制(MAC)协议的竟争接入时段(CAP)对所有数据帧和节点都采用相同的竞争参数,不能为某些需要服务区分的应用提供很好的服务。针对这一问题,提出了一种基于区分服务的改进IEEE802. 15. 4机制以支持高QoS要求。该机制的主要思想是根据服务质量要求(时延及吞吐量)为不同的数据流分配不同的优先级,对不同优先级数据设置不同的数据帧长度和竟争参数来达到区分服务的目的。与此同时提出一种区分服务的不饱和马尔科夫链模型来分析所提出的机制。该模型评佑了采用此简单但有效的区分服务机制后两种优先级数据的信道接入概率、吞吐量、时延及能耗等性能。分析结果表明,此模型对区分服务起到了很好的效果。     

Node scheduling problem in underwater acoustic sensor network using genetic algorithm

Underwater acoustic sensor network (UWASN) has recently aroused the interest of researchers and scientists in this field. The acoustic sensor bandwidth is limited in underwater and it causes low successful packet transmission. One of the methods to overcome this handicap is efficient broadcast scheduling of underwater acoustic sensor node (UASN) that would help in transmitting and receiving data without any collision. This can be done with the help of time division multiple access (TDMA). The basic idea is to address broadcast scheduling problem in UWASN for utilizing the limited available bandwidth by parallelizing the node transmission such that it does not interfere with each other in same time slot; it also minimizes the node turnaround transmission time in the network by optimizing the time slots in TDMA frame. The objective of this paper is to maximize the utilization of the available underwater acoustic bandwidth and to achieve high throughput as well as to reduce the node turnaround wait time by using an evolutionary genetic algorithm (GA). The simulation results prove that every node in the UWASN transmits in an average minimal turnaround time by minimizing the time slots and maximizing the throughput in the network by scheduling the possible nodes with parallel transmission.     

基于节点重要度的路由选择与频谱分配算法

在频谱一致性和频谱连续性的约束条件下,弹性光网络运行一段时间后,网络频谱会出现大量碎片的问题。针对碎片以及业务在各节点间分配不均衡的问题,提出了一种基于节点重要度的路由选择与频谱分配算法NIRSA（Route Selection and Spectrum Allocation algorithm based on Node Importance）。该算法针对路由选择问题,考虑业务的类型与大小,找出网络中的关键节点,使得业务分配达到均衡。在频谱分配方面,算法考虑到网络链路上频谱资源的分布情况,结合每个业务所需的频隙数,可以尽可能地减少频谱碎片。在NSFNET和USNET两个不同规模的网络拓扑环境下,对所提算法进行了仿真实验。仿真结果显示,所提出的NIRSA算法既可以有效地降低业务阻塞率,又能提高网络的频谱利用率,实现网络性能提升。     

快速分组交换环网SFPring及其特性

本文介绍了一种新型同步时隙快速分组交换环网（ＳＦＰｒｉｎｇ）及其特性。此网通过对时隙环增加环路帧同步器的方法，使得环路的时隙一致，简化环路接口，虽使时隙环在低负荷下延时特性略有下降，但由于能采用分组目的站回收方案，可使其重负荷条件下效率提高一倍，因而其十分适于综合业务局域数字网。     

Analysis of an access node multiplexer in a system serving CBR and VBR traffic

This paper considers a multiplexer at the access node of a system serving both CBR and VBR services in a B-ISDN environment. The CBR traffic component represents fixed bit rate services in an ATM network. Such services need to be allocated a fixed number of time slots in each output frame. The VBR traffic here represents connectionless and connection oriented variable bit rate services that are loss sensitive but delay insensitive. A mathematical model is developed for such a system and performance parameters are evaluated. These results are verified by simulation.     

Medium-access control protocols for WDM-based optical access networks with passive-star clusters interconnected by a backbone ring

This paper investigates the performance of medium access control (MAC) protocols in a wavelength-division multiplexing (WDM) based optical access network consisting of a backbone ring interconnecting several passive-star-based clusters of optical networking units (ONUs) at customer premises. Each cluster is connected to the backbone through an access node (AN). A scheduler located in each AN, executes two MAC protocols, one for the intracluster traffic and the other for the intercluster traffic. In order to maintain the quality of service, the scheduler in the AN employs, priority-based queuing for the intercluster traffic on pre-assigned wavelengths. For controlling the intracluster traffic, the scheduler employs pre-transmission coordination with ranging and look-ahead functionalities in the MAC protocol. The performance of MAC protocol for intracluster traffic is evaluated through event-driven simulation, while for intercluster traffic the MAC performance is evaluated through analytical modeling of the queuing system employing two dynamic bandwidth management schemes. Performance of the intracluster MAC protocol is shown to be improved by novel use of subcarrier multiplexing on the wavelength used for the control packet transmission. A comparative study of the two intercluster schemes in terms of end-to-end delay is carried out, to understand the effect of priority queuing on the real-time and non-real-time service packets.     

Dynamic routing and spectrum (re)allocation in future flexgrid optical networks

Future flexible-grid elastic optical networks are very promising due to their higher spectrum efficiency and flexibility comparing to the rigid spectrum grid optical networks realized with the traditional wavelength division multiplexing (WDM) technology. The maturity of key system components enabling flexgrid optical networks, such as advanced modulation techniques and multi-granular switching, is already high enough and thus their deployment is expected in the near future. The main feature of such networks is the removal of fix grid-space assignment (in general 50 GHz) to the optical connections independently of the required bandwidth. In fact, the available optical spectrum in flexgrid network is divided into frequency slots of a fixed spectrum width and an optical connection can be allocated into the number of slots that better matches the actual bandwidth of the connection demand. Nonetheless, such allocation must satisfy two constraints, i.e. the slots must be (i) contiguous in the spectrum domain and (ii) continuous along the links on the routing path. These constraints result in a need for dedicated Routing and Spectrum Allocation (RSA) algorithms able to operate under dynamic traffic conditions. From the network design perspective, an important issue is the selection of the frequency slot width which may have an impact on the network performance. Last but not least, network dynamicity entails spectrum fragmentation, which significantly reduces the network performance. In this paper we address these topics and, in particular: (1) we present an RSA algorithm to be used in dynamic network scenarios, (2) we study the optimal slot width as a function of the foreseen traffic to be served, and (3) we propose an algorithm to reallocate already established optical connections so that to make room in the spectrum for the new ones. Exhaustive simulation results reveal that the proposed approach improves the blocking probability performance in flexgrid optical networks.     

Agile bandwidth management techniques in slotted all-optical packet switched networks

The next generation metro network is most likely to be based on high-capacity agile all-optical networks. We consider a metro network architecture that consists of a number of buffer-less all-optical core switches, where a number of edge switches are connected to each core switch in an overlaid star topology. We would like to design potential candidates of resource-sharing schemes in such a network and evaluate their performances, where they guarantee to deliver optical packets to their destinations. The first scheme is reservation-based, in which decisions are made at each core switch so that collisions (and therefore loss) can be avoided through reservations. For this scheme, we have re-designed the BvN (Birkhoff von Neumann) scheduling algorithm to accommodate the asymmetric multi-fiber/multi-wavelength feature in star OPS. In the second scheme, distributed and independent decisions are made at edge switches, but we need to retransmit the traffic dropped at core switches in the optical domain. We also implement a hybrid case as the third scheme which combines the good attributes of both previous schemes. We have characterized and evaluated the performance of these resource-sharing schemes by various QoS measures such as delay and loss probabilities in edge switches.     

Rate-based control schemes for ABR traffic — Design principles and performance comparison

A new ATM service category, the Available Bit Rate service, has been introduced in the ATM Forum. It dynamically allocates available bandwidth to users by controlling the flow of user traffic with feedback. The Forum has ratified the rate-based flow control framework for the support of this new service. In this paper, we provide a recipe for designing rate-based feedback schemes demonstrating the rich variety of available switch mechanisms. Each aspect of the feedback control loop mechanism is explored in detail and several available choices are investigated. Two example switch mechanisms are provided that illustrate the rate-based control design principles. The ability of these mechanims to support the desired objectives of an ABR service is compared using a reference network configuration. Simulation results show that the rate-based framework allows a great degree of architectural flexibility in the design of switch mechanisms. However, the explicit rate based approach is more capable than single bit feedback approaches in providing immediate access to available bandwidth in the presence of VBR sources. The rate-based framework provides switch vendors sufficient flexibility to choose a mechanism among several available options, based on their performance requirements and cost budges.     

Bandwidth allocation in UWB WPANs with ECMA-368 MAC

The new ECMA-368 MAC for UWB WPANs consists of two channel access methods: the distributed reservation protocol (DRP) and prioritized contention access (PCA). The exact method of medium access slot (MAS) allocation in DRP is not specified in the standard. The contribution of this paper is twofold. First, the paper describes a distributed resource allocation method in which a number of interference–avoidance rules are used to reserve slots for devices. Devices maintain sending and receiving tables to track activities in the neighbourhood. The proposed method is a simple, effective solution to the DRP MAS allocation problem, avoiding reservation conflicts and interference from hidden terminals. Secondly, for VBR MPEG-4 video traffic, we propose a bandwidth requirement calculation method based on traffic prediction. In the proposed scheme bandwidth is allocated based on accurate traffic predictions, therefore matching network resources to the traffic demand. Application QoS is maintained while network utilization is kept high. Furthermore, the simple, adaptive linear predictor does not incur much computation overhead. Simulation results have demonstrated the accuracy of the proposed prediction algorithm and effectiveness of the bandwidth allocation method.     

时隙ALOHA协议下的网络化控制系统协同设计

针对网络化控制系统中信道容量有限的问题,本文提出一种基于时隙ALOHA通信协议的控制与通信协同设计方法.将控制系统的采样周期划分为若干等长度的时隙,在每个时隙中,系统的分布式传感器通过时隙ALOHA协议来随机竞争接入网络.由于在不同的采样周期各个传感器的接入状态不同,整个状态反馈控制系统将在若干子系统之间进行切换.据此,本文建立了离散的切换系统模型,并利用分段李雅普诺夫函数方法和平均驻留时间技术得到了能够保证系统指数稳定的充分条件.然后,给出能够保证控制系统稳定所需的信道吞吐率的界限,进而得到了时隙ALOHA协议中的最大重传次数与控制系统衰减率的定量关系.通过上述方法,本文建立了控制-通信协同设计的框架结构,可将控制器的增益矩阵和时隙ALOHA通信协议进行协同设计.最后,通过仿真验证了本文所提出的协同设计方法的有效性.     

Performance analysis of an ingress switch in a JumpStart optical burst switching network

We consider an ingress optical burst switching (OBS) node employing the JumpStart signaling protocol. The switch serves a number of users, each connected to the switch with a fiber link that supports multiple wavelengths. Each wavelength is associated with a 3-state Markovian burst arrival process which permits short and long bursts to be modeled. We model the ingress switch as a closed multi-class non-product-form queueing network, which we analyze approximately by decomposition. Specifically, we develop new techniques to analyze the queueing network, first assuming a single class of customers, and subsequently multiple classes of customers. These analytical techniques have applications to general queueing networks beyond the one studied in this paper. We also develop computationally efficient approximate algorithms to analyze an ingress switch in the limiting case where the number of wavelengths is large. The algorithms have a good accuracy, and they provide insight into the effect of various system parameters on the performance of an ingress OBS switch.     

Performance Analysis of CSMA/CA Protocol for High-speed Wireless LANs

In this paper, we present an exact analysis to numerically evaluate the performance of the multiple random access method with non-persistent carrier sense multiple access with collision-avoidance (CSMA/CA) protocol for high-speed and realizing fully-distributed wireless LANs. The collision-avoidance portion of CSMA/CA in this model is performed with a random pulse transmission procedure, in which a user with a packet ready to transmit initially sends some pulse signals with random intervals within a collision-avoidance period before transmitting the packet to verify a clear channel. The system model consists of a finite number of users to efficiently share a common channel. The time axis is slotted, and a time frame has a large number of slots and includes two parts: the collision-avoidance period and the packet-transmission period. A discrete-time Markov process is used to model the system operation. The number of slots in a frame can be arbitrary, dependent on the chosen lengths of the collision-avoidance period and packet-transmission period. The influence of possible length of the collision-avoidance period and packet-transmission period, and pulse transmission probabilities on the network performance are discussed, based on the results of the utilization of channel and average packet delay for the different packet generation rate.     

基于黑龙江省高速公路监控系统的设计

黑龙江省高速公路监控系统摄像机沿道路呈线性分布,采用EPON无源光网络技术对外场监控摄像机进行组网并构建前端接入网络.EPON的组网方式,可以极大的节省主干线踏光纤资源,且每个监控点到交换机都为独享带宽.