基于寄存器插入环的环形交换结构

弹性分组环是（RPR）是基于分组业务优化的城域网络体系结构,其环形结构属于寄存器插入环。寄存器插入环同时具有时分复用和空分复用的特点,而且环形结构的调度简单,很适合作为交换结构使用。本文将寄存器插入环结构用于交换结构。以排队论为工具对环形交换结构进行建模,分析环形交换结构的性能。结果表明寄存器插入环结构是一种适合高速分组交换的结构。     

弹性分组环的带宽利用率及公平策略分析

弹性分组环(ResilientPacketRing,RPR)是刚被IEEE802.17标准化的主要用于宽带IP光城域网的新型技术,其带宽利用效率和传统环网相比具有较大的优势。论文通过建立弹性分组环基本带宽模型并对其带宽利用率及带宽分配的公平策略进行分析。分析结果表明:RPR带宽利用率在“环形”业务模式下最高,而在星型业务模式下和传统环网相比则无优势;在比较接近实际情况的“网状”业务模式下,基于节点公平的带宽利用率可以到达传统环网的2倍,而基于流的公平策略的带宽利用率可以到达基于节点公平的近2倍,更适合于具有空间重利用能力的RPR。     

寄存器插入环带宽性能及公平策略分析

弹性分组环(RPR)是刚被IEEE802.17标准化的主要用于宽带IP光城域网的新型技术,其带宽利用效率和传统环网相比具有较大的优势.弹性分组环从属寄存器插入环(RIR),通过建立基本带宽模型并对寄存器插入环带宽利用及带宽分配的公平策略进行更一般性的研究,分析结果表明:寄存器插入环在"环形"业务模式下带宽利用率最高;而在星型业务模式下和传统环网相比则无优势.在比较接近实际情况的"网状"业务模式下,基于站点公平的吞吐量可以到达传统环网的N/2(N-1)倍(单环),而基于流的公平策略的吞吐量可以到达基于站点公平的近2倍,并且环段带宽利用率到达物理极限的最大值1,是寄存器插入环的最优策略;同时,双环结构比单环结构具有更大的带宽利用效率.     

光多环互连的弹性光突发交换环的信道调度

本文针对多环互连的弹性光突发交换环网的控制结构展开了研究探讨,针对目前RPR与OBS网络提出的信道分配与调度算法,虽然在一定程度上提高了信道的利用率,但始终没有从全网角度考虑波长分配,环网结构中仍会引起较大的丢包。鉴于此我们在此从资源利用率,时延,成本方面提出一种更适合环网和网状网的混合目的信道优先算法(FDCP,Fixed Destination Channel Priority),并建模仿真分析。     

报文RPR环网选路表方法

弹性分组环技术是一种优化的、用于光纤环型拓扑的、并具有强壮和高效特点的技术。弹性分组环网能够承载多种业务,包括对抖动和时延敏感的如话音和视频流量、以太网和 IP 业务等。该文提出了报文RPR (Resilient Packet Rings)环网的选路表方法及设计方案,该方法成功地解决了数以10万计路由表项的更新、复杂RPR拓扑库的震荡、高成本硬件存储空间和CPU开销的难题。     

基于Intel网络处理器的RPR三层交换机的设计

弹性分组环(ResilientPacketRing,RPR)是一种能高效地支持数据业务的新兴城域网络技术。论文主要使用IntelIXP2800网络处理器设计和实现了能为以太网提供接入RPR网络能力的三层交换机。设计过程中,在二层交换机制的基础上,参考了IPoverRPR框架和三层交换原理,对RPR网络与以太网络之间IP数据交换机制进行了优化,并借助IXP2800网络处理器的高性能和灵活性,使该交换机能高效地进行IP数据交换,而且提高了RPR环网的带宽利用率。     

IP城域网中的RPR技术研究

在传统分组交换结构中，存在较大的延时和抖动。KPR环上的每个结点对数据包的处理简化了结点间操作。当结点失效或者链路发生故障的时候，RPR有保护措施，保证环网的连通性。KPR技术城域网在宽带业务、AG业务得到应用。     

RPR技术在地级市电力系统中应用设想

RPR（弹性分组环）是一套用来建立IP环网的国际标准。近年来在电力系统中的应用得到发展,本文阐述了RPR技术和RPR与MSTP,MPLS等技术的结合应用。     

RPR技术在地级市电力系统中应用设想

RPR(弹性分组环)是一套用来建立IP环网的国际标准。近年来在电力系统中的应用得到发展,本文阐述了RPR技术和RPR与MSTP,MPLS等技术的结合应用。     

一种弹性分组环跨环互连模型

