A method comprising providing a plurality of links to a plurality of end-user devices communicatively coupled to a network system, a particular link of the plurality of links supporting control-plane communications between the network system and a particular end-user device of the plurality of end-user devices over one or more wireless access networks; receiving a message from a server communicatively coupled to the network system, the message comprising payload for delivery to the particular end-user device; generating an encrypted message comprising the payload and an identifier identifying a particular device agent of a plurality of device agents on the particular end-user device, the identifier configured to assist in delivering at least a portion of the payload to the particular device agent on the particular end-user device; and sending the encrypted message to the particular end-user device over the particular link.

Automated Device Provisioning and Activation

https://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/85808/1/KJ00004746786.pdf

Time-Dependent Statistics of the Ising Model

Disclosed herein are methods, systems, and apparatuses to enable subscribers of mobile wireless communication devices to view, research, select and customize service plans; to create and manage device groups, share and set permission controls for service plans among devices in device groups; to manage communication services through graphical user interfaces; to sponsor and promote service plans; and to design, manage, and control communication services through application programming interfaces.

Service Plan Design, User Interfaces, Application Programming Interfaces, and Device Management

In this paper we study the statistics of the realized throughput of elastic document transfers, accounting for the way network bandwidth is shared dynamically between the randomly varying number of concurrent flows. We first discuss the way TCP realizes statistical bandwidth sharing, illustrating essential properties by means of packet level simulations. Mathematical flow level models based on the theory of stochastic networks are then proposed to explain the observed behavior. A notable result is that first order performance (e.g., mean throughput) is insensitive with respect both to the flow size distribution and the flow arrival process, as long as "sessions" arrive according to a Poisson process. Perceived performance is shown to depend most significantly on whether demand at flow level is less than or greater than available capacity. The models provide a key to understanding the effectiveness of techniques for congestion management and service differentiation.

/pdf/statistical-bandwidth-sharing-a-study-of-congestion-at-flow-385wz3auim.pdf

Statistical bandwidth sharing: a study of congestion at flow level

Device Assisted Services (DAS) for protecting network capacity is provided. In some embodiments, DAS for protecting network capacity includes monitoring a network service usage activity of the communications device in network communication; classifying the network service usage activity for differential network access control for protecting network capacity; and associating the network service usage activity with a network service usage control policy based on a classification of the network service usage activity to facilitate differential network access control for protecting network capacity.

Device-Assisted Services for Protecting Network Capacity

A compound model for TCP connection arrivals for LAN and WAN applications

We propose a two level model for TCP connection arrivals in local area networks. The first level are user sessions whose arrival is time-varying Poisson. The second level are connections within a user session. Their number and mean interarrival are independent and biPareto across user session. The interarrivals within a user session are Weibull, and across all users are correlated Weibull. Our model has a small number of parameters which are inferred from real traffic collected a a firewall. We show that traffic synthesized with our model closely characterizes the original data.

A Compound Model for TCP Connection Arrivals

A system for, and method of, simulating traffic loads in a packetized communication network. In one embodiment, the system includes: (1) an initial arrival generator that generates an initial arrival for a simulated user session at an independent time from a previous user session arrival and (2) a subsequent arrival generator, associated with the initial arrival generator, that generates a number of connections to be associated with the simulated user session as an independent variable and, if the number of connections is greater than one, generates a mean connection interarrival time for the simulated user session and a plurality of timings of subsequent arrivals.

System and method for simulating traffic loads in packetized communication networks

An electro-mechanical actuator includes a comb drive and a deformable connector. The comb drive has a first capacitor plate and a second capacitor plate. The capacitor plates have teeth capable of inter-digitating. The deformable connector is configured to apply a mechanical restoring force to the first capacitor plate. The deformable connector is configured to restore the first capacitor plate to be at an equilibrium rest position in response to no control voltage being applied across the capacitor. The comb drive is more engaged at the equilibrium rest position than at a mechanical stability threshold of the comb drive. The capacitor plates are disengaged at the equilibrium rest position.

Stable electro-mechanical actuators

A new parallel algorithm for simulating Ising spin systems is presented. The sequential prototype is the n-fold way algorithm [2], which is efficient but is hard to parallelize using conservative methods. Our parallel algorithm is optimistic. Unlike other optimistic algorithms, e.g., Time Warp, our algorithm is synchronous. It also belongs to the class of simulations known as “relaxation” [3]; hence it is named “synchronous relaxation.” We derive performance guarantees for this algorithm. If N is the number of PEs, then under weak assumptions we show that the number of correct events processed per unit of time is, on average, at least of order N/ log N. All communication delays, processing time, and busy waits are taken into account.

Alan Weiss

Papers

A compound model for TCP connection arrivals for LAN and WAN applications

A Compound Model for TCP Connection Arrivals

System and method for simulating traffic loads in packetized communication networks

Stable electro-mechanical actuators

Synchronous relaxation for parallel Ising spin simulations