Survey of unified approaches to integrated-service networks

The increasing demand for communication services, coupled with recent technological advances in communication media and switching techniques, has resulted in a proliferation of new and expanded services. Currently, networks are needed which can transmit voice, data, and video services in an application-independent fashion. Unified approaches employ a single switching technique across the entire network bandwidth, thus, allowing services to be switched in an application-independent manner. This paper presents a taxonomy of integrated-service networks including a look at N-ISDN, while focusing on unified approaches to integrated-service networks.The two most promising unified approaches are burst and fast packet switching. Burst switching is a circuit switching-based approach which allocates channel bandwidth to a connection only during the transmission of "bursts" of information. Fast packet switching is a packet switching-based approach which can be characterized by very high transmission rates on network links and simple, hardwired protocols which match the rapid channel speed of the network. Both approaches are being proposed as possible implementations for integrated-service networks. We survey these two approaches, and also examine the key performance issues found in fast packet switching. We then present the results of a simulation study of a fast packet switching network

Packetized-voice/data integrated transmission on a token passing ring local area network

This paper investigates the performance of a token passing ring network with packetized-voice/data mixed traffic through extensive simulations. Both data and voice users are modeled in the simulations. Data users produce bursty traffic. Voice traffic is modeled as having alternating talkspurts and silences, with generation of voice packets at a constant rate during talkspurts and no packet generation during silence periods.The network performance measures obtained include: the distribution of transmission delays for voice packets, the average transmission delay and loss probabilities for voice packets, the number of voice users allowed on a network while satisfying the real-time constraints of speech, and the average transmission delay for data packets.Token passing ring local area networks are shown to effectively handle both voice and data traffic. The effects of system parameters (e.g., voice packet length, talkspurt/silence lengths, data traffic intensity, and limited versus exhaustive service disciplines) on network performance are discussed

Current moments of 1D ASEP by duality

We consider the exponential moments of integrated currents of 1D asymmetric simple exclusion process using the duality found by Sch\"utz. For the ASEP on the infinite lattice we show that the $n$th moment is reduced to the problem of the ASEP with less than or equal to $n$ particles.Comment: 13 pages, no figur

Eynard-Mehta theorem, Schur process, and their pfaffian analogs

We give simple linear algebraic proofs of Eynard-Mehta theorem, Okounkov-Reshetikhin formula for the correlation kernel of the Schur process, and Pfaffian analogs of these results. We also discuss certain general properties of the spaces of all determinantal and Pfaffian processes on a given finite set.Comment: AMSTeX, 21 pages, a new section adde