5 citations found. Retrieving documents...
J. Roberts, U. Mocci, and O. Virtamo (eds). Broadband Network Teletrac, Lecture Notes in Computer Science, vol. 1155. Springer, 1996.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
1-Bit Schemes for Service Discrimination in the.. - May, Bolot, Diot.. (1997)   (2 citations)  (Correct)

....A model of a queue using such a scheduling scheme is shown below. M G 1 K G,h l l 1 2 Figure 2: A queue with priority discarding mechanism Under the assumption that the input traOEcs of tagged and non tagged packets are Poisson, this model has been examined in detail and solved in [18, 24]. In particular, expressions are given for the fraction of tagged packets that are not accepted in the high priority queue. We refer to the references for details. 3.2 The 1 Bit Scheme for Delay Sensitive TraOEc We are not aware of models that would t exactly the 1 bit scheme for delay sensitive ....

Roberts, J., Mocci, U., Virtamo, O. (eds), Broadband Network TeletraOEc, Lecture Notes in Computer Science, vol. 1155, Springer, 1996.


1-Bit Schemes for Service Discrimination in the.. - May, Bolot, Diot.. (1997)   (2 citations)  (Correct)

....A model of a queue using such a scheduling scheme is shown below. M G 1 K G,h l l 1 2 Figure 2: A queue with priority discarding mechanism Under the assumption that the input traOEcs of tagged and non tagged packets are Poisson, this model has been examined in detail and solved in [18, 24]. In particular, expressions are given for the fraction of tagged packets that are not accepted in the high priority queue. We refer to the references for details. INRIA 9 3.2 The 1 Bit Scheme for Delay Sensitive TraOEc We are not aware of models that would t exactly the 1 bit scheme for delay ....

Roberts, J., Mocci, U., Virtamo, O. (eds), Broadband Network TeletraOEc, Lecture Notes in Computer Science, vol. 1155, Springer, 1996.


Simple Performance Models of Differentiated Services.. - May, Bolot.. (1999)   (43 citations)  (Correct)

....TOS byte) and let tags indicate that the packet should receive preferential treatment. Of course, the idea is not new: packet tagging has been advocated and deployed in Frame Relay (FR) networking using the drop preference bit (DE bit) in ATM networking using the cell loss priority bit (CLP bit) [19, 20, 23], and in a variety of other networks (e.g. 1] However, tagging more generally can be used to provide dioeerent kinds of service discrimination. Clark [3] argued that a guaranteed, or at least expected, throughput is the one quality of service (QoS) feature of interest to most applications, ....

.... the the AS scheme, CLP bit in ATM) and polic ing (prole meter in the AS scheme, leaky bucket policing in ATM) Thus, it is natural to refer to the vast literature on CLP based tagging schemes and leaky bucket proling; see for example Elwalid and Mitra [19] Kr#ner et al. 14] and Roberts et al. [23]. We do not use the complex (but accurate) model of [19] which is only amenable to numerical solutions. Instead, we use an approach and models similar to those in [14, 23] however we add to those a model for RIO. The resulting model is simple and it yields closed form expressions for performance ....

[Article contains additional citation context not shown here]

Roberts, J., Mocci, U., Virtamo, O. (eds), Broadband Network TeletraOEc, Lecture Notes in Computer Science, vol. 1155, Springer, 1996.


Calculation of Time-Dependent Blocking Probabilities - Virtamo, Aalto   Self-citation (Virtamo)   (Correct)

....z) 2 . In order to estimate P # k i (t) we determine z = z k i (t) such that m(z, t i) k. This leads to z k i (t) # (a(1 p t ) 2 (i k)p t ) 2 4aip t (1 p t ) 2 (a(1 p t ) 2 (i k)p t ) 2ap t (1 p t ) 3 The probability shift argument finally gives (cf. [6], 5.4.5) P # k i (t) # z k N(z, t i) # 2#v(z, t i) # # # # # # z = z k i (t) 3. FINITE SYSTEM The analysis of the finite system can be based on two observations. First, the equations (1) for a finite system are the same as those of an infinite system for the range k =0, n except ....

J. Roberts, U. Mocci and J. Virtamo (Eds.), Broadband Network Teletra#c, Final Report of Action COST 242, Lecture Notes in Computer Science, 1155, Springer, 1996.


A Time-Scale Decomposition Approach to Measurement-Based.. - Grossglauser, Tse (1999)   (22 citations)  (Correct)

No context found.

J. Roberts, U. Mocci, and O. Virtamo (eds). Broadband Network Teletrac, Lecture Notes in Computer Science, vol. 1155. Springer, 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC