Showing papers by "Peter Key published in 1994"
Patent•
31 May 1994TL;DR: In this article, a call acceptance algorithm is used to determine whether a call should be accepted or rejected based on the posterior distribution of the transmission path load, considering the effective bandwidth.
Abstract: A communication network (1) comprises a number of network nodes (2, 3, 4 and 5) linked together by transmission paths (6, 7 and 8). A network manager (9) controls acceptance of calls onto transmission paths by classifying an incoming call and selecting from the database (14) an appropriate mean to peak bit rate distribution. This selected distribution is then used with the monitored transmission path load to determine a posterior distribution which reflects the load. The decision to accept or reject the call is made on the basis of the posterior distribution by a call acceptance algorithm considering the effective bandwidth for example.
32 citations
Patent•
02 Dec 1994
TL;DR: In this paper, the authors proposed a method of controlling acceptance of a call by a network node in a communications network having a required quality of service comprising the steps of determining an infimum of a function of the probability of the node being overloaded if the call is accepted and determining from that infimum the effective bandwidth of the calls to the node if that call should be accepted.
Abstract: The invention provides a method of controlling acceptance of a call by a network node (2 and 3) in a communications network (1) having a required quality of service comprising the steps of determining an infimum of a function of the probability of the node being overloaded if the call is accepted and determining from that infimum the effective bandwidth of the calls to the node if that call should be accepted and determining a corresponding quality of service. The corresponding quality of service is then compared with a quality of service that is required for satisfactory operation of the network. If the quality is maintained or exceeded then the call is accepted for the node.
21 citations
TL;DR: It is shown how using a specified peak rate and on-line estimation of mean rates that statistical multiplexing for ATM is possible and safe, and effective bandwidths and Bayesian methods are used to develop Adaptive Call Admission Controls.
Abstract: The uncertainties surrounding traffic characterisation for future broadband services have led some to claim that statistical multiplexing for ATM is not feasible. We argue that this is unduly pessimistic, and show how using a specified (contracted) peak rate and on-line estimation of mean rates that such multiplexing is possible and safe. We use effective bandwidths and Bayesian methods to develop Adaptive Call Admission Controls. We show how these can be applied practically by giving results of a simulation experiment where our methods are applied to heterogeneous sources. These confirm our claims that the methods are both practical and conservative i.e. the Quality of Service standards are met.
11 citations
Proceedings Article•
23 Mar 1994TL;DR: The authors investigate how earlier work of van den Berg and Resing and of D'Ambrosio and Melen (1993) can be combined with classical bounds for the GI/G/1 queue to give insight into the output buffer required for a smooth playout of cells.
Abstract: The authors investigate how earlier work of van den Berg and Resing and of D'Ambrosio and Melen (1993) can be combined with classical bounds for the GI/G/1 queue to give insight into the output buffer required for a smooth playout of cells. The effect of both the number of stages across the network and the rate of the stream is considered. A possibly surprising conclusion is that as the rate of the stream decreases, the required output buffer size may actually increase. While the cell delay variation of small rate streams may cause no problems for buffers within the network, the cell delay variation introduced by the network may cause problems for the customer on output. >
9 citations