Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the network topology across processors, as a technique to increase emulation capacity with increasing hardware resources. We develop methods to create partitions based on expected communication across the topology. Our eval...

In [Barr & Kleisli 2001] we described ?-autonomous structures on two full subcategories of topological abelian groups. In this paper we do the same for sup semilattices except that uniform structures play the role that topology did in the earlier paper.

In this paper, we introduce closure operator(c) on Hilbert algebra H and study the properties of c. Then we state the relation between c and uniform topology on H. Mathematics Subject Classification: 03G25, 54E15

We prove that a uniform infinite quadrangulation of the half-plane decorated by self-avoiding walk (SAW) converges in scaling limit to metric gluing two independent Brownian half-planes identified along their positive boundary rays. Combined with other work authors, this implies convergence SAW on random SLE$_{8/3}$ certain $\sqrt{8/3}$-Liouville quantum gravity surface. The topology is local G...

We calculate the maximum number of subscribers in a CDMA cellular network for a given GoS requirement, QoS requirement, network topology, and user distribution profile. We formulate a constrained optimization problem that maximizes the call arrival rates subject to upper bounds on the blocking probabilities and lower bounds on the bit energy to interference ratios. We present examples for tradi...

In this paper, by means of operations (is called in [1, 2, 3] φ,ψ) we shall define φψ-continuity between two L-fuzzy quasi-uniform spaces. We shall prove that φψ-continuity between two L-fuzzy quasi-uniformity induces φψ-continuity between L-fuzzy topology generated by them. We shall investigate some Theorems on L-fuzzy uniform spaces. 2000 Mathematics Subject Classification:54A40, 03E72

The design of logical topologies in wavelength-routing multihop optical networks is a well-studied problem. In this paper, we consider logical topology (LT) design over the popular ring and linear topologies. Our objective is the minimization of the electronic processing delay for the worst case traffic flow. For uniform traffic between nodes, this delay minimization corresponds to minimizing t...

We present results related to the vertex degree in a uniform s-intersection graph which has received much interest recently. Specifically , we derive the probability distribution for the minimum vertex degree, and show that the number of vertices with an arbitrary degree converges to a Poisson distribution. A uniform s-intersection graph models the topology of a secure wireless sensor network e...

This paper addresses the question of extending the usual approximation and sampling theory of continuous signals and systems to those encompassing discontinuities, such as found in modern complex control systems (mode switches for instance). We provide some evidence that the Skorokhod topology is a good candidate for dealing with those cases in a uniform manner by showing that, in the boolean c...

Abstract. We present results related to the vertex degree in a uniform s-intersection graph which has received much interest recently. Specifically, we derive the probability distribution for the minimum vertex degree, and show that the number of vertices with an arbitrary degree converges to a Poisson distribution. A uniform s-intersection graph models the topology of a secure wireless sensor ...