C.S. Chang, Smoothing point processes as a means to increase throughput, Operations Research, 43 (1995) 117-129.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....tandem In the sequel, we restrict attention to simple and stationary point processes with finite average intensity. P 0 N denotes the Palm probability associated with 4 a point process N (see for instance the book of Baccelli and Br emaud [2] for background on Palm calculus) In [7], Chang considered the variability ordering var , which is defined by N var N 0 , T 1 [P 0 N ] cx T 0 1 [P 0 N 0 ] where cx is the classical convex ordering (see e.g. 19] or Szekli [20] T 1 is the first point of N on (0; 1) and T 1 [P 0 N ] denotes the distribution of T 1 under ....

....var , which is defined by N var N 0 , T 1 [P 0 N ] cx T 0 1 [P 0 N 0 ] where cx is the classical convex ordering (see e.g. 19] or Szekli [20] T 1 is the first point of N on (0; 1) and T 1 [P 0 N ] denotes the distribution of T 1 under P 0 N . It is shown in particular in [7] that the p.p. D counting departures from a Delta=D=1 queue is less than the input process for the variability ordering. Remark that var is not stronger than 2 . Indeed, select two cdf s F , F 0 on (0; 1) such that F cx F 0 ; let N 0 be renewal with interarrival time distribution F 0 ....

C.S. Chang, Smoothing point processes as a means to increase throughput, Operations Research, 43 (1995) 117-129.

....period of time (which can be dynamically adjusted) between when the system can repartition its node allocations. In addition to reducing the number of reconfigurations, this 17 approach tends to reduce the performance effects of job arrival variability by effectively smoothing the arrival process [6]. There is a fundamental tradeoff between these two dynamic partitioning approaches. Folding provides the advantage of immediately responding to workload changes, but it reduces the repartitioning overhead by interrupting fewer jobs to yield somewhat less equitable node allocations. Dynamic ....

C. S. Chang. Smoothing point processes as a means to increase throughput. Technical Report RC 16866, IBM Research Division, May 1991.

....300 130 1.5 Mbps MPEG NTSC video 5 6.5 20 Mbps HDTV video 0.8 1 Table 1. Average Delay and Jitter Tolerance for Two way Video Voice Applications Network# ### ### ### ### Fig. 1. Cell Delay Variation Prior jitter related research focuses on jitter estimation and on traffic pattern reshaping [7, 9, 10]. Several jitter estimation methods exist including, the simple method, square root method, asymptotic method, and the Chernoff method. Briefly stated, these methods are represented as: Simple method [3] N i i tot cdv cdv 1 a a Square root method [4] 2 1 = N i i ....

....Other research into jitter has focused on reshaping the traffic pattern in the network to a deterministic pattern. The reshaping goal is to have the receiver receive the cells with the same pattern of arrival as they were sent. Several algorithms described in the literature are smoothing filters [7], virtual scheduling [8] work withholdings [9] and FIFO servers [10] Prior studies on the subject have often resorted to simulation or mathematical analysis. We experimentally measure actual time delays inserted by the switch, and how the delays are perceived by the workstation at the ATM ....

C.S. Chang, "Smoothing point processes as a means to increase throughput", TR RC 16866, IBM Research Division, May 1991.

....into jitter has focused on reshaping the traffic pattern in the network to a deterministic pattern. The reshaping goal is to have the receiver receive the cells with the same pattern of arrival as they were sent with. Several algorithms explored in the literature have been smoothing filters [7], virtual scheduling [8] work withholdings [9] and FIFO servers [10] Traffic control in ATM networks takes three approaches, all of which attempt to provide QoS guarantees to traffic streams. The first is admission control, this happens before a source is allocated a slot in the network. The ....

C.S. Chang. Smoothing point processes as a means to increase throughput. TR RC 16866, IBM Research Division, May 1991.

....period of time (which can be dynamically adjusted) between when the system can repartition its node allocations. In addition to reducing the number of reconfigurations, this approach tends to reduce the performance e#ects of job arrival variability by e#ectively smoothing the arrival process [6]. There is a fundamental tradeo# between these two dynamic partitioning approaches. Folding provides the advantage of immediately responding to workload changes, but it reduces the repartitioning overhead by interrupting fewer jobs to yield somewhat less equitable node allocations. Dynamic ....

C. S. Chang. Smoothing point processes as a means to increase throughput. Technical Report RC 16866, IBM Research Division, May 1991.

....to offer lower connection charges to customers whose sources are less bursty, all else being equal. Previous work on traffic shaping has taken the form of devising rate control devices, such as window mechanisms and leaky buckets [2, 3, 4] Newer directions take the form of smoothing filters [5] and virtual scheduling [6] In most cases, though, the functions of traffic shaping and policing are integrated. For example, a leaky bucket may perform peak rate enforcement, but by virtue of its buffer it will also perform traffic shaping. We believe that the roles of traffic shaping and ....

....the shaper is empty upon arrival. The service time is optimized, assuming the shaper is empty, so that the interdeparture time variance of cells leaving the shaper is minimized. In order to limit the size of the shaper queue, heuristics are included in the optimization. The shaping algorithms of [5, 7] are similar to that presented here, however this paper assumes that the shaper has knowledge of the type of traffic presented to it. This can be accomplished by employing suitable variables at call setup time, or by using a mechanism which can detect and classify traffic types [8] In order to ....

C.S. Chang. Smoothing point processes as a means to increase throughput. Technical Report RC 16866, IBM Research Division, May 1991.

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