IP骨干路由器的CoS功能

新的IP应用（如实时的视频和音频应用）的开发和普及,对网络提供的服务提出了更高的要求,网络必须能够对用户信息流进行分类,并对不同类的信息流提供不同的服务特性,这就要求IP骨干路由器具有CoS（服务分类）功能,本文以Juniper Networks公司的M系列路由器为例,简单介绍了目前普通IP骨干路由器所具有的CoS功能。     

片上网络调度算法相关研究

随着半导体集成工艺的发展,单个芯片上集成的IP核数目急剧增加,片上网络(NoC)成为未来取代总线设计的新模式。调度算法作为NoC研究的关键问题之一,对整个网络的传输性能起着重要的作用。本文对片上网络虚信道路由器调度算法的相关研究进展进行了总结,首先从路由器结构特点出发,介绍了几种典型的NoC仲裁器和调度器实例,总结相应的算法设计思想。再对NoC常用路由器调度算法进行了分类介绍,详细分析了各种调度算法的相关特性。最后,探讨了NoC路由器调度算法的研究方向。     

一种多维IP包分类算法

IP分类算法是应用在高性能路由器中的一种重要算法，研究IP分类算法对于提高路由器综合性能具有重要意义。基于无冲突哈希函数和AQT算法提出了一种新的IP分类算法NCHAQT（Non—Collision Hash AQT）。NCHAQT解决了AQT算法只能应用于二维的情况，使AQT可以应用于五维分类，增强了它的可扩展性。理论分析与仿真实验表明，NCHAQT在时间性能上算法优于经典算法Modular，是一个综合性能较高的包分类算法．     

低功耗IP电话及VoIP设备的电源管理

由于其更低的话费成本,互联网协议(IP)电话在企业和小型经营场所正变得越来越流行.IP电话通过路由器利用以太网供电以后,虽然安装成本降低了,但是电源管理解决方案变得愈加复杂.本文中,我们将讨论使用VoIP的一些可能情况,以及IP电话使用的一些电源状态.我们还会介绍IEEE 802.3af以太网供电(PoE)的分类.另外,我们将使用一种IP电话设计的典型构架来描述负载点(PoL)电源要求和电源管理设计技术.     

输入排队Crossbar架构下的流量模型

 本文基于IP包在路由器各端口到达流量的统计特性,建立了输入排队Crossbar架构下的流量模型,对IP包流量的平均到达速率、突发性和均衡性等流量特征进行了分类定义,给出了各自的充要条件.文中所讨论的突发度B和不均衡度U为到达流量提供了精细的计算粒度,从而为基于IQ-VOQ的调度算法性能评估提供了理论依据.与LAN的自相似模型、WAN的Poisson模型以及数据业务的ON/OFF模型相比,本文讨论的流量模型更适用于基于IQ-VOQ调度算法性能的精确评估,为路由器交换架构的工程设计提供了理论依据.     

IP骨干路由器的CoS功能

新的IP应用（如实时的视频和间频应用）的开发和普及，对网络提供的服务提出了更高的要求，网络必须能够对用户信息流进行分类，并对不同类的信息流提供不同的服务特性，这就要求IP骨干路由器具有CoS（服务分类）功能，本以Juniper Networks公司的M系列路由器为例，简单介绍了目前普通IP骨干路由器所具有的CoS功能。     

基于压缩NH表的高速IP路由查找算法的研究

由于因特网速度不断提高、网络流量不断增加和路由表规模不断扩大,IP路由查找已经成为制约核心路由器性能的主要原因,因而受到了广泛重视.目前人们已经提出几种高速IP路由查找算法,但没有一种是理想的.本文提出一种使用压缩NH表进行IP路由查找的方法,它具有查找速率高、更新时间快、存储代价低、易于实现等特点,能满足10Gbps速率核心路由器环境的要求.     

可编程路由器中基于缓冲队列长度阈值的处理器调度

可编程路由器除了转发IP分组之外,还需要执行计算任务.如何调度可编程路由器中CPU的处理能力是一个需要解决的重要问题.本文首先建立了一种通用的可编程路由器软件体系结构,在此基础上,提出了一种基于缓冲队列长度阈值的CPU调度算法,采用随机Petri网对算法进行了模型分析和计算.结果表明,该调度算法可以同时保证可编程路由器中的尽力发送流和QoS流的计算需求.     

