空分交换型OPS节点技术

光分组交换(OPS:Optical Packet Switching)核心交换节点结构的设计直接影响着光分组交换网络的性能.文章以空分交换型OPS核心交换节点结构为研究对象,对光分组交换节点结构中的竞争解决技术进行深入探讨.此外,还总结归纳了5种空分交换型OPS节点结构,即输出缓存型、反馈缓存型、共享缓存型、混合缓存型和无缓存型.     

采用部分共享光缓存和共享波长转换器的光分组交换节点性能分析

本文研究了采用部分共享缓存(PSB)和共享波长转换器(SWC)的光分组交换节点在自相似流量下分组丢失率和时延与输出光缓存深度、循环共享光缓存的深度和组数以及波长转换器数量之间的关系,并讨论了相关的尺度和规模问题.结果表明,部分共享光缓存和共享波长转换器的光分组交换节点交换结构可以达到很高的性能;采用共享方式可显著减少波长转换器的数量;在保持共享缓存总的深度不变的情况下,适当增加循环共享光缓存组数可以使交换达到更好的性能.     

一种软件定义的信息中心网络架构北大核心

现有SDICN(软件定义信息中心网络)技术方案难以支持海量内容分发、交换和缓存组件的分别升级。文章提出一种基于覆盖网络的SDICN系统架构,由网络边缘的缓存节点转发内容请求和缓存内容数据,缓存与交换不再耦合,克服了现有技术方案的上述局限;基于SDN(软件定义网络)的集中式控制,避免了覆盖网络系统的次优控制问题。原型系统实验分析表明,所提系统可直接运行于通常的SDN中,少量的边缘节点即可有效减少内容分发响应时间。研究结果有利于SDN和ICN(信息中心网络)技术的扩展及应用。     

光分组交换网络中的光缓存技术研究

论述了全光缓存技术在光分组交换(OPS)网络中的应用,以及光缓存器在分组交换节点的各种配置结构,实现全光缓存的关键技术等。最后对全光缓存器的发展方向作了展望。     

一种基于SDN的CCN集中控制缓存决策方法

在软件定义网络(SDN)和内容中心网络(CCN)融合架构下,为了充分利用控制层对网络拓扑和缓存资源的全局感知,在全网中实现缓存资源的优化使用,提出了一种集中控制的缓存决策优化方案.在该方案中,应用粒子群优化算法(PSO)并且根据节点边缘度、节点重要度以及内容流行度对缓存资源和内容进行集中缓存决策,使得内容在不同的节点进行合理的缓存.仿真结果表明,通过评估缓存大小对缓存性能的影响,PSO缓存决策方法取得了比LCE、PROB缓存决策策略更优的缓存命中率和路径延展率,明显降低了缓存节点的缓存替换数,使得缓存达到了整体缓存优化.     

一种全包交换实验网络——光弹性分组环

选择了一种使用光缓存器比较少的网络--光弹性分组环进行了全光分组交换实验.该网络的净负荷不进行光/电/光转换,只对帧头进行转换、地址识别和调度,从而克服了光电转换的电子瓶颈.在光节点上,只需使用一个全光缓存器作为转发缓存器,而使用了两个电缓存器分别作为下路接收缓存器和上路发送缓存器.报告了该实验网络的拓扑、节点结构、数据通道、MAC层的数据通道控制子层以及所使用的光缓存技术.     

一种基于负载选择的光分组交换缓存结构

提出了一种基于业务负载选择的光分组交换(OPS)网络的光缓存结构,根据业务负载大小灵活选择缓存方式。输出缓存光纤延迟线(FDL)采用分段式共享机制配置,输出/反馈共享缓存模块采用简并式配置,以提高有限数目FDL的利用率。分析和仿真表明,这种可选择的缓存结构可以有效降低丢包率和OPS节点需求的FDL数目。     

基于优先级的OBS核心节点性能研究

设计了基于业务优先级的光突发交换核心节点模型,采用多级光纤延迟线的光缓存来提高交换网络的性能.交换节点在4个端口8条波长(4×8核心交换结构)的情况下,当光纤延迟线基本延迟单元为50μs、级数为8,负载为0.8时,丢包率小于0.01;为了满足不同业务服务质量的要求,将数据包按优先级划分,采用基于优先级的插空算法(VFPP),在相同缓存配置条件下使高优先级数据的丢包率降低到以下,在高负载下平均时延小于不区分优先级的情况.     

一种用于光组播冲突解决的节点结构及其调度策略

