ROBUST TRANSPORT OF IP TRAFFIC OVER WDM USING OPTICAL BURST SWITCHING

Abstract: A technique for selecting the offset between data bursts and their respective control packets in an optical burst switching arrangement includes: randomly generating a plurality of tokens; receiving a plurality of sequentially generated data bursts; and receiving a plurality of control packets, each control packet corresponding to a respective one of the plurality of data bursts. One of the plurality of control packets is first outputted and its corresponding respective data burst is then output at a time corresponding to the generation of the first of the plurality of tokens which occurs at a time in which no data burst is being outputted, the outputting of the data burst being offset from the output of its corresponding respective control packet by a time period. The average rate at which the plurality of data bursts are outputted may be equal to the reciprocal of the mean of the probability distribution used to generate the plurality of tokens. The plurality of tokens may be randomly generated according to a Poisson process.

Description: ROBUST TRANSPORT OF IP TRAFFIC OVER WDM USING OPTICAL BURST SWITCHING TECHNICAL FIELD BACKGROUND ART The present invention relates to the routing of Internet protocol traffic using optical burst switching and more particularly the present invention relates to selecting the offset between a control packet and a data burst to optimize the traffic flow. Rapid growth in the volume of Internet traffic over the last decade has generated a considerable amount of interest in devising new high-speed transmission and switching technologies. Wavelength division multiplexing can support a number of simultaneous highspeed channels on a single optical fiber and can thereby provide an enormous bandwidth at the physical layer. In order to exploit this bandwidth to meet the future traffic requirements, higher layer communication protocols must be developed to make efficient use of the transmission capacity of such optical fiber arrangements. Presently, wavelength division multiplexing deployment is mostly point-to-point and the Internet protocol routers and asynchronous transfer mode switches in such a backbone still use electronic processing, such as header processing for routing including table lookups or label swapping and data-processing for multiplexing including mapping Internet protocol packets into asynchronous transfer mode cells before transporting over wavelength division multiplexed links using SONET frames. Since the operating speed of electronic devices is considerably slower than the transmission speed provided by the optical wavelength division multiplexing layer, the optical-electronics-optical conversion at the intermediate nodes in the data path of the wavelength division multiplexing layer should be eliminated. Ideally, at all-optical packet switch arrangement so as to eliminate the electronics entirely would eliminate the speed bottleneck. However, the present limitations of optical buffering, among other things, preclude entirely optical packet switching today. As a presently implementable alternative to all-optical packet switches, optical burst switching still allows the switching of data channels in the optical domain by perfoπrύng resource allocation in the electronic domain. In optical burst switching, a control packet precedes every data burst and the control packet and the corresponding data burst are launched at the source at points in time separated by an offset. The offset is determined at the time that the control packet is launched at the source. The control packet includes information required to route the data burst through the network and also includes the length of the corresponding data burst and its offset value. The control packet is processed electronically at each of the intermediate nodes for making routing decisions and the switching fabric at each node is configured accordingly to switch to the data burst that is expected to arrive after a time interval corresponding to the offset field of the control packet. Thus, the data burst is entirely optically switched to eliminate the electronic bottleneck. DISCLOSURE OF THE INVENTION The present invention determines the offset between the control packet and the data burst. While the offset must be at least as large as the sum of the processing times for the control packet at each of the intermediate nodes, the present invention determines an offset which can reduce the contention among reservations requested by different control packets for different flows so as to significantly improve the performance of the optical burst switching arrangement. That is, the present invention determines the offsets of successive data bursts from their control packets which results and reliable operation of the optical burst switching wavelength division multiplexing network. In the present invention, the data bursts are released into the network at random times to improve the burst blocking performance at individual nodes in the networkwide-contention-prone optical burst switching wavelength division multiplexing backbone. BRIEF DESCRIPTION OF THE DRAWINGS The foregoing and a better understanding of the present invention will become apparent from the following detailed description of example embodiments and the claims when read in connection with the accompanying drawings, all forming a part of the disclosure of this invention. While the foregoing and following written and illustrated disclosure focuses on disclosing example embodiments of the invention, it should be clearly understood that the same is by way of illustration and example only and the invention is not limited thereto. The spirit and scope of the present invention are limited only by the terms of the appended claims. The following represents brief descriptions of the drawings, wherein: Figure 1 is a block diagram of optical burst switching network. Figure 2 is a block diagram of an optical network transmitting Internet protocol data over a wavelength division multiplexing transmission backbone using multiprotocol label switching. Figure 3 is a block diagram illustrating a shaping interface between the Internet protocol layer and the wavelength division multiplexing optical layer. Figure 4 is a timing diagram of the data bursts before and after shaping and the control packets. Figure 5 illustrates the burst blocking probability as a function of the offered load for an interface supporting various numbers of wavelengths. Figure 6 illustrates the mapping of Internet protocol classes onto optical label switched paths. Figure 7 illustrates quality of service differentiation in terms of burst blocking probability. BEST MODE FOR CARRYING OUT THE INVENTION Before beginning a detailed description of the subject invention, mention of the following is in order. When appropriate, like reference numerals and characters may be used to designate identical, corresponding or similar components in differing drawing figures. Furthermore, in the detailed description to follow, example sizes/models/values/ranges may be given, although the present invention is not limited thereto. Still furthermore, the clock and timing signal figures are not drawn to scale, and instead, exemplary and critical time values are mentioned when appropriate. In addition, well-known power connections to the components have not been shown within the drawing figures for simplicity of illustration and discussion and so as not to obscure the invention. Figure 1 is a block diagram of an optical burst switching network. Interfaces 150, 151,152, and 153 are disposed along the optical switching path. A data burst 160 is first launched at the source and is followed by the control packet 170 which is launched after an offset 180 from the start of the data burst 160. In the control unit 100, of interface i, the control packet 170 is first converted from an optical signal into an electrical signal by an optical-electrical converter 110. The output of the optical-electrical converter 110 controls label swapping 120 and a wavelength scheduler 130 and the resultant processed output is converted from electrical signal into an optical signal in an electrical-optical converter 140 whose output is used to switch the data burst 160 that is expected to arrive after the time interval contained within the offset field of the control packet 170. Figure 2 is a block diagram of an optical network transmitting Internet protocol data over a wavelength division multiplexing transmission backbone using multiprotocol label switching. Internet protocol routers 201,202, and 203 are disposed at the ingress of the network and Internet protocol routers 230 and 240 are disposed at the egress of the network. Intermediate nodes 210, 211, and 212 are disposed between the ingress routers and the egress routers. Data bursts are assembled at the ingress routers and delivered to the ingress routers via the intermediate nodes in an all-optical domain. It is assumed that there is no buffering of data bursts at the intermediate nodes. Semi-permanent data pipes can be set up between different ingress-egress pairs using multiprotocol label switching. An Internet protocol routing and sorting engine causes a major bottleneck at high transmission speeds due to its processing requirements. Multiprotocol label switching is a forwarding technique which uses the labels associated with packets to make packet forwarding decisions at the network nodes rather than by conventional destination-based hop-by-hop forwarding arrangements. In multiprotocol label switching, the space of all possible fowarding options is partitioned into forwarding equivalence classes. For example, all of the packets destined for a given egress node which have the same quality of service requirement may belong to the same forwarding equivalence class. The packets are labeled at the ingress in accordance with the forwarding equivalence class with which they belong. Each of the intermediate nodes uses the label of an incoming packet to determine its next hop and also performs label swapping, that is, it replaces the incoming label with the new outgoing label which identifies the respective forwarding equivalence class for the downstream node. Such a label-based forwarding technique reduces the processing overhead required for routing at the intermediate nodes, thereby improving their packet forwarding performance and scalability. Furthermore, the label swapping processed used by multiprotocol label switching creates a multipoint-to-point routing tree rather than a routing mesh used in conventional networks. Multiprotocol label switching also provides constraint-based routing in which the ingress node can establish an explicit route through the network rather than inefficiently carrying the explicit route in each packet. Instead, multiprotocol label switching allows the explicit route to be carried only at the time that the label switched path is set up. The subsequent packets traversing this path are forwarded using packet labels. The control packets that precede the data bursts can be used to carry multiprotocol label switching labels. The intermediate nodes use the labels in incoming control packets to set up the switch fabric, thereby allowing the data burst to be forwarding in an all-optical domain. The data bursts are freed from carrying any labels. Multiprotocol label switching thereby allows the establishment of data pipes through an optical burst switching wavelength division multiplexing domain between different ingress-egress pairs. These data pipes will be referred to hereinafter as optical LSP's (label switched paths). Figure 3 is a block diagram illustrating a shaping interface between the Internet protocol layer and the wavelength division multiplexing optical layer. A medium access control interface 350 is shown as being disposed between the Internet protocol layer 300 and the optical layer 370. The medium access control layer 350, which includes a burst assembly 313 and a burst scheduler 324 and shaper 335, assembles data bursts from the packets generated by the Internet protocol layer 300 for each optical LSP. Various quality of service considerations, such as DiffServ can be used at the Internet protocol layer 300 before the packets are released to the medium access control layer 350. The optical LSP 340 of the medium access control 350 appears to the Internet protocol layer 300 as a reliable data pipe that guarantees certain burst blocking probability to the Internet protocol layer 300. The delay across the optical LSP 340 has to components, namely, a fixed component which mainly consists of the propagation delay across the optical backbone and a variable component which depends on the design of the shaper 335 and burst assembler 313 at the ingress router. An output interface of a node in the optical burst switching wavelength division multiplexing domain received traffic from different LSP's. This creates the potential for contention among different LSP's. When the control packets from different LSP's request reservations for their data bursts on a particular wavelength of a given output interface for time intervals which overlap each other, hereinafter referred to as burst blocking, only one of these requests can be granted. Accordingly, some control packets must be dropped at that interface and is in turn results in the loss of data bursts corresponding to the dropped control packets. The data loss rate due to burst blocking will be large if the reservation requests arriving at a given output interface from different optical LSP's are time correlated. Furthermore, due to the unpredictability of traffic, it is difficult to always guarantee a low burst blocking probability. In accordance with a present invention, a shaping mechanism, including the shaper 335, for example, is incorporated in the medium access control layer 350 at the ingress thereof which facilitates the determination of offsets for the successive data bursts so as to maintain a low burst blocking probability at all times in the optical burst switching wavelength division multiplexing layer. The shaping mechanism removes the time correlation among the reservation requests of different optical LSP's and enforces predetermined statistics on the data stream entering the optical burst switching wavelength division multiplex layer, irrespective of the statistics of the Internet protocol layer that resides over it. Due to the bufferless operation of the optical burst switching wavelength division multiplexing layer, this statistic is invariant even if the burst stream traverses multiple nodes in the optical burst switching wavelength division multiplexing domain. This results in a robust layer in which the probability of burst blocking is always maintained below a low predetermined value irrespective of the operation of the sources generating the data packets. As shown in figure 3, the stream of data bursts to be sent over a particular optical LSP is inputted to the shaper 335 which determines the value of the offset between the data burst and its corresponding control packet. The shaper 335 then forms the control packet and transmits it over the control channel. The control packet includes information such as the offset value between the data burst and the corresponding control packet, the length of the data burst and the routing label. The shaper 335 causes the data burst to be outputted to the optical burst switching wavelength division multiplexing layer after the control packet has been transmitted, the data burst being outputted a period of time equal to the offset value after the control packet has been transmitted. The offset between a data burst and its corresponding control packet has two parts, namely, a constant part to account for the processing time of the control packet at the intermediate nodes and a variable part which is varied from burst to burst to lower the probability of burst blocking. The variable part of the offset for the rth data burst, denoted by δ„ is determined as follows: Let T 0 =0, T x , T 2 , ...denote the times of occurrences of points of a random point process in which the time periods between the occurrences of successive points (i.e., T,-T, Λ , for / > 1) are independently and identically distributed according to the probability distribution F(.). Let T 0 (ω)=0,T,((o), T 2 (ω), ...denotes a particular realization (sample path) of this random point process. If the rth data burst arrives at the shaper at time a„ and that the (/-l)th data burst is released at Tk, - 1((0 ) , then the rth burst is released at time 7*.(ω ), where Tkι(ω ) is the first point after Tk, - _(ω ) satisfying the following inequality: Tk, - ) - Tk, - _(ω ) > L - 1 and Tk,(ω ) > cii. Hence, the offset between the rth data burst and the control packet corresponding to it is determined by the following equation: The shaping scheme described above (see Figure 4) is equivalent to leaky bucket regulator with no buffering provided for tokens, and in which tokens arrive at T 0 (ω),T,(ω), T , -. Figure 4 is a timing diagram of the data bursts before and after shaping and the control packets. Figure 4(A) illustrates the data bursts LI, L2, L3, and L4 before shaping by the shaper 335. Figure 4(B) illustrates the arrival of the tokens Tl, T2, T3, T4 and T5. Figure 4(C) illustrates the data bursts dl,d2, d3, and d4. Figure 4(D) illustrates the control packets corresponding to the data bursts of Figure 4(A). As illustrated in Figure 4, the data bursts are of random length and occur at seemingly random times which may in fact be time correlated. As noted above, the token arrivals have been chosen so as to be randomly distributed. The data burst LI is shaped by the shaper 335 into the shaped data burst dl by having its transmission beginning at the arrival of token Tl which occurs at a time δl after the start of the control packet corresponding to the data burst LI . Similarly, the shaped data burst d2 has its transmission beginning at the arrival of the token T2 which occurs at a time 52 after the start of the control packet corresponding to the data burst L2. Shaped data burst d3, on the other hand, has its transmission beginning at the arrival of token T4 which occurs at a time 53 from the start of the control packet corresponding to the data burst L3. This is due to the fact that the token T3 arrives during the pendency of the shaped data burst d2. Since the shaped data burst d3 can not commence prior to the completion of the shaped data burst d2, token T3 is not used. Shaped data burst d4 has its transmission beginning at the arrival of token T5 which occurs at a time 54 from the start of the control packet corresponding to the data burst L4. The type of shaping described above regulates the average rate at which data bursts are released into the optical burst switching wavelength division multiplexing layer. This rate is equal to the reciprocal of the mean of the probability distribution F (.) used to generate the tokens. Furthermore, the randomized generation of tokens prevents synchronization among the token streams of different LSP's. This is significant in that if the token generators of two LSP's traversing the same output interface of a particular node in the optical burst switching wavelength division multiplexing network happen to be synchronized, the data bursts in these LSP's will have a high probability of colliding with each other at that interface, thereby causing excessive data losses. It is possible for the random generators for tokens at different hosts to be initialized so as to prevent inadvertent synchronization. The proposed shaping scheme also imposes the following property of the stream of data bursts of any optical LSP.Let{A(t)} t≥0 denote total data arriving over an optical LSP until time t at any node (ingress or intermediate) in the OBS WDM network. Then, A(-) - a(s)sAχ(f) - A x , a.s., (almost surely), for all t ≥s, where {A/ 0 denotes total data that would have arrived on that LSP until time t at that node, if data bursts were arriving at T 0 , T λ , T .... It is easy to see that the domination as in Eq. 1 holds at the output of the shaper of every optical LSP, by virtue of the shaping scheme. As data bursts traverse various nodes in the optical backbone, some of them can only be discarded, due to contention. Furthermore, due to inherently bufferless forwarding, the relative positions of the data bursts of any optical LSP remain unchanged even after these data bursts traverse a number of nodes. Hence, the domination as in Eq. 1 holds at the output interface of every node that a given optical LSP traverses. A framework for resource provisioning an admission control, based on the above noted shaping scheme, is provided below and in addition, the role of this shaping scheme in improving the performance of an optical burst switching wavelength division multiplexing layer will be demonstrated below for the case of TCP/IP traffic. The following is a description of one example of how the shaping scheme can be used for traffic engineering in an OBS WDM network. Consider an output interface (fiber) of any node in an OBS WDM network. Suppose that this node is being traversed by N data pipes (optical LSP's) with the provisional data rates of rj,...,r N , respectively. If the data bursts entering into these LSP's are shaped at the ingress using Poisson shapers (this means that the probability distribution for the time interval between the successive tokens of the rth optical LSP, denoted by E,(.), is chosen to be exponential), the following holds for their data arriving at the output interface under consideration. For all t>s, Ai(t) - Ai(s) < AP(r,)(t) - AP(r,)(s), a. s, for all 1 < ; < N, and (2) ;v A(t) - A(s) = ∑ A(t) - Aι(s)) < Ap(.r)(t) - Ap(r)(s), a. s. (3) Here, A,(t) denotes the total data arriving over the rth optical LSP until time t, AP(x)(t) denotes the data that would arrive if the data bursts were arriving according to a Poisson process of ι=l Now, if ? ac - ua i( 'ι. " - . v) denotes the actual burst blocking probability at the given output interface, it is intuitively appealing to say that 7actual(n, ... , ΓN) ≤ />Poisson( ), (4) where p Polsson (r) denotes the burst blocking probability at that interface if the bursts were arriving according to the Poisson process of rate r. The right hand side of Inequality 4 is given by the well known Erlang loss formula, where c is the total number of wavelengths at the output interface, and II μ is the average packet length. If the establishment of a new optical LSP, requiring a data rate of r N+] and a burst blocking probability of r N+1 , is requested through a given output interface at a node in an OBS WDM network, it can be admitted if and only if N+l /7Poisson(r) < /?N + 1, with r = ∑ Ti (6) i=l Figure 5 illustrates the burst blocking probability as a function of the offered load for in interface supporting various numbers of wavelengths. Specifically, Figure 5 shows the case for in interface supporting 16,32, 48, 64, and 80 wavelength channels. It can be seen from Figure 5, that a wavelength division multiplexing network in accordance with the present invention can be operated at high utilizations using optical burst switching when the number of wavelengths is large. For example, as illustrated in Figure 5, with a target burst blocking probability which is less than 10 "4 , a wavelength division multiplexing network in accordance with the present invention can operate with greater than 60 percent utilizations if the number of wavelength channels is 64. The approach to supporting IP over optical backbone consists of providing MAC layer functionalities so that the underlying optical layer (using OBS) appears to the IP layer as a reliable data pipe (see Figure 3). By virtue of the shaping scheme and the connection admission control procedure described above, the burst blocking performance of every optical LSP is guaranteed. It is also possible to render some end-to-end delay characteristics to optical LSP as follows. As seen from Figure 3, the various elements in the MAC layer 350 such as the burst assembler 313, the burst scheduler 324 and the shaper 335, introduce some amount of delay at the ingress of an optical LSP. The following is a description of one example of how the delay due to shaping can be controlled. Assume that the establishment of an optical LSP, requiring a data rate of r N+1 , a burst blocking probability of/? N+1 and an end-to-end delay guarantee of _9 N+1 , is requested between a chosen ingress-egress pair. The actual token rate may be chosen such that: Prob[Time interval between successive tokens > -- ) ]] > e, and Token rate > r N+1 . This value token rate is then used in Eq. 6 in place of r N+1 to take admission control decision. Figure 6 shows how IP DiffServ classes can be mapped onto optical LSP's that are now reliable, as well as have certain delay characteristics. Another quality of service dimension is to logically partition the backbone into a number of optical LSP's, each providing different levels of reliability given in terms of burst blocking probability. The reliability of different optical LSP's can then be mapped onto some cost function. This, in turn, can be used by the routing protocols to forward IP packets to appropriate edge routers depending on their quality of service needs (now in terms of loss rate). This is depicted in Figure 7. The bottleneck output interface (fiber) of a node in an OBS WDM network supporting three OC12 wavelengths (622 Mb/s per wavelength) per output interface has been simulated. This interface is traversed by a number of optical LSP's. Ten such optical LSP's each carrying ingress-to-egress data traffic supported on TCP/IP are assumed. There are (forward paths of) 4 TCP sessions in each of these optical LSP's. The acknowledgment paths (or reverse paths) of these TCP's are taken to be lossless, and they introduce only a constant delay. Simulations were run with a simulation tool. Each of the 40 TCP sessions is started at time instant sampled from the uniform distribution over (0 s, 1 s). Once started, all TCP sources always have data to send. For simplicity, every data burst that is assembled at the MAC layer is taken to be precisely one IP packet. The delay introduced by the reverse path of every TCP session is sampled from the uniform distribution as explained in the next section. AS shown in Figure 5, the burst traffic offered to each LSP is shaped at the ingress. The probability distribution F,(.) used in shaping the burst traffic of the / th optical LSP is taken to be exponential with a meaning 1/r, This causes the data burst arrivals at the output of each shaper to be dominated by the Poisson process of rate r and the total arrive process of data bursts at the bottleneck output interface to be dominated by the Poisson process of rate ∑io fi. Simple greedy and exhaustive wavelength selection policy may be used to assign the reservations to the control packets arriving at the bottleneck output interface. Simulation experiments have been run in different regimes of the target burst blocking probability, namely, 10 "2 , 10 "3 and 10 "4 . For each of these values, the total allowable load r at that output interface is calculated using Erlang loss formula (Eq. 5), with c = 3. r, is then taken to be r/10, for / = 1, ..., 10. For the target burst blocking probabilities of 10 "2 , 10 "3 and 10 "4 , the delay introduced by the reverse path of every TCP session is sampled from the uniform distribution over [0 ms, 1 ms), [0 ms, 25 ms) and [0 ms, 50 ms), respectively. This is done so that the actual aggregate load offered by all TCP's is not much lower than the designed throughput value. For example, 40 TCP's fail to offer an average load as large as about 311 Mb/s at the packet loss probability of 10 "2 in the end-to-end path, if their round trip times are larger than about 1 ms. It is as fundamental fact that the TCP throughput significantly deteriorates if the end-to-end packet loss probability is much larger than the inverse square of the product of the bottleneck bandwidth and the round trip delay. And, it is clearly trivial to establish Inequality 4 if the offered average load itself is much lower than the designed value for the load. The results are shown in Table I below. This concludes the description of the example embodiments. Although the present invention has been described with reference to a number of illustrative embodiments thereof, it should be understood that numerous other modifications and embodiments can be devised by those skilled in the art that will fall within the spirit and scope of the principles of this invention. More particularly, reasonable variations and modifications are possible in the component parts and/or arrangements of the subject combination arrangement within the scope of the foregoing disclosure, the drawings, and the appended claims, without departing from the spirit of the invention. In addition to variations and modifications in the component parts and/or arrangements, alternative uses will also be apparent to those skilled in the art. What is claimed is:

Claims: CLAIMS We claim; A method of selecting the offset between data bursts and their respective control packets in an optical burst switching arrangement, the method comprising: randomly generating a plurality of tokens; receiving a plurality of sequentially generated data bursts; receiving a plurality of control packets, each control packet corresponding to a respective one of said plurality of data bursts; first outputting one of said plurality of control packets and then outputting its corresponding respective data burst at a time corresponding to the generation of the first of said plurality of tokens which occurs at a time in which no data burst is being outputted, the outputting of the data burst being offset from the outputting of its corresponding respective control packet by a time period delta. 2. The method of claim 1, wherein an average rate at which said plurality of data bursts are outputted is equal to the reciprocal of the mean of the probability distribution used to generate said plurality of tokens. 3. An apparatus for selecting the offset between data bursts and their respective control packets in an optical burst switching arrangement, the apparatus comprising: a token generator for randomly generating a plurality of tokens; a data burst receiver for receiving a plurality of sequentially generated data bursts; a control packet receiver for receiving a plurality of control packets, each control packet corresponding to a respective one of said plurality of data bursts; a transmitter for first outputting one of said plurality of control packets received by said control packet receiver and for then outputting its corresponding respective data burst received by said data burst receiver at a time corresponding to the generation of the first of said plurality of tokens by said token generator which occurs at a time in which no data burst is being outputted by said transmitter, the outputting of said data burst being offset from the outputting of its corresponding respective control packet by a time period delta. 4. The apparatus of claim 3, wherein said transmitter outputs said plurality of data bursts at an average rate which is equal to the reciprocal of the mean of the probability distribution used to generate said plurality of tokens . 5. The method of claim 1, wherein if T0= 0, Tl, T2, ... denote the times of occurrences of points of a random point process in which the time periods between occurrences of success of points (Ti-T(i-l) for i>l) are independently and identically distributed according to a probability distribution F(.) and if T0(ω)= 0, Tl(ω), T2(ω), ... denote a particular realization of the random point process and if the ith data burst arrives at a time ai, and the (i-l)th data burst is outputted at T(ki-l)(ω), then the ith data burst is outputted at time Tki(ω) which is the first point after T(ki- l)(ω) satisfying the following inequality: Tki(ω)-T(ki- 1 )(ω) ≥L(i-l) and Tki(ω) ≥ ai,L(i- 1 ) being the(i- 1 )fh inputted data burst; and wherein: δi= Tki(ω) - ai, δi being the offset between the ith data burst and its corresponding respective control packet. 6. The method of claim 2, wherein if T0= 0, Tl, T2, ... denote the times of occurrences of points of a random point process in which the time periods between occurrences of success of points (Ti-T(i-l) for i> 1) are independently and identically distributed according to a probability distribution F(.) and if T0(ω)= 0, Tl(ω), T2(ω), ... denote a particular realization of the random point process and if the ith data burst arrives at a time ai, and the (i-l)th data burst is outputted at T(ki-l)(ω), then the ith data burst is outputted at time Tki(ω) which is the first point after T(ki- l)(ω) satisfying the following inequality: Tki(ω)-T(ki-l)(ω)>L(i-l) and Tki(ω)>ai,L(i-l) being the(i-l)th inputted data burst; and wherein: δi= Tki(ω) - ai, δi being the offset between the ith data burst and its corresponding respective control packet. 7. The apparatus of claim 3, wherein if T0= 0, Tl, T2, ... denote the times of occurrences of points of a random point process in which the time periods between occurrences of success of points (Ti-T(i-l) for i≥ 1) are independently and identically distributed according to a probability distribution F(.) and if T0(ω)= 0, Tl(ω), T2(ω), ... denote a particular realization of the random point process and if the ith data burst arrives at a time ai, and the (i- l)th data burst is outputted at T(ki-l)(ω), then the ith data burst is outputted at time Tki(ω) which is the first point after T(ki-l)(ω) satisfying the following inequality: Tki(ω)-T(ki-l)(ω)>L(i-l) and Tki(ω)-_ai,L(i-l) being the(i-l)th inputted data burst; and wherein: δi= Tki(ω) - ai, δi being the offset between the ith data burst and its corresponding respective control packet. 8. The apparatus of claim 4, wherein if T0= 0, T 1 , T2, ... denote the times of occurrences of points of a random point process in which the time periods between occurrences of success of points (Ti-T(i-l) for i> 1) are independently and identically distributed according to a probability distribution F(.) and if T0(ω)= 0, Tl(ω), T2(ω), ... denote a particular realization of the random point process and if the ith data burst arrives at a time ai, and the (i- l)th data burst is outputted at T(ki-l)(ω), then the ith data burst is outputted at time Tki(ω) which is the first point after T(ki-l)(ω) satisfying the following inequality: Tki(ω)-T(ki-l)(ω)-.(i-l) and Tki(ω)≥ai,L(i-l) being the(i-l)th inputted data burst; and wherein: δi= Tki(ω) - ai, δi being the offset between the ith data burst and its corresponding respective control packet. 9. The method of claim 1 , wherein the plurality of tokens are randomly generated according to a Poisson process. 10. The method of claim 2,wherein the plurality of tokens are randomly generated according to a Poisson process. 11. The apparatus of claim 3, wherein said token generator randomly generates said plurality of tokens according to a Poisson process. 12. The apparatus of claim 4,wherein said token generator randomly generates said plurality of tokens according to a Poisson process. 13. The method of claim 5, wherein the plurality of tokens are randomly generated according to a Poisson process. 14. The method of claim 6,wherein the plurality of tokens are randomly generated according to a Poisson process . 15. The apparatus of claim 7,wherein said token generator randomly generates said plurality of tokens according to a Poisson process . 16. The apparatus of claim 8, wherein said token generator randomly generates said plurality of tokens according to a Poisson process . 17. An optical burst switching apparatus comprising: a source generator for generating a plurality of data bursts and their respective control packets, each data burst being generated at a time which is offset from that of its respective control packet; an ingress router for receiving and outputting said plurality of data bursts and their respective control packets generated by said source generator; 84 an egress router for receiving and outputting said output of said ingress router; 85 at least one intermediate node, disposed between said ingress router and said egress 86 router, for transmitting said plurality of data bursts and their respective control packets; 87 wherein said source generator comprises: 88 a token generator for randomly generating a plurality of tokens; 89 a data burst receiver for receiving a plurality of sequentially generated data bursts; 90 a control packet receiver for receiving a plurality of control packets, each control 91 packet corresponding to a respective one of said plurality of data bursts; 92 a transmitter for first outputting one of said plurality of control packets received by 93 said control packet receiver and for then outputting its corresponding respective data burst 94 received by said data burst receiver at a time corresponding to the generation of the first of said 95 plurality of tokens by said token generator which occurs at a time in which no data burst is 96 being outputted by said transmitter, the outputting of said data burst being offset from the 97 outputting of its corresponding respective control packet by a time period delta. 98 18. The apparatus of claim 17, wherein said transmitter outputs said plurality of data 99 bursts at an average rate which is equal to the reciprocal of the mean of the probability 100 distribution used to generate said plurality of tokens . 101 19. The apparatus of claim 17, wherein if T0= 0, Tl, T2, ... denote the times of 102 occurrences of points of a random point process in which the time periods between occurrences 103 of success of points (Ti-T(i-l) for i≥ 1) are independently and identically distributed according 104 to a probability distribution F(.) and if T0(ω)= 0, Tl(ω), T2(ω), ... denote a particular 105 realization of the random point process and if the ith data burst arrives at a time ai, and the (i- 106 1 )th data burst is outputted at 107 T(ki-l)(ω), then the ith data burst is outputted at time Tki(ω) which is the first point after T(ki- 108 l)(ω) satisfying the following inequality: 109 Tki(ω)-T(ki-l)(ω)≥L(i-l) and Tki(ω)>ai,L(i-l) being the(i-l)th inputted data burst; 110 and wherein: 111 δi= Tki(ω) - ai, δi being the offset between the ith data burst and its corresponding 112 respective control packet. 113 20. The apparatus of claim 18, wherein if T0= 0, Tl, T2, ... denote the times of 114 occurrences of points of a random point process in which the time periods between occurrences 115 of success of points (Ti-T(i-l) for i> 1) are independently and identically distributed according 116 to a probability distribution F(.) and if T0(ω)= 0, Tl(ω), T2(ω), ... denote a particular 117 realization of the random point process and if the ith data burst arrives at a time ai, and the (i- 118 l)th data burst is outputted at T(ki-l)(ω), then the ith data burst is outputted at time Tki(ω) 119 which is the first point after T(ki-l)(ω) satisfying the following inequality: 120 Tki(ω)-T(ki-l)(ω)>L(i-l) and Tki(ω)--ai,L(i-l) being the(i-l)th inputted data burst; 121 and wherein: 122 δi= Tki(w) - ai, δi being the offset between the ith data burst and its corresponding 123 respective control packet.

Inventors: CHASKAR HEMANT, DIXIT SUDHIR S, RAVIKANTH R, VERMA SANJEEV, CHASKAR, HEMANT, DIXIT, SUDHIR, S., RAVIKANTH, R., VERMA, SANJEEV
Applicants: NOKIA INC, NOKIA, INC.
Application year: 2001
Main classification: H04Q11
IPC codes: H04Q11