Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 7 of 7 for “"sojourn time"”.

  1. Traffic processes and sojourn times in finite Markovian queues

    … results on various traffic processes and on the sojourn time distribution for a class of models which operate as Markov processes on finite state spaces. The arrival and the service time processes are assumed to be independent renewal processes with interval distributions of phase-type. The queue …

    vt Repository record for Traffic processes and sojourn times in finite Markovian queues (opens in a new tab)

  2. Some aspects of time-dependent one-dimensional random walks

    … proceeds by steps of ±1 occurring at random time intervals. In general it is assumed that these intervals are identically and independently distributed. This model may be specialized to the queuing process by inserting a reflecting barrier at the origin so that the displacement S(t) of the …

    vt Repository record for Some aspects of time-dependent one-dimensional random walks (opens in a new tab)

  3. Performance analysis and resource allocation in CDMA wireless networks for multimedia services

    … and data rates in order to support different multimedia services. Wireless systems will be required to support sources with a variety of traffic characteristics and quality of service requirements. This requires algorithms for admission control and resource allocation at the session, burst and …

    njit Repository record for Performance analysis and resource allocation in CDMA wireless networks for multimedia services (opens in a new tab)

  4. The effect of the dependency in the Markov renewal arrival process on the various performance measures of an exponential server queue

    … behind this choice is that the interarrival times of the MRAP are dependent. We assume that the queue is a single server queue with exponential service time and the investigation was carried out numerically because no analytical solution was available. There are 5 parameters of the arrival …

    vt Repository record for The effect of the dependency in the Markov renewal arrival process on the various performance measures of an exponential server queue (opens in a new tab)

  5. Optimal Beamforming Strategies At Mmwaves For 5G+ Networks

    … a cell in a round-robin manner with equal sector sojourn time. The idea is to partition the cell into identical sectors and serve multiple users simultaneously that fall within each sector at a given epoch using a single steerable beam generated from a uniform linear antenna array coupled to an RF …

    poli-torino Repository record for Optimal Beamforming Strategies At Mmwaves For 5G+ Networks (opens in a new tab)

  6. Algorithms and Optimization for Wireless Networks

    … in-situ, unattended, high-precision, and real-time observation over a vast area. Wireless ad hoc networks are characterized by the absence of infrastructure support. Nodes in an ad hoc network are able to organize themselves into a multi-hop network. An ad hoc network can operate in a …

    vt Repository record for Algorithms and Optimization for Wireless Networks (opens in a new tab)

  7. Stability and performance in peer to peer networks

    Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2013-09-19T20:37:05Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 ZHU_JI.pdf: 1619348 bytes, checksum: 8d1d0b49cec4831a349cb51f8c89f627 (MD5)

    uiuc Repository record for Stability and performance in peer to peer networks (opens in a new tab)