光分组在核心节点处的冲突解决问题是实现全光 组播分组交换的关键。本文提出了一种新型的解决光组播冲突的节 点结构,用于冲突解决的部分包括输出共享的网络编码模块和光纤延迟线(FDL)环 形反馈共享缓存(FDL-LSFB)模块。网络编码 模块将异或网络编码作为冲突解决方式,利用全光异或门将冲突组播进行网络编码并且改变 编码后分组波长,从而避免波长 冲突。而FDL-LSFB模块由子交换矩阵和FDL缓存组连接成环状,且冲突组 播可从任意子交换矩阵进出缓存模块, 使用少数的FDL可以提供大容量的光缓存、提高FDL利用率。针对FDL-LSFB模块冲突组播调 度问题,为减小缓存时延,设计了最小缓存长度级联控制算法(MLCBST),进而提出冲突光 组播的总调度策略。仿真结果表明,本文提出的组播节点结构和调度策略在降低丢包率(PLP)和减小缓存时延方面具有明显的效果。     

NDN中基于蚁群替换算法的邻居协作缓存管理策略

为提高NDN(命名数据网络)中的缓存利用率,提出了一种基于蚁群替换算法的邻居协作缓存管理(ACNCM)策略。首先将单节点的缓存替换问题,建模为0/1背包问题,并根据缓存数据的大小、使用频率以及邻居副本深度等信息定义本地存储内容的缓存价值,提出基于蚁群算法的缓存替换算法。然后利用邻域协作的思想,通过路由节点之间定期交换自身节点的缓存信息,对单个节点替换出去的缓存内容,选择邻居节点完成协作式缓存管理。实验结果表明,ACNCM策略在缓存命中率、网络开销和平均响应时延方面均优于现有方法。     

Intelligent Flow Control Technique of ABR Service in ATM Networks Based on Fuzzy Neural Networks

ＩｎｔｅｌｉｇｅｎｔＦｌｏｗＣｏｎｔｒｏｌＴｅｃｈｎｉｑｕｅｏｆＡＢＲＳｅｒｖｉｃｅｉｎＡＴＭＮｅｔｗｏｒｋｓＢａｓｅｄｏｎＦｕｚｚｙＮｅｕｒａｌＮｅｔｗｏｒｋｓ①ＺｈａｎｇＬｉａｎｇｊｉｅＬｉＹａｎｄａＬｉＱｉｎｇｈｕａＷａｎｇＰｕ（ＤｅｐｔｏｆＡ...     

Two-way TCP traffic over rate controlled channels: effects andanalysis

We study the performance of bidirectional TCP/IP connections over a network that uses rate-based flow and congestion control. An example of such a network is an asynchronous transfer mode (ATM) network using the available bit rate (ABR) service. The sharing of a common buffer by TCP packets and acknowledgment (acks) has been known to result in an effect called ack compression, where acks of a connection arrive at the source bunched together, resulting in unfairness and degraded throughput. It has been the expectation that maintaining a smooth flow of data using rate-based flow control would mitigate, if not eliminate, the various forms of burstiness experienced with the TCP window flow control. However, we show that the problem of TCP ack compression appears even while operating over a rate-controlled channel. The degradation in throughput due to bidirectional traffic can be significant. For example, even in the simple case of symmetrical connections with adequate window sizes, the throughput of each connection is only 66.67% of that under one-way traffic. By analyzing the periodic bursty behavior of the source IP queue, we derive estimates for the maximum queue size and arrive at a simple predictor for the degraded throughput, for relatively general situations. We validate our analysis using simulation on an ATM network using the explicit rate option of the ABR service. The analysis predicts the behavior of the queue and the throughput degradation in simple configurations and in more general situations     

Performance issues in public ABR service

The available bit rate (ABR) service attracted much attention during the negotiations leading to Traffic Management Specification Version 4.0, finalized by the ATM Forum. In thr ABR service, feedback flow control of the source rate is provided in response to the changing asynchronous transfer mode (ATM)-layer transfer characteristics. The reference behavior of the source end system, the destination end system, and the switch, as detailed in the specification, allows cooperative control among these systems. The performance of the public ABR service is discussed in connection with the evolution of ATM switches. Public networks with first-generation switches provide an ABR service with a limited peak cell rate (PCR), while those with second-generation switches can provide an ABR service with any PCR. In such networks, TCP-over-ABR works well. Point-to-multipoint ABR will be provided in advanced switches. A method is proposed for maintaining the throughput of point-to-multipoint ABR when the number of leaves is increased     

Evolution of controls for the available bit rate service