完全无冲突散列IP分类算法研究

介绍了IP分类技术研究的最新成果，以及IP分类的典型算法。提出了一种基于完全无冲突散列(hash)和跳转表Trie树(NHJTTT)的IP分类算法，通过分析比较，本文提出的算法无论是时问性能还是空间性能均优于无冲突散列查找算法和Grid of Tries算法，文中通过仿真给出了最终的分类效果。最后对提出的算法在虚拟环境下做了评判。     

智能终端中热IP核的通信方法

片上网络通信架构的改进,使热IP核连接多个路由器,并且原本与热IP核相连的一个路由器的通信量被分配到多个路由器上。基于改进的片上网络通信架构,又设计出新的路由器选择算法。在该算法中,可以根据热IP连接的路由器的当前状态选择数据通信的路由,这样使得热IP能够更加均匀地分配通信量,从而有效地提高了数据传输效率,降低数据传输延时。实验表明,新的算法能够有效减少传输延迟。     

访问控制列表在网络安全中的应用

访问控制列表ACL(access control list)是一种对经过路由器的数据流进行分类和过滤的技术,在网络安全中发挥着重要的作用。文中介绍了访问控制列表的基本原理、作用和特征,并举例说明了如何在网络安全中应用访问控制列表。     

A transceiver circuit for ATM networks

This paper presents a transceiver digital circuit. The circuit is responsible for the emission of packets to the asynchronous transfer mode (ATM) network as well as for the manipulation of received ATM packets belonging to virtual connections. It has been designed to support data communication services. The circuit, which can be used in terminals or in interworking units and switches, implements basic functions of the lower layers of the ATM protocol reference model. The transmission functionality includes cell buffering, header error control, cell assembling, rate coupling and information insertion. The receiver realizes information extraction, rate decoupling, cell buffering, header error detection and correction, connection identity fields extraction and identification, cell disassembling and classification, and idle cell discarding functions. The circuit has been implemented on applications specific integrated circuit (ASIC) chips.     

Waiting time and queue length distributions for go-back-N andselective-repeat ARQ protocols

The paper provides a performance analysis of automatic-repeat-request (ARQ) protocols in connection-oriented transmission. Each message arriving at a transmitter is divided into several packets, which are continuously transmitted to a receiver according to go-back-N ARQ or selective-repeat ARQ protocols. Because of connection-oriented transmission, messages are served on a first come first served basis, i.e., transmission of a message is commenced after all packets in the previous message are successfully transmitted. For the two ARQ protocols, the authors derive the probability generating functions of message waiting time and queue length at an arbitrary instant, from which the average performance measures are explicitly obtained     

Resequencing delay and buffer occupancy in selective repeat ARQwith multiple receivers

The authors consider a selective repeat (SR) automatic-repeat-request (ARQ) protocol with one source and multiple receivers. Each receiver acknowledges all packets and handles its resequencing buffer based only on the packets that it receives error-free. An analysis of the resequencing delay and buffer occupancy at a receiver is presented. The authors construct a model that makes it possible to derive steady-state results, taking into consideration such system parameters as number of receivers, propagation delay, packet error probabilities, and acknowledgments. The authors focus on two measures of occupancy. The first measure corresponds to the number of packets waiting to be resequenced whereas the second measure includes, in addition, the buffer space reserved for packets that cause resequencing delays. The main results are the distribution of the resequencing delay and the distribution of the number of packets occupying the receiver's buffer     

Implementation of a new MPEG-2 transport stream processor for digital television broadcasting

We introduce a real-time, dual independent output MPEG-2 transport stream (TS) processor designed specific for the China HDTV testing zones. The processor is a single piece of equipment, of which the core functions are realized in FPGA and DSP. Key technologies include a program clock reference (PCR) correction and a packets controller, which are important for TS processing, are described in detail. An improved PCR correction scheme developed by the authors is also proposed.     

Algorithms for packet classification