针对目前弹性分组环技术无法组建复杂多环网络,不能透明承载端到端跨环数据业务的问题,提出一种基于通用多协议标签交换 (GMPLS)技术的跨环互连承载模型。该模型通过拓展GMPLS数据平面中的分组交换能力,可实现弹性分组环多环互连和跨环业务承载。仿真结果表明,该模型可行、有效,能透明、可靠地传送跨环数据业务。     

地铁通信系统的RPR

地铁传输系统承载着大量的业务,在保留同步数字体系（SDH）4优势的基础上,将弹性分组环（RPR）处理功能融入其中,强化多业务传输平台（MSTP）的以太网业务处理能力,可以实现以太网带宽的统计复用、公平的带宽分配、更加严格的业务分类（Cos）和服务质量（Oos）以及更加安全的用户隔离功能,逐步成为当前城域网建设的主流技术。解决了目前地铁通信系统中IP业务的不断增长的问题。     

Achieving destination differentiation in ingress aggregated fairness for resilient packet rings by weighted destination based fair dropping

The IEEE 802.17 is a standardized ring topology network architecture, called the Resilient Packet Ring (RPR), to be used mainly in metropolitan and wide area networks. This paper introduces destination differentiation in ingress aggregated fairness for RPR and focuses on the RPR MAC client implementation of the IEEE 802.17 RPR MAC in the aggressive mode of operation. It also introduces an enhanced active queue management scheme for ring networks that achieves destination differentiation as well as higher overall utilization of the ring bandwidth with simpler and less expensive implementation than the generic implementation provided in the standard. The enhanced scheme introduced in this paper provides performance comparable to the per destination queuing implementation, which is the best achievable performance, while providing weighted destination based fairness as well as weighted ingress aggregated fairness. In addition, the proposed scheme has been demonstrated via extensive simulations to provide improved stability and fairness with respect to different packet arrival rates as compared to earlier algorithms.     

基于Pareto分布的IP骨干节点输入通信量模型

输入通信量的行为特性对于IP骨干网节点的性能和设计有重要的影响.本文从IP骨干网络节点输入通信量角度出发,提出了一个基于Pareto和指数分布的混合通信量模型,其中数据包到达间隔为Pareto分布,包大小为指数分布.该模型克服了传统网络通信量模型中没有显式考虑数据包大小的缺点,从数据包级对网络通信量进行了精确的描述,从而能够更好地进行路由器结构设计和性能分析.仿真实验验证了我们模型的有效性.     

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

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

BitTorrent packet traffic features over IPv6 and IPv4

At present, BitTorrent protocol packets constitute a large part of peer-to-peer application traffic on the Internet. Due to the increasing amount of BitTorrent traffic, it has become inevitable to take into account its effects on network management. Generally, studies on BitTorrent traffic measurement have involved analysis with packets transmitted via IPv4 protocol. However, with several facilities provided by IPv6 protocol, its traffic volume in operational networks is increasing day by day. New features of IPv6 enhance packet processing speeds over routers, switches and end systems. We consider that traffic features and packet traffic characteristics are likely to be affected with increasing amount of IPv6 protocol traffic. Therefore, it becomes significant to explore IPv6 packet traffic characteristics and application traffic features over IPv6. In this study, we investigate the IPv6 BitTorrent packet traffic characteristics in terms of autocorrelation, power spectral density and self similarity of packet size and packet interarrival time. We also perform distribution modeling for IPv4 and IPv6 BitTorrent packet traffic. With these models, efficient packet traffic traces are generated for network simulation studies. A detailed comparison is performed to determine differences between IPv4 and IPv6 BitTorrent packet traffic.     

JitterPath: Probing Noise Resilient One-Way Delay Jitter-Based Available Bandwidth Estimation

Measurement of end-to-end available bandwidth has received considerable attention due to its potential use in improving QoS. Available bandwidth enables the sending rate to adapt to network conditions, so that packet loss, caused by congestion, can be significantly reduced before error control mechanisms are finally employed. To this end, we propose a probing noise resilient available bandwidth estimation scheme, called JitterPath, which is adaptive to both the fluid and bursty traffic models. Two key factors, one-way delay jitter and accumulated queuing delay, are both exploited to predict the type of queuing region for each packet pair. Then, the bottleneck utilization information included in the joint queuing regions is estimated and used to quantify the captured traffic ratio, which indicates the relationship between the probing rate and available bandwidth. The contributions of our method are as follows: 1) JitterPath can work without being restricted to fluid traffic models; 2) since JitterPath does not directly use the bottleneck link capacity to calculate the available bandwidth, it is feasible for use in a multihop environment with a single bottleneck; and 3) JitterPath inherently reduces the impact of probing noises under the bursty cross traffic model. Extensive simulations, Internet experiments, and comparisons with other methods were conducted to verify the effectiveness of our method under both single-hop and multihop environments