TCP Performance in Optical Packet-switched Networks

Optical packet assembly is a key function to support inter-working between TCP/IP networks and optical packet-switched networks. It is characterized by the assembly delay and by the segment aggregation needed to form an optical packet. These counter-balancing aspects depend on several environment variables, such as the TCP parameters, the access link speed, the optical packet size whose effects are studied in this paper. Performance evaluations are obtained by extensive simulations in terms of send rate of TCP flows, fairness, efficiency, and assembly delay. Some guidelines in the design of optical packets that take into account the results presented are given.     

用于光城域网的新型RPR技术

介绍IEEE802.17正在进行标准化的弹性分组环(RPR,Resilient Packet Ring)协议,分析其帧结构及主要功能特色,并和SDH与以太网等现有城域网技术作简要对比;可以预见,随着标准化工作的进行,综合多种传输技术优势的RPR会成为创建下一代高速光城域网的首选技术。     

基于神经网络的智能过滤系统的研究与设计

首先对现有的网络安全隐患和现有的关于安全过滤方法作了简单介绍,提出现有网络过滤技术的不足,接着提出利用信息检索、人工智能和遗传算法相结合的技术,能有效提高网络过滤的性能.     

朗讯cdma 1x基站分组管宽度的配置

简单介绍朗讯系统cdma 1x基站分组管(PP)宽度的配置，并对朗讯cdma 1x基站分组管宽度不合理的配置及信道板扩容后的PP宽度配置进行了案例分析。     

GPRS业务模型和无线网络的研究

根据GPRS业务及业务发展情况，对GPRS业务模型进行深入研究，并对GPRS无线网络进行了更深入的探讨。     

155Mb／s时分光交换系统

本文介绍了国内第一个１５５Ｍｂ／ｓ时分光交换实验系统。系统以新型半导体光器件－半导体光开关门为核心构成，传输速度为１５５Ｍｂ／ｓ。     

帧中继交换技术

本文论述了帧中继交换的概念、标准，结构、特点网络式样及在互连网中的应用。     

Accelerating filtering techniques for numeric CSPs

Search algorithms for solving Numeric CSPs (Constraint Satisfaction Problems) make an extensive use of filtering techniques. In this paper¹ we show how those filtering techniques can be accelerated by discovering and exploiting some regularities during the filtering process. Two kinds of regularities are discussed, cyclic phenomena in the propagation queue and numeric regularities of the domains of the variables. We also present in this paper an attempt to unify numeric CSPs solving methods from two distinct communities, that of CSP in artificial intelligence, and that of interval analysis.     

A note on models for non-probabilistic analysis of packet switching networks

We consider two models commonly used in the literature to model adversarial injection of packets into a packet switching network. We establish the relation between these two types of models, and between them and the set of sequences of packets that allow stability. We also consider the adaptive setting in which packets are injected with only their source and destination but without a prescribed path to follow.     

Ergodicity of filtering process by vanishing discount approach

A new approach to study ergodicity of filtering processes is presented. It is based on the vanishing discount approach to discounted functional of filtering process. We show that limit superior of the Cesaro averages of the functionals is the same for all initial conditions from which the uniqueness of invariant measures of filtering processes follows. The approach is based on certain assumption for which we provide a sufficient condition using concavity arguments. In addition we show the existence of solutions to the Poisson equation corresponding to filtering process with concave functional. The assumptions are then extended to the controlled case and using similar concave arguments we obtain the existence of solutions to the Bellman equation corresponding to partially observed average cost per unit time problem.