In the summer of 1993, the asynchronous transfer mode (ATM) community began a search for a mechanism to allocate bandwidth dynamically within an ATM network, while simultaneously preventing data loss. By the fall of 1994, the ATM Forum had introduced a new service category for this purpose, the available bit rate (ABR) service, and had selected a rate-based mechanism for its support. Simply put, the mechanism would consist of a stream of ABR resource management (RM) cells, generated by one end of the connection (the source) and looped back by the other (the destination), into which switches would encode the maximum rate at which the ABR source was to generate data. The ABR service is an addition to ATM that uses a feedback mechanism to control the transmission rates of traffic sources. Although the performance of the ABR service will depend critically on the quality of feedback sent by switches, the algorithms for determining this feedback are largely outside the scope of ATM standards and specifications. We describe how two of the properties implemented by the ABR source and destination, out-of-rate RM cells and a use-it-or-lose-it policy, were implicitly architectural decisions, and we explain how and why the ATM Forum ultimately revised these decisions. We then discuss how the ATM Forum addressed the issues of conformance testing, point-to-multipoint connections, and parameter negotiation for the ABR service. At the end, we reflect on the process by which the ABR specification was developed     

A predictive self-tuning fuzzy-logic feedback rate controller

This paper addresses the design and analysis of an end-to-end rate-based feedback flow control algorithm motivated by the available bit rate (ABR) service in wide-area asynchronous transfer mode (ATM) networks. Recognizing that the explicit feedback rate at time t will not affect the ABR buffer until time t+D for some D⩾0, our approach is to first predict the ABR buffer status at time t+D, then base fuzzy-logic rate control decisions on these predicted values, and finally tune the controller parameters using gradient descent methods. Simulations show that this predictive self-tuning fuzzy-logic (PSTF) control scheme is efficient, stable, and outperforms other proposed ABR rate controllers in a variety of network environments. With delays corresponding to a US coast-to-coast connection, the PSTF controller can maintain high link utilization, avoid buffer overflows, and provide fair allocation of resources     

Fair packet discarding for controlling ABR traffic in ATM networks

The asynchronous transfer mode (ATM) Forum has chosen rate-based control as the flow control scheme for the available bit-rate (ABR) service. However, rate-based schemes can achieve congestion control only if all users act in a cooperative manner. Even a limited number of uncooperative users can cause congestion collapse. We propose a mechanism called fair packet discarding to provide incentives to users to participate in network congestion control so that the network can operate in a more efficient manner     

Resource Requirements for ABR Explicit Rate Flow Control: Deterministic and Probabilistic Analyses

ATM Available Bit Rate (ABR) service is intended to offer low cell loss for non-real-time data sources that can respond to closed-loop flow control. ATM Forum Traffic Management Specification Version 4.0 defines the various parameters used in the ABR flow control, as well as the source, destination, and switch behaviors. However, the switch designers and service providers are free to choose the method of congestion control to implement and the ABR Quality of Service (QoS) objective to offer. This paper addresses the interaction among the flow control algorithm, the switch resource requirements, and the resulting QoS characteristics.In this paper we propose and evaluate an Explicit Rate (ER) algorithm. The objective of this algorithm is to maintain the total buffer occupancy of all ABR connections to be close to a given threshold. By maintaining a non-zero queue, the ABR service can achieve a high utilization. The switch periodically determines its desirable ER value, based on the available capacity, the ABR buffer occupancy, and the number of active ABR sources.We develop analyses that relate ABR resources to QoS objectives for this algorithm. The first approach is a deterministic, conservative analysis. It provides formulas for determining the ABR buffer and capacity requirements that can achieve zero buffer overflow.The second analysis determines an upper bound on the buffer overflow probability when the above requirements are not met. The result is most effective when the number of active sources is a small fraction of the total ABR connections. Numerical examples show that by slightly relaxing the loss constraint, resource requirements can be significantly reduced.     

On max-min fair congestion control for multicast ABR service in ATM

In the ATM Forum activities, considerable efforts have focused on the congestion control of point-to-point available bit rate (ABR) service. We present a novel approach that extends existing point-to-point (unicast) congestion control protocols to a point-to-multipoint (multicast) environment. In particular, we establish a unified framework to derive a multicast congestion control protocol for an ABR service from a given rate-based unicast protocol. We generalize a known necessary and sufficient condition on the max-min fairness of unicast rate allocation for a multicast service. Using this condition, we show that the resulting multicast protocol derived using our framework preserves the fairness characteristics of the underlying unicast protocol. The practical significance of our approach is illustrated by extending a standard congestion control mechanism for an ABR service to a multicast environment. The performance of the resulting multicast protocol is examined using benchmark network configurations suggested by the traffic management subworking group at the ATM Forum, and simulation results are presented to substantiate our claims     

The rate-based flow control framework for the available bit rateATM service

A new ATM service category, the available bit rate service, is currently the subject of intense development. This new service will systematically and dynamically allocate available bandwidth to users by controlling the flow of traffic with feedback. The rate-based flow control framework has been identified as the most appropriate for the support of this new service     

ATM网络中ABR业务的流量控制

本文讨论了ＡＴＭ网络中ＡＢＲ业务的特性及基于ＡＢＲ业务的拥塞控制机制，了拥塞控制技术的最新发展情况，并比较了各种控制机制的优缺点。