FLC-Based MBWIMA/UMTS Protocol for Multimedia Services in UTRA TDD Mode

An intelligent medium access control (MAC) protocol based on fuzzy logic control (FLC) is proposed and compared with a general packet radio system in UMTS (GPRS/UMTS), priority scheme and the movable boundary wireless integrated multiple access in UMTS (MBWIMA/UMTS) protocols. The integrated video/voice/data services of UMTS in UTRA TDD mode have different transmission properties. By fuzzy logic control, the resources of the wireless communication can be intelligent assigned for different types of mediums. The voice-video dropping probability and data packet delay are input to FLC to optimally select the maximum number of voice/video slots. Voice activity detector (VAD) and multiple access interference in single cell are also considered in the simulations.     

A two‐level queueing network model with blocking and non‐blocking messages

We analyze a novel twolevel queueing network with blocking, consisting of N level1 parallel queues linked to M level2 parallel queues. The processing of a customer by a level1 server requires additional services that are exclusively offered by level2 servers. These level2 servers are accessed through blocking and nonblocking messages issued by level1 servers. If a blocking message is issued, the level1 server gets blocked until the message is fully processed at the level2 server. The queueing network is analyzed approximately using a decomposition method, which can be viewed as a generalization of the wellknown twonode decomposition algorithm used to analyze tandem queueing networks with blocking. Numerical tests show that the algorithm has a good accuracy.     

Fission lifetimes of Th nuclei measured by crystal blocking

Crystal blocking lifetime measurements have been made for highly excited Th nuclei with neutron number well removed from the stability line. Thin W crystals were bombarded with ³²S ions in the energy range 170-180 MeV and the yield of fission fragments was measured for emission close to a 〈111〉 axis. The fission blocking dips are compared to the appropriately scaled ones for elastic scattering of the ³²S beam ions and no significant difference is seen between the dips. This implies that the fraction of nuclei fissioning with lifetimes longer than 10 as is less than 2%. Fission lifetimes are increased by viscosity in the nuclear mass flow and comparison with a statistical model calculation indicates that the viscosity parameter, η, must be lower than for Th and U nuclei near β-stability. The effect of the N = 126 magic number is discussed. Received: 2 October 2002 / Accepted: 16 January 2003 / Published online: 29 April 2003     

WDM网络中基于阻塞公平性的业务疏导和波长分配

在具有多速率级别连接请求的WDM网络中，通过为较高速率的请求预留更多的波长集合，结合网络节点对较低速率业务更强的输导能力，解决网络的阻塞公平性和全网的流量问题。在中国教育科研网的仿真实验，本文的策略比First-fit算法取得了更好的阻塞公平性能，并接纳了更多的网络流量。当负载为170Erlang时，多接纳的流量约为12％。     

Almost continuous images of Peano continua

We give a necessary and sufficient condition that a 2nd countable space be the almost continuous image of a Peano continuum.     

Multiple Blocking Sets in PG(n, q), n > 3

This article discusses minimal s-fold blocking sets B in PG (n, q), q = p^h, p prime, q > 661, n > 3, of size |B| > sq + c ^p q ^2/3 - (s - 1) (s - 2)/2 (s > min (c ^p q ^1/6, q ^1/4/2)). It is shown that these s-fold blocking sets contain the disjoint union of a collection of s lines and/or Baer subplanes. To obtain these results, we extend results of Blokhuis–Storme–Szönyi on s-fold blocking sets in PG(2, q) to s-fold blocking sets having points to which a multiplicity is given. Then the results in PG(n, q), n 3, are obtained using projection arguments. The results of this article also improve results of Hamada and Helleseth on codes meeting the Griesmer bound.     

Performance Analysis of an Adaptive Link Status Update Scheme Based on Link‐Usage Statistics for QoS Routing

In the global Internet, a constraint‐based routing algorithm performs the function of selecting a routing path while satisfying some given constraints rather than selecting the shortest path based on physical topology. It is necessary for constraint‐based routing to disseminate and update link state information. The triggering policy of link state updates significantly affects the volume of update traffic and the quality of services (QoS). In this letter, we propose an adaptive triggering policy based on link‐usage statistics in order to reduce the volume of link state update traffic without deterioration of QoS. Also, we evaluate the performance of the proposed policy via simulations.     

Web Server Performance Modeling

The advent of Web technology has made Web servers core elements of future communication networks. Although the amount of traffic that Web servers must handle has grown explosively during the last decade, the performance limitations and the proper tuning of Web servers are still not well understood. In this paper we present an end-to-end queueing model for the performance of Web servers, encompassing the impacts of client workload characteristics, server harware/software configuration, communication protocols, and interconnect topologies. The model has been implemented in a simulation tool, and performance predictions based on the model are shown to match very well with the performance of a Web server in a test lab environment. The simulation tool forms an excellent basis for development of a Decision Support System for the configuration tuning and sizing of Web servers.     

Link Capacity Sharing between Guaranteed- and Best Effort Services on an ATM Transmission Link under GoS Constraints

While link allocation policies in multi-rate circuit switched loss models have drawn much attention in recent years, it is still an open question how to share the link capacity between service classes in a fair manner. In particular, when an ATM link is offered calls from service classes with/without strict QoS guarantees one is interested in link capacity sharing policies that maximize throughput and keep the per-class blocking probabilities under some GoS constraints. In this paper we propose a model and associated computational technique for an ATM transmission link to which CBR/VBR and ABR classes offer calls. We also propose a simple link allocation rule which takes into account blocking probability constraints for the CBR/VBR calls and a throughput constraint for the ABR calls and attempts to minimize the blocking probability of ABR calls. Numerical examples demonstrate the effectiveness of the policy and of the applied computational technique.     

波长变换器均匀放置的Mesh-Torus的性能分析

本文主要研究了在WDM的Mesh Torus中 ,部分网络节点使用波长转换器能给网络带来的好处 .文中比较了在非泊松业务下 ,波长转换器按二项式分布和均匀分布放置时在阻塞率、转换增益和公平性方面能带来的好处 ,证明了波长转换器均匀放置在链路负荷均匀的情况下的Mesh Torus中是一种优化配置