In this paper, the theoretical analysis showed that length of route and interference links were main factors influence throughput network. Then, a dynamic channel allocation algorithm base on routes was proposed to enhance system throughput. algorithm, ant colony used collect information network, such as links. priority link access decided according collected information. The simulation results...

A microscopic model for describing a superconducting mesoscopic weak link is presented. We consider a model geometry consisting of a narrow channel coupled to wider superconducting electrodes which act as reservoirs fixing the asymptotic values of the complex order parameter. For this model, the Bogoliubov-de Gennes equations are discretized and solved self-consistently using a non-equilibrium ...

Adaptive RED (ARED) is an active queue management (AQM) designed for congestion responsive traffics such as TCP. ARED aims to keep average queue length around a predefined queue length. If so, average delay will be offered to Internet users and simultaneously high link utilization will be achieved. However, ARED algorithm merely makes the average queue length loosely converge to the target leng...

We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the path. We prove structural properties of optimal paths and utilize these results to obtain approximation algorithms that yield a path having O(k) links and weighted length at most (1 + ǫ) times the weighted length of an ...

To achieve fast link failure detection in all-optical networks, the notion of monitoring-cycle (m-cycle) is introduced. The best known m-cycle construction algorithm (HST [7]) adopts a spanning tree-based approach. In this paper, we propose a new algorithm M-CYCLE to construct a set of minimum-length mcycles (or m-cycles) for more efficient link failure detection. We prove that the performance ...

At present, an IS-IS purge does not contain any information identifying the Intermediate System (IS) that generates the purge. This makes it difficult to locate the source IS. To address this issue, this document defines a TLV to be added to purges to record the system ID of the IS generating it. Since normal Link State Protocol Data Unit (LSP) flooding does not change LSP contents, this TLV sh...

We examine the well-known problem of determining the capacity of multi-dimensional run-length-limited constrained systems. By recasting the problem, which is essentially a combinatorial counting problem, into a probabilistic setting, we are able to derive new lower and upper bounds on the capacity of (0, k)-RLL systems. These bounds are better than all previously-known bounds for k 2, and are e...

The purpose of this appendix is to review the basics of vector calculus in the two dimensions. Most, if not all, this material should be familiar to the student who has taken a basic course in multivariable calculus, but it is worth collecting together the necessary results. We will assume you are familiar with the basics of partial derivatives, including the equality of mixed partical (assumin...

An extremum hypothesis of turbulent transport in the atmospheric surface layer is postulated. The hypothesis has led to a unique solution of Monin–Obukhov similarity equations in terms of simple expressions linking shear stress (momentum flux) and heat flux to mean wind shear and temperature gradient. The extremum solution is consistent with the well-known asymptotic properties of the surface l...

We have imaged the X-ray binary SS 433 with unprecedented Fourier-plane coverage at 6 cm using simultaneously the VLBA, MERLIN, and the VLA, and also at 20 cm with the VLBA. At both wavelengths we have securely detected smooth, low-surface brightness emission having the appearance of a ‘ruff’ or collar attached perpendicularly to the well-studied knotty jets in this system, extending over at le...