CDPD—连接世界的纽带

为了满足人们随时随地、方便快捷地进行信息交换、延伸通信服务范围的要求,一种以数字分组数据技术为基础,以蜂窝移动通信为组网方式的蜂窝状数字式分组数据交换网络技术（ＣＤＰＤ）应运而生。目前我国上海、深圳等地已经投入营运。 一、CDPD的网络结构 从网络结构上看,ＣＤＰＤ系统由移动数据基站（ＭＤＢＳ）、ＣＤＰＤ交换机、网络管理系统（ＮＭＳ）、移动终端系统（ＭＥＳ）组成。 １．移动数据基站（ＭＤＢＳ） 提供无线接口、频谱管理和自动信道跳频。它由计算机控制模块、调制解调器／收发信机模块以及电源模块组成。 ２．Ｃ…     

多级交换结构中基于分组的交换机制研究与仿真

目前大规模商用的核心路由器中普遍采用基于信元的交换机制,这种机制有网络适应性强等优点,但也有浪费网络资源以及信元乱序等缺点,与之相对的基于分组的交换方式在这些方面则显出了其优越性.本文在利用OPNET措建的三级多平面clos交换结构仿真平台上,分别采用基于分组和基于信元两种交换机制,分析各自的缓存使用情况和分组平均时延,得出结论为在仿真环境下基于分组的交换方式要优于基于信元的交换方式.     

一种新型的PPS交换机

并行分组交换机(PPS)是一种利用多个低速交换结构实现高速交换的新技术,它是当前高速交换领域的一个研究热点。该文首先分析了PPS交换机的研究现状。然后,提出了一种新型的PPS交换机结构,运用流指数控制的方法保证了信元通过PPS交换机时不会乱序。仿真分析表明该交换结构和算法能提供良好的吞吐率和平均延迟。     

DPN—100分组交换机路由选择系统的特点（1）

介绍了中国公用分组交换数据网（ＣＨＩＮＡＰＡＣ网）所采用的ＤＰＮ－１００分组交换机路由选择系统的基本概念及其特点，以及在日常维护中经常用到的一些操作方法。     

ISDN与公用分组交换网的互通（下）

ＩＳＤＮ与公用分组交换网的互通（下）□张国宏赵慧玲杜森２ＩＳＤＮ与ＰＳＰＤＮ互通的实现方法２．１两种实现方法前面介绍了分组方式终端接入ＩＳＤＮ的两种方式，即方式Ａ和方式Ｂ。对于方式Ｂ，ＰＨ的实现有两种方法：一种方法是ＰＨ模块驻留在ＩＳＤＮ交换机内部，...     

分组网与ISDN互连的性能分析

本文研究分组交换数据网与ＩＳＤＮ互连的性能分析，文中考虑了分组肉与窄带ＩＳＤＮ和宽带ＩＳＤＮ互连时信关所应完成的功能，分别给出了两种情况下的信关排队模型；在信关存储容量分别为有限和无限的情况下，对两种模型进行了求解，给出了阻塞概率和平均延迟的表达式。对于与Ｂ－ＩＳＤＮ互连的情况，提出了用开关确定性过程来描述输出排队的分组到达流，并提出了一种小时隙方法分析ＳＤＰ／Ｄ／１排队。     

ISDN与广州PSPDN互联方案

首先介绍了ＩＳＤＮ与ＰＳＰＤＮ互联的几种方式的基本原理，然后结合广州网络的实际情况，着重讲述作为分组交换机响应做的准备，包括硬件配置，软件输入，局数据的填写以及互联时对编号的处理等。     

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

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

无线蜂窝数字分组数据通信及其应用

移动通信的出现和发展加强了人们之间的联系，基于语音的移动通信已不能满足需要。让数据通信移动起来是人们追求的另一个目标，现已成为移动通信发展的新趋势，是各大电信运营商关注的热点，并受到各国科研和开发部门的高度重视。无线蜂窝数字分组数据网络（ＣＤＰＤ）使得这一愿望能够实现。无线蜂窝数字分组数据通信是以数字分组数据技术为基础，以蜂窝移动通信为组网方式，具有广阔发展前景的先进的移动数据通信技术。一、 ＣＤＰＤ网络特点辜忧苛巳嗣侵ＣＤＰＤ是通过在蜂窝电话网增加分组数据处理装置，利用蜂窝系统话音信道空隙进行…     

一种双端口CICQ交换机的分组调度方案

Internet 中的交换机面临着高速交换和提供QoS保证的双重挑战,前者要求交换机的缓存以线速工作,后者要求交换机能完全模仿输出队列交换机。目前交叉点缓存交换机仿真输出队列交换机的方案需要交换机内部加速2倍,对硬件实现要求较高。该文利用双端口技术,提出了一种新型的交叉点缓存交换机结构,理论分析说明,该变长分组交换机在无需内部加速的情况下能够仿真输出队列交换机,并且交叉点缓存的需求是有下界的,从而表明该交换结构适合高速交换。     

Performance analysis of data packet discarding in ATM networks

Data performance in ATM networks should be measured on the packet level instead of the cell level, since one or more cell losses within each packet is equivalent to the loss of the packet itself. Two packet-level control schemes, packet tail discarding and early packet discarding, were proposed to improve data performance. In this paper, a new stochastic modeling technique is developed for performance evaluation of two existing packet-discarding schemes at a single bottleneck node. We assume that the data arrival process is independent of the nodal congestion, which may represent the unspecified bit-rate traffic class in ATM networks, where no end-to-end feedback control mechanism is implemented. Through numerical study, we explore the effects of buffer capacity, control threshold, packet size, source access rate, underlying high-priority real-time traffic, and loading factor on data performance, and discuss their design tradeoffs. Our study shows that a network system can he entirely shut down in an overload period if no packet-discarding control scheme is implemented, under the assumption that there are no higher layer congestion avoidance schemes. Further, unless with sufficiently large buffer capacity, early packet discarding (EPD) always outperforms packet tail discarding (PTD) significantly under most renditions. Especially under the overload condition, EPD can always achieve about 100% goodput and 0% badput, whereas the PTD performance deteriorates rapidly. Among all the factors, the packet size has a dominant impact on EPD performance. The optimal selection of the EPD queue control threshold to achieve the maximum goodput is found to be relatively insensitive to traffic statistics     

Packet loss performance of selective cell discard schemes in ATMswitches

In transport-layer protocols such as TCP over ATM networks, a packet is discarded when one or more cells of that packet are lost, and the destination node then requires its source to retransmit the corrupted packet. Therefore, once one of the cells constituting a packet is lost, its subsequent cells of the corrupted packet waste network resources. Thus, discarding those cells will enable us to efficiently utilize network resources, and will improve the packet loss probability. We focus on tail dropping (TD) and early packet discard (EPD) as selective cell discard schemes which enforce the switches to discard some of the arriving cells instead of relaying them. We exactly analyze the packet loss probability in a system applying these schemes. Their advantages and limits are then discussed based on numerical results derived through the analysis     

Dynamics of TCP traffic over ATM networks

Investigates the performance of transport control protocol (TCP) connections over ATM networks without ATM-level congestion control and compares it to the performance of TCP over packet-based networks. For simulations of congested networks, the effective throughput of TCP over ATM can be quite low when cells are dropped at the congested ATM switch. The low throughput is due to wasted bandwidth as the congested link transmits cells from “corrupted” packets, i.e., packets in which at least one cell is dropped by the switch. The authors investigate two packet-discard strategies that alleviate the effects of fragmentation. Partial packet discard, in which remaining cells are discarded after one cell has been dropped from a packet, somewhat improves throughput. They introduce early packet discard, a strategy in which the switch drops whole packets prior to buffer overflow. This mechanism prevents fragmentation and restores throughput to maximal levels     

Explicit window adaptation: a method to enhance TCP performance

We study the performance of TCP in an internetwork consisting of both rate-controlled and nonrate-controlled segments. A common example of such an environment occurs when the end systems are part of IP datagram networks interconnected by a rate-controlled segment, such as an ATM network using the available bit rate (ABR) service. In the absence of congestive losses in either segment, TCP keeps increasing its window to its maximum size. Mismatch between the TCP window and the bandwidth-delay product of the network results in accumulation of large queues and possibly buffer overflows in the devices at the edges of the rate-controlled segment, causing degraded throughput and unfairness. We develop an explicit feedback scheme, called explicit window adaptation, based on modifying the receiver's advertised window in TCP acknowledgments returning to the source. The window size indicated to TCP is a function of the free buffer in the edge device. Results from simulations with a wide range of traffic scenarios show that this explicit window adaptation scheme can control the buffer occupancy efficiently at the edge device, and results in significant improvements in packet loss rate, fairness, and throughput over a packet discard policy such as random early detection (RED)     

Buffer and bandwidth allocation for TCP data traffic: experimental results

This paper discusses the dimensioning of buffers and the bandwidth allocation for data traffic in the ATM network. Data traffic is notoriously complex and bursty, making such dimensioning a difficult task. However, the COMBINE project, when dimensioning their InterWorking Units (IWUs), adopted a Poissonian packet arrival model, based upon the argument that burstiness at timescales higher than that of a packet arrival are a problem to be tackled by flow control at higher layers. This paper presents experimental results from the COMBINE testbed that show that this hypothesis was justified and that good TCP goodput was obtained based upon this dimensioning approach, due to TCP's ability to adapt to network congestion. However, it is also shown that it was the TCP algorithm that was ultimately responsible for controlling the packet loss ratio in the network and not the bandwidth allocation or buffer size. The results highlight the importance of taking into account the mutual influence between the ATM layer and the transport layer congestion control algorithms.     

A new ATM adaptation layer for TCP/IP over wireless ATM networks

This paper describes the design and performance of a new ATM adaptation layer protocol (AAL‐T) for improving TCP performance over wireless ATM networks. The wireless links are characterized by higher error rates and burstier error patterns in comparison with the fiber links for which ATM was introduced in the beginning. Since the low performance of TCP over wireless ATM networks is mainly due to the fact that TCP always responds to all packet losses by congestion control, the key idea in the design is to push the error control portion of TCP to the AAL layer so that TCP is only responsible for congestion control. The AAL‐T is based on a novel and reliable ARQ mechanism to support quality‐critical TCP traffic over wireless ATM networks. The proposed AAL protocol has been validated using the OPNET tool with the simulated wireless ATM network. The simulation results show that the AAL‐T provides higher throughput for TCP over wireless ATM networks compared to the existing approach of TCP with AAL 5. This revised version was published online in July 2006 with corrections to the Cover Date.     

多个TCP连接的拥塞丢包模型

本文提出了有关TCP连接的拥塞丢包分析模型.网络瓶颈一般承载许多TCP连接,瓶颈处不可避免的拥塞和缓存溢出,是导致网上丢包的主要原因.网络瓶颈处的行为很大程度上左右了网络性能.本文的模型估计了存在大量持续TCP连接时,网络瓶颈的丢包概率和网络传输中断概率,给出了对实际网络的良好近似.这对于研究TCP对网络性能的影响,提出改善网络性能的新算法,以及分析(从长远来看)TCP还应做哪些改进,都是非常有用的.     

一种自适应早期包丢弃方案

该文提出了一种自适应早期包丢弃方案,与以ATM网络支持的TCP应用中通常采用的早期包丢弃方案相比,该方案能减少ATM网络交换结点所需的缓存数量,提高ATM网络中IP流量的完好流量通过率,并降低丢包率。     

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     

Cell-loss concealment techniques for layered video codecs in an ATMnetwork

A layered video coding scheme with its inherent cell loss resilience has been considered as a means for transporting reliably integrated video services over an asynchronous transfer mode (ATM) based network such as the broadband-ISDN. This paper presents some data concealment techniques that can be implemented in the coding of video data at the encoder, in the ATM adaptation layer (AAL) functionality of network realization and at the decoder to improve the performance of a layered codec under different conditions of video packet loss. The performance of these techniques are verified by software simulations.