The process of categorizing packets into “flows” in an Internet router is called packet classification. All packets belonging to the same flow obey a predefined rule and are processed in a similar manner by the router. For example, all packets with the same source and destination IP addresses may be defined to form a flow. Packet classification is needed for non-best-effort services, such as firewalls and quality of service; services that require the capability to distinguish and isolate traffic in different flows for suitable processing. In general, packet classification on multiple fields is a difficult problem. Hence, researchers have proposed a variety of algorithms which, broadly speaking, can be categorized as basic search algorithms, geometric algorithms, heuristic algorithms, or hardware-specific search algorithms. In this tutorial we describe algorithms that are representative of each category, and discuss which type of algorithm might be suitable for different applications     

Impact of the location area structure on the performance ofsignaling channels in wireless cellular networks

The authors consider connection-oriented wireless cellular networks such as IS-54, IS-95, GSM, and wireless ATM networks. These are connection-oriented digital networks which employ separate radio channels for the transmission of signaling information. A forward signaling channel is a common signaling channel assigned to carry the multiplexed stream of paging and channel-allocation packets from a base station to mobile stations. For wireless ATM networks, paging and virtual-circuit (VC) allocation packets are multiplexed across the forward signaling channels as part of the VC setup phase. A reverse signaling channel, which employs a contention-oriented medium access algorithm, is used by mobile stations to send channel-request and location-update packets. A location area is a region which includes a specified set of adjacent cells; it is used to track the location of mobile stations. Mobile units must reregister as they cross the boundary of a location area. The channel setup and paging response times are critical performance factors in the design of the signaling subsystem. A location area structure must be suitably selected to ensure that acceptable levels of such performance functions are achieved. A network which employs small location-areas will experience a high rate of location updates, while larger location areas lead to higher traffic intensities of paging messages. The authors overview a method for calculating the performance behavior of signaling messages. Subsequently the impact of the location area structure on the performance of the signaling system is investigated     

中继协作多播网络中基于最小集合覆盖的编码重传方案

为提高单中继协作多播传输效率,本文提出一种基于最小集合覆盖的分类网络编码重传方案.该方案充分利用中继节点协作传输的优势,将接收端的丢包按中继节点的接收状态分为两类,并按类先后进行编码重传.在各类丢包内部,根据对应的状态反馈矩阵寻找编码机会生成编码包,并将编码包的选择过程抽象为集合覆盖问题,通过求最小集合覆盖使重传次数逼近最小值.此外,在不增加所得前类编码包数的前提下,利用两类丢包之间的编码机会进一步生成新编码包,以减少重传编码包数,从而提高重传效率.分析与仿真结果表明了该方案的有效性.     

Measurement and Classification of Out-of-Sequence Packets in a Tier-1 IP Backbone

We present a classification methodology and a measurement study for out-of-sequence packets in TCP connections going over the Sprint IP backbone. Out-of-sequence packets can result from many events including loss, looping, reordering, or duplication in the network. It is important to quantify and understand the causes of such out-of-sequence packets since it is an indicator of the performance of a TCP connection, and the quality of its end-end path. Our study is based on passively observed packets from a point inside a large backbone network-as opposed to actively sending and measuring end-end probe traffic at the sender or receiver. A new methodology is thus required to infer the causes of a connection's out-of-sequence packets using only measurements taken in the "middle" of the connection's end-end path. We describe techniques that classify observed out-of-sequence behavior based only on the previously and subsequently-observed packets within a connection and knowledge of how TCP behaves. We analyze numerous several-hour packet-level traces from a set of OC-12 and OC-48 links for tens of millions connections generated in nearly 7600 unique ASes. We show that using our techniques, it is possible to classify almost all out-of-sequence packets in our traces and that we can quantify the uncertainty in our classification. Our measurements show a relatively consistent rate of out-of-sequence packets of approximately 4%. We observe that a majority of out-of-sequence packets are retransmissions, with a smaller percentage resulting from in-network reordering     

Identifying online traffic based on property of TCP flow

Classification of network traffic using port-based or payload-based analysis is becoming increasingly difficult when many applications use dynamic port numbers, masquerading techniques, and encryption to avoid detection. In this article, an approach is presented for online traffic classification relying on the observation of the first n packets of a transmission control protocol (TCP) connection. Its key idea is to utilize the properties of the observed first ten packets of a TCP connection and Bayesian network method to build a classifier. This classifier can classify TCP flows dynamically as packets pass through it by deciding whether a TCP flow belongs to a given application. The experimental results show that the proposed approach performs well in online Internet traffic classification and that it is superior to naive Bayesian method.