Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Julian Keilson

dblp:57/5088 · DBLP profile ↗
← Back
8ranked-venue papers
6as first author
0since 2021 · last 1995
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 2 first-authorTheory of computation · 3 · 3 first-authorSystems, architecture and hardware · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
3 papers
Performance modeling and evaluation · 89% Embedded and real-time systems · 11%
Computer networks
2 papers
Cellular and mobile networks · 44% Wireless networking · 44% Internet architecture and protocols · 12%

Topics — the 14 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless networking
channel assignment
0.011995
Cutoff priority scheduling in mobile cellular communication systems · IEEE Trans. Commun. 1995
Cellular and mobile networks
radio resource management
0.011995
Cutoff priority scheduling in mobile cellular communication systems · IEEE Trans. Commun. 1995
Performance modeling and evaluation › queueing models
finite buffer queue
0.011994
ATM cell multiplexer analysis by a compensation method · IEEE Trans. Commun. 1994
Performance modeling and evaluation
queueing analysis
0.011994
ATM cell multiplexer analysis by a compensation method · IEEE Trans. Commun. 1994
Performance modeling and evaluation
queueing models
0.021995
A distributed Poisson approximation for preempt-resume clocked schedules · IEEE Trans. Commun. 1990
Cutoff priority scheduling in mobile cellular communication systems · IEEE Trans. Commun. 1995
Embedded and real-time systems › real-time scheduling
priority scheduling
0.011995
Cutoff priority scheduling in mobile cellular communication systems · IEEE Trans. Commun. 1995
Internet architecture and protocols
ATM networks
0.011994
ATM cell multiplexer analysis by a compensation method · IEEE Trans. Commun. 1994
Information theory › information measures
entropy
0.011971
A Note on the Summability of the Entropy Series · Inf. Control. 1971
Coding theory › sequences › pseudorandom sequences
cross correlation
0.011959
A theorem on cross correlation between noisy channels · IRE Trans. Inf. Theory 1959
Information theory › communication channels › channel models
noisy channel
0.011959
A theorem on cross correlation between noisy channels · IRE Trans. Inf. Theory 1959
Information theory › probability theory › stochastic processes › point processes
shot noise
0.011959
The second-order distribution of integrated shot noise · IRE Trans. Inf. Theory 1959
Information theory › probability theory
stochastic processes
0.011959
The second-order distribution of integrated shot noise · IRE Trans. Inf. Theory 1959
Information theory › communication channels › channel models
gaussian noise
0.011959
A theorem on cross correlation between noisy channels · IRE Trans. Inf. Theory 1959
Information theory › probability theory › stochastic processes
second-order distribution
0.011959
The second-order distribution of integrated shot noise · IRE Trans. Inf. Theory 1959

Methods — techniques the papers use, named apart from their topics

simulation · 0.0queueing theory · 0.0markov chain analysis · 0.0compensation method · 0.0generating functions · 0.0generating function · 0.0poisson approximation · 0.0integro-differential equation · 0.0homogeneous function analysis · 0.0fokker-planck equation · 0.0edgeworth series · 0.0
YearPublicationVenuePosition
1995 Multi-Server Threshold Queues with Hysteresis
abstract
A queueing system with K servers operates in the following manner. When the system is empty, arriving customers are attended by only one server. A set of forward threshold values is defined so that at epochs at which the number of customers in the system exceeds a forward threshold value an extra server is added. Similarly, a set of reverse threshold values is defined so that at epochs at which the number of customers in the system becomes less than a reverse threshold value one server is removed. The forward and reverse threshold values are assumed to be different. Closed-form occupancy distribution and mean delay of customers in the system are obtained by the Green's function method.
Oliver C. Ibe, Julian Keilson
Perform. Evaluation2
1995 Cutoff priority scheduling in mobile cellular communication systems
abstract
A mobile cellular communication system is considered. The calls arriving at the base station of each cell are modeled by a queueing system with two arrival streams. Stream 1 (also called class 1) arrivals are those calls in progress that are handed over to the cell from other cells, and class a arrivals are those calls that are originating in the cell. The guard channel scheme is considered in which arriving calls are indiscriminately assigned channels within a cell as long as the number of busy channels in the cell is below a predefined threshold. When this number reaches the threshold, only arriving class 1 calls are assigned channels immediately; arriving class 2 calls are queued. When all the channels are busy, then arriving class 1 calls are lost while class 2 calls continue to be queued. The system is analysed by a generating function method which utilizes the structure of the model to give a very concise solution.>
Julian Keilson, Oliver C. Ibe
IEEE Trans. Commun.1
1994 ATM cell multiplexer analysis by a compensation method
abstract
The performance analysis of a synchronous finite buffer ATM cell multiplexer with heterogeneous or homogeneous bursty sources and multiple servers is considered. A novel solution technique, based on the method of compensation, is formulated that reduces the problem of obtaining the ergodic state distribution and the associated performance measures to (1) the determination of the ergodic Green's density matrix for an associated homogeneous process defined on an infinite strip and (2) the solution of a system of linear equations whose order depends only on the number of sources. An important feature of the approach is that it facilitates a parametric analysis with respect to the buffer size. Several numerical examples are provided to illustrate the theory. Simulation results are also used to validate the theoretical analysis.>
Adrian E. Conway, Julian Keilson
IEEE Trans. Commun.2
1990 A distributed Poisson approximation for preempt-resume clocked schedules
abstract
Many telecommunication systems with time-critical requirements use a preempt-resume clocked schedule. An approximation to the ergodic distribution of the time to completion of a low-priority task is obtained by treating the priority service time distribution as the limit of compound Poisson distributions. Explicit formulas for the mean and variance that are highly accurate are given. For random clocked loads, a stochastic bound is provided for the discrepancy between the exact and approximate distributions. For deterministic clocked loads, sample path bounds are found. Simulation results are given to demonstrate the accuracy of the model.>
Julian Keilson, Leslie D. Servi
IEEE Trans. Commun.1
1989 The Preempt-Resume M/G/1 Queue with Feedback and Clocked Schedules
Julian Keilson, Leslie D. Servi
Perform. Evaluation1
1971 A Note on the Summability of the Entropy Series
Julian Keilson
Inf. Control.1
1959 The second-order distribution of integrated shot noise
abstract
Shot noise, represented by a series of impulses with Poisson distribution in time, and with arbitrary time-independent amplitude distribution, is sent through an RC integrator. Time-dependent statistics of the output are investigated by means of an integro-differential equation describing the statistical flow. The exact second-order probability density of the output is obtained. The time-dependent Edgeworth series for zero initial output is exhibited, and is seen to bear a simple relation to the familiar equilibrium Edgeworth series. Results are shown to reduce to those of the Fokker-Planck equation describing integrated "white" noise as the frequency with which impulses arrive becomes infinite,
Julian Keilson, N. David Mermin
IRE Trans. Inf. Theory1
1959 A theorem on cross correlation between noisy channels
abstract
Two channels carry noise waveforms,N_0 (t) + N_1 ( t)andN_0 (t) + N_2 (t), whereN_0 (t)is a common narrow-band Gaussian noise andN_1 (t)andN_2 (t)are independent narrow-band Gaussian noises associated with each channel. The outputs of each channel are sent through detectors whose outputs,F(x, y), are identical homogeneous functions of the components,xandy, of their inputsN, whereN(t) = x(t) \cos \omega_0 t + y(t) \sin \omega_0 t. LetR_{12}(\tau)be the normalized cross-correlation function of the two detector outputs. It is shown that to determineR_{12}(\tau)it suffices to know the normalized auto-correlation functionR_0(\tau)of the output of a single such detector when the input isN_0(t); i.e., ifR_0(\tau) = G(\sigma_0^2, p(\tau))wherep(\tau)and\sigma_0are the normalized auto-correlation function and rms of either component ofN_0, then it is shown thatR_{12}(\tau) = G(\sigma_0^2, Z_{\rho}(\tau))whereZ = [\{1 + (\sigma_1^2/\sigma_0^2)\} \{(1 + (\sigma_2^2/\sigma_0^2)\}]^{-\frac{1}{2}}.
Julian Keilson, N. David Mermin, Phillip A. Bello
IRE Trans. Inf. Theory1