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

David McMillan

dblp:51/1929 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1995
—ORCID · none

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

Computer networks · 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 networks
2 papers
Cellular and mobile networks · 41% Network performance modeling · 35% Routing and switching · 9%

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

TopicWeightPapersLastEvidence papers
Cellular and mobile networks › mobility management
handover
0.011995
Delay analysis of a cellular mobile priority queueing system · IEEE/ACM Trans. Netw. 1995
Cellular and mobile networks
mobility management
0.011995
Delay analysis of a cellular mobile priority queueing system · IEEE/ACM Trans. Netw. 1995
Network performance modeling › queueing analysis
priority queueing
0.011995
Delay analysis of a cellular mobile priority queueing system · IEEE/ACM Trans. Netw. 1995
Network performance modeling
queueing analysis
0.011995
Delay analysis of a cellular mobile priority queueing system · IEEE/ACM Trans. Netw. 1995
Routing and switching › routing
call routing
0.011988
A linear program model for the automation of network management · IEEE J. Sel. Areas Commun. 1988
Network optimization and economics
resource allocation
0.011988
A linear program model for the automation of network management · IEEE J. Sel. Areas Commun. 1988
Internet architecture and protocols › traffic management
traffic control
0.011988
A linear program model for the automation of network management · IEEE J. Sel. Areas Commun. 1988
Cellular and mobile networks › radio resource management
channel reservation
0.011995
Delay analysis of a cellular mobile priority queueing system · IEEE/ACM Trans. Netw. 1995
Routing and switching
circuit switching
0.011988
A linear program model for the automation of network management · IEEE J. Sel. Areas Commun. 1988
Network management and operations › network control
overload control
0.011988
A linear program model for the automation of network management · IEEE J. Sel. Areas Commun. 1988

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

phase-type distribution · 0.0matrix-geometric analysis · 0.0m/g/1 queue analysis · 0.0linear programming · 0.0
YearPublicationVenuePosition
1995 Delay analysis of a cellular mobile priority queueing system
abstract
A nonpreemptive priority queueing system incorporating a channel reservation policy and a hysteresis mechanism is considered for use in cellular mobile networks. The aim is to provide for priority for handover attempts over new call. Attempts in such a way as to avoid the forced termination of calls in progress without unduly affecting the performance seen by new call attempts. The system model is found to have a matrix-geometric solution with a phase-type distribution for the handover delay and a matrix-exponential distribution for the delay seen by new call attempts. It is also shown that the system can be represented by an M/G/1 queue with multiple vacations. A new result is derived for the M/G/1 queue with multiple vacations and impatient customers and this allows for the analysis to be extended so that new call arrivals are subject to a fixed timeout in queue. Results are provided which show how nonpreemptive priority in conjunction with channel reservation and hysteresis an provide for fast and efficient handover performance for cellular mobile networks.>
David McMillan
IEEE/ACM Trans. Netw.1
1988 A linear program model for the automation of network management
abstract
A linear program model is developed to represent the problem of real-time control of traffic in an overloaded circuit-switched network. Circuit groups and exchanges are modeled approximately as saturating devices. Circuit groups saturate with respect to carried traffic, and exchanges saturate with respect to the rate of attempts served. A linear objective function is chosen. Methods for the size of the linear program model are introduced, and techniques for computing its solution are described. The solution of the linear program is in the form of quotas for all the streams of call attempts entering the network. Detailed call-by-call routing decisions are devolved to individual nodes or regional network management centers.>
Robert Warfield, David McMillan
IEEE J. Sel. Areas Commun.2