用Java实现网上结构图实验仿真

基于线性系统仿真的连接矩阵方法，用Java语言开发面向结构图的实验仿真程序，以Applet小应用程序的形式插入网页中运行，实现了信号与系统网上实验教学中的结构图实验仿真。经试用，程序在浏览器中运行正常，可以完成一般线性系统仿真，与以MATLAB，LABView等程序开发的实验仿真程序相比，该程序运行环境简单，几乎所有常用的Web浏览器都支持Java运行，不需另行安装相应组件。对于线性系统结构图，实现了所见即所得的图形化编程环境，具有较好的人机交互性。     

一种新的WDM光网中的共享链路保护策略

研究了WDM光网中的链路保护问题.提出了一种新的共享链路保护策略--基于SRLG的共享链路保护策略(SRLG-SLP).SRLG(共享风险链路组)定义了对一条工作光通道分配保护资源时的资源可用性的约束.它规定任意两条有着同样故障风险或者说处于同一个SRLG的工作光通道不能利用同样的保护资源.另外,还提出了一种更加符合实际的单链路故障模型,其中链路故障间隔时间和链路故障保持时间被考虑作为两个独立的变量.基于该链路故障模型,通过大量的仿真试验,比较了专用链路保护(DLP)、共享链路保护(SLP)和提出的SRLG-SLP保护策略的资源利用率、保护效率以及业务中断率.结果显示,我们提出的SRLG-SLP在保护效率和业务中断率方面的保护性能远好于DLP和SLP,但会牺牲一些资源利用率.     

Solving the trade-off between fairness and throughput: Token bucket and leaky bucket-based weighted fair queueing schedulers

In this article, we present two efficient weighted fair queueing (WFQ) scheduling algorithms leaned on the well-known token bucket and leaky bucket shaping/policing algorithms. The performance of the presented algorithms is compared to those of the state-of-the-art WFQ approximations such as weighted round robin (WRR) and the recently proposed bin sort fair queueing (BSFQ). Our simulation results show that the proposed algorithms provide a better fairness at a lower implementation complexity while simultaneously achieving a comparable network utilization.     

基于Parlay X的下一代电信增值业务模型研究

Parlay X是一套简单易懂、比之Parlay在更高层次抽象电信网络基本功能的应用编程接口(API),它以Web Service的形式供IT应用开发者在开发的应用中调用电信网络功能.下一代网络业务的发展是一个渐进过程,对运营商来说,如何以更小的成本快速开发和部署新业务成了当务之急.文中介绍了Parlay X体系结构模型,着重提出了基于Parlay X的电信增值业务过渡模型,并对短信业务的开发流程进行了分析.     

The Region 1 & 3 Broadcasting‐Satellite Service Plan after WRC‐03

The 1977 Broadcasting‐Satellite Service (BSS) Plan for Region 1 & 3 had been widely acknowledged to be out‐of‐date by the late 1980s. Development of digital modulation in the early 1990s provided an opportunity to update the technical provisions of the Plan to make it more economically viable. After a decade of work and three World Radiocommunication Conferences (WRCs), the revision of Region 1 & 3 BSS Plan was finally completed in 2003. The new Plan increased channel assignments from 5 to 10 analog‐equivalent channels for each country in Region 1, and from 4 to 12 channels for each country in Region 3. Yet, despite the increase in capacity, the new Plan is surprisingly similar to the original one in terms of the technical parameters. It is still based on national coverage, and the channel plan, orbital location, orbital spacing, and polarization are also the same. As a result, the new Plan is no more economically viable to implement than the old. To create economically viable BSS systems would most likely require modifications to the assignment in the Plan. Yet, modification procedures were made more difficult to apply after replanning. Less future implementation of BSS networks than would otherwise have occurred can be expected, and an inefficient usage of these frequency bands will likely result. On the other hand, less implemented systems will mean more capacity set aside for future use. This is important for countries that currently do not have satellite operations. In the end, BSS replanning reflects the eternal conflict between efficient usage and guaranteed future access. Copyright © 2005 John Wiley & Sons, Ltd.     

Curvature of curvilinear 4-webs and pencils of one forms: Variation on a theorem of Poincaré, Mayrhofer and Reidemeister

A curvilinear d-web W = (F ₁ , . . . , F _d ) is a configuration of d curvilinear foliations F _i on a surface. When d = 3, Bott connections of the normal bundles of F _i extend naturally to equal affine connection, which is called Chern connection. For 3 < d, this is the case if and only if the modulus of tangents to the leaves of F _i at a point is constant. A d-web is associative if the modulus is constant and weakly associative if Chern connections of all 3-subwebs have equal curvature form. We give a geometric interpretation of the curvature form in terms of fake billiard in §2, and prove that a weakly associative d-web is associative if Chern connections of triples of the members are non flat, and then the foliations are defined by members of a pencil (projective linear family of dim 1) of 1-forms. This result completes the classification of weakly associative 4-webs initiated by Poincaré, Mayrhofer and Reidemeister for the flat case. In §4, we generalize the result for n + 2-webs of n-spaces. Received: September 23, 1996     

SMS——智能网的业务管理系统

本文叙述了智能网的业务管理系统所实现的３种功能：业务管理功能，网络管理功能和业务管理访问功能，还介绍了业务管理和网络管理之间的关系，ＳＭＳ的集中式和分布式两种体系结构及业务管理功能的设计方法和进一步研究方向。     

网格技术综述

网格技术被认为是互联网技术发展的下一次浪潮，目前对网格的研究已经成为信息领域的热点。本文首先介绍了网格的产生背景，接着阐述了网格的概念和目的，然后分析了网格的系统构成，最后展望了网格技术的应用前景。     

Web服务提供方安全模型的分析与设计

讨论了Web服务提供方的安全问题,通过对Web服务调用方式的分析,为Web服务的提供方设计了安全模型.所设计的模型不依赖于服务提供方选用的安全策略,方便策略的更改和安全检查机制的更新.该模型同样适用于Web服务的需求方.