scientific article; zbMATH DE number 932438

MaRDI QIDQ4894816zbMATH OpenFDO

Authors David M. Rose, Yuri Suhov

Publication date 14 January 1997

zbMATH Keywords

message lengthspacket-switching networkPoisson-independence hypothesisqueueing disciplinesmall perturbation

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Recommendations

• An optimal probabilistic routing policy for a large packet–switched network
• On a class of packet-switching networks on an infinite graph
• Poisson limit theorem for message switching networks with low transit traffic
• Distribution of end-to-end delay in message-switched networks
• Poisson hypothesis for information networks. I

Cited in

(13)

• Modeling bufferless packet-switching networks with packet dependencies
• Proof of the Poisson hypothesis for circuit-switching loss networks
• Poisson limit theorem for message switching networks with low transit traffic
• Studying the SINR Process of the Typical User in Poisson Networks Using Its Factorial Moment Measures
• Interdependent communication network with multiple transmitters
• Absence of Breakdown of the Poisson Hypothesis I. Closed Networks at Low Load
• Distribution of end-to-end delay in message-switched networks
• An optimal probabilistic routing policy for a large packet–switched network
• Packet delay in models of data networks
• Poisson Hypothesis for Open Networks at Low Load
• Large-scale behaviour of packet-switched networks: theoretical analysis framework
• On a class of packet-switching networks on an infinite graph
• Reduction of a polling network to a single node

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4894816)