WO2003084107A1 - Reservation-based mac and optical network - Google Patents
Reservation-based mac and optical network Download PDFInfo
- Publication number
- WO2003084107A1 WO2003084107A1 PCT/US2003/009129 US0309129W WO03084107A1 WO 2003084107 A1 WO2003084107 A1 WO 2003084107A1 US 0309129 W US0309129 W US 0309129W WO 03084107 A1 WO03084107 A1 WO 03084107A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- nodes
- node
- reservation
- time slot
- time
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/72—Admission control; Resource allocation using reservation actions during connection setup
- H04L47/724—Admission control; Resource allocation using reservation actions during connection setup at intermediate nodes, e.g. resource reservation protocol [RSVP]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/42—Loop networks
- H04L12/427—Loop networks with decentralised control
- H04L12/43—Loop networks with decentralised control with synchronous transmission, e.g. time division multiplex [TDM], slotted rings
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/50—Address allocation
- H04L61/5007—Internet protocol [IP] addresses
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0005—Switch and router aspects
- H04Q2011/0007—Construction
- H04Q2011/0033—Construction using time division switching
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
- H04Q2011/0064—Arbitration, scheduling or medium access control aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
- H04Q2011/0086—Network resource allocation, dimensioning or optimisation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
- H04Q2011/009—Topology aspects
- H04Q2011/0092—Ring
Definitions
- the present invention is directed to optimizing bandwidth and efficiency in an all-fiber network.
- Dynamic all-fiber optical networks utilize fast tunable lasers for single-hop optical routing over a uni-directional fiber ring. Access to the ring is provided by a media access controller (MAC), wherein each node has a dedicated wavelength, and the fiber can simultaneously carry a plurality of dedicated wavelengths. Each fiber therefore has a number of wavelengths which matches the number of nodes. The tuned outgoing wavelengths from each node are received by the correspondingly tuned receiver in the destination node. The tunable wavelength, therefore, is used on a per-packet basis to send the packet at the wavelength of the intended recipient node.
- MAC media access controller
- Such prior art networks are referred to as synchronous and slotted networks, the fiber ring is essentially divided into a plurality of time slots, with the time slots rotating uni-directionally around the ring.
- two rings can be used with each node transmitting the same data on each ring, but in opposite directions.
- Each node can transmit a packet only within the boundaries of a time slot.
- the length of the time slot is typically fixed. Scheduling of packets is typically performed through the scheduling of wavelengths and time slots. In order to avoid collisions in time slots, only one node can transmit on each wavelength. Once a time slot has a packet at a particular wavelength, no other node can transmit in that time slot at that wavelength thereby freeing the wavelengths at that time slot.
- the MMR and the SRR works (By Marco Ajmone Marsan, Andrea Bianco, Emilio Leonardi, A. Morabito, and Fabio Neri) are dealing with a slotted all-optical multi-ring topology.
- the MAC algorithm presented in these works is based on carrier-sense ability of each node and a fairness algorithm to prevent nodes starvation.
- the carrier-sense feature gives the network the ability to adapt transmission resources according to the traffic.
- the network bandwidth can be used more optimally.
- this approach has also a drawback that the algorithm lacks the ability to reserve bandwidth; consequently the network does not support constant bit-rate traffic.
- SR 3 A Bandwidth- Reservation MAC Protocol for Multimedia Applications over All-Optical WDM Multi-Rings
- Marco Ajmone Marsan, Andrea Bianco, Emilio Leonardi, A. Morabito, Fabio Neri The SR 3 algorithm is also based on the carrier-sense idea with additional capability of reserving bandwidth between two nodes.
- the reserve bandwidth between from source node to a specific destination node can be up to 1/N of the bandwidth (N is the number of nodes).
- N is the number of nodes.
- the carrier-sense approach requires a fairness algorithm in order to avoid node starvations.
- the fairness algorithm base on the SAT token can cause large delays.
- the delays created by the fairness algorithm causes that a fairness-based networks cannot transport delay sensitive traffic, such as voice/video traffic.
- an improved fairness algorithm was proposed by I. Cidon, L. Georgiadis, R. Guerin, and Y. Shavitt ("Improved Fairness Algorithm for Rings with Spatial Reuse").
- the present invention is therefore directed to a method of reserving bandwidth in a network, with the method including the steps of providing a network with a plurality of nodes, and calculating a demand matrix for bandwidth requirements based upon communication needs among the plurality of nodes.
- An integer number of time slots is provided, aligned around the network.
- Bandwidth is reserved for node-to-node communication based upon the demand matrix.
- the reserving of bandwidth includes reserving bandwidth between two nodes based upon time-slot alignment. Transmission is scheduled between two nodes by reservation of wavelength and time slots.
- the invention is also directed to a method of creating a reservation map for communications.
- the method comprises the steps of creating a demand matrix based upon demand data from a plurality of nodes connected on the network, and configuring a bipartite graph based upon the demand matrix and a series of collision groups.
- An unallocated time slot is selected from a plurality of time slots in a reservation frame.
- the time slot has a maximum number of allocation constraints among the unallocated time slots.
- the bipartite graph is modified based upon the allocation constraints of the time slot. Indications of the allocation constraints are removed from the bipartite graph.
- a maximum matching set is created for the adjusted bipartite graph, and a weight of original graph edges included in the maximum matching set is decremented.
- a reservation map time slot is created for the selected time slot based upon the maximum matching set. Time slot constraint data is updated according to the maximum matching set.
- the invention is also directed to a method of communicating data between nodes on an optical fiber ring network.
- the method comprises the steps of generating demand data for each node of a plurality of nodes in an optical fiber ring network, and creating a demand matrix in at least one node of the plurality of nodes.
- the demand matrix is based upon the demand data.
- a reservation map is created for each wavelength and each time slot of a reservation frame comprising a plurality of time slots and a plurality of wavelengths, thereby reserving bandwidth on a per time slot and per wavelength basis.
- the invention is also directed to a media access controller for a network, with the media access controller comprising a demand matrix unit for generating a demand matrix based upon bandwidth requirements for node-to-node communication.
- a reservation map unit is provided, for creating a reservation map based upon the demand matrix, and based upon allocation constraints for time slots and wavelengths in a reservation frame.
- the reservation map unit utilizes maximum matching data for communication among a plurality of nodes on the network.
- the invention is also directed to a communications node for an optical fiber network, with the communications node including a fixed wavelength receiver for receiving optical data at a predetermined wavelength, and a tunable wavelength transmitter for transmitting optical data to destination nodes at a plurality of destination wavelengths.
- a media access controller which creates a reservation map for reserving time slots and wavelengths for transmitting data to the plurality of nodes based upon available time slots and wavelengths in the optical fiber ring.
- the reservation map is based upon demand data from the plurality of nodes.
- the invention is also directed to systems including the various means for performing the methods and implementing the elements discussed above.
- Figure 1A illustrates an optical fiber network having a plurality of nodes
- Figure 1 B illustrates a receiver, tunable laser, and MAC as provided in each node
- Figure 2 illustrates a reservation frame and a time-slot reservation map
- Figure 3 illustrates time slots around an optical fiber ring, and illustrates a collision at the origin
- Figure 4 illustrates time-slots and nodes around the ring
- Figure 5 illustrates a single wavelength path for an optical network
- Figure 6 illustrates a dependent reservation map according to the invention
- Figure 7 illustrates a demand matrix according to the invention
- Figure 8 illustrates a matching bipartite graph addressing allocation
- Figure 9 illustrates an optical fiber ring encountering a fiber cut scenario
- Figure 10 illustrates a single fiber network topology after a fiber cut
- Figure 11 illustrates a daisy-chain multicast example
- Figure 12 illustrates a spanning tree multicast example
- Figure 13 illustrates a hardware implementation of a node according to the invention
- Figure 14 illustrates resource allocation between slave nodes and a master node
- Figure 15 illustrates a method of reserving bandwidth according to an embodiment of the invention.
- Figure 16 illustrates an embodiment of the invention applied to a network switch such as a cross bar switch.
- DETAII ED DESCRIPTION OF THF PREFERRED EMBODIMENT [0029]
- the invention is therefore directed to a system and method for all-optical network, in which nodes are equipped with ultra-fast tunable laser transmitter 11 and a fixed receiver 10, as shown in FIG. 1.
- the invention defines any one of the nodes as a master-node, or origin-node.
- the master-node can be any of the network nodes, and may perform additional tasks such as clock distribution and reservation algorithm execution within MAC 12.
- the all-optical fiber-ring topology enables to establish up to N connections simultaneously, wherein N equals the number of nodes or/and wavelengths.
- a collision free MAC should be used.
- the MAC uses a reservation mechanism, in which a set of connections is predefined for each time-slot. The connection set is defined in a way that collisions do not occur, i.e. two nodes do not transmit in same wavelength at the same time-slot. Generally, a reservation based MAC requires that time-slots will be tagged. This way all nodes will associate the same time-slots with the same reservation.
- the MAC tags time-slots with incremented numbers from 0 to M-1 repeatedly. M continuously time-slots (from 0 to M-1) formed a reservation frame as illustrated in FIG. 2. All time-slots with the same tag number have the same reservation definition.
- the master- node may transmit packets at time-slot number zero to each of the nodes.
- Each node receiving the synchronization packet resets its local modulo M counter. After that, the counter is incremented every time-slot, and nodes can rely on the counter for the current time-slot tag.
- the reservation map includes M time-slot reservations or sets.
- An M x N matrix where M is the reservation frame size and N is the number of nodes/wavelengths, represents the reservation map.
- the columns of the matrix represent the reservation slots, the rows represent the source nodes/wavelengths and the values represent the destination nodes/wavelengths.
- time-slots transmitted to the left merge into time-slots that arrive from the right. Consequently to keep an accurate merge of time-slots at the origin (the master-node location), the ring length must be equal to an integer number of time-slots. If the ring length is not an integer number of time-slots, the tail time-slot overlaps the head time-slot, as illustrated in FIG. 3, which may causes collisions. [0034] In order to keep the time-slots from overlapping, time-slots boundaries may be locked by a single source.
- the master- node can transmits the time-slots clock on a dedicated wavelength.
- the transmitted clock will propagate around the ring and will return to the master-node.
- a locking mechanism at the master-node can set the time-slots duration to eliminate the time-slots overlapping.
- the ring length and the time-slot size can be determined by time-slot clock adjustments. Because the residue divides between all the time-slots on the ring, the adjustment needed equals to the residue divided by the number of time-slots.
- the advantage of the reservation allocation algorithm is that the fiber-ring length needs only to be an integer number of time-slots and not an integer number of reservation frames.
- FIG. 4 illustrates ring 40 with length equal to an integer number of time-slots.
- Transmitted time-slots from the master-node go around the ring and return to the origin, located at master node 0.
- old time-slots merge into the new time-slots.
- X the number of time-slots in the ring modulo M (number of time-slots in a reservation frame). If X equals to zero then the mergers are between time-slots with the same tag, and the same reservation. Therefore, an independent reservation map, in which time-slots reservations are independent of other time-slots reservation, can be used.
- the ring length cannot be constantly set, and thus a synchronization method should be applied to maintain synchronization even if the fiber-ring length changes due to temperature changes and aging.
- M equals to 128 and time-slot duration is 2 microseconds
- the ring's length granularity, and minimum length is 25.6Km. That is why practical systems should rely on a ring length with only an integer number of time- slots requirement. With this requirement the ring's length granularity and minimum length is for example only 400m.
- the dependent reservation map problem can be divided into N different problems. Each problem represents a different wavelength. Moreover, the fact that each wavelength is dropped some where in the ring simplifies the problem. For each destination or different wavelength the source nodes are classified into two collisions groups - the source nodes that their packets cross the origin enroute to the destination and the source nodes that their packets do not cross the origin enroute to the destination.
- FIG. 5 illustrates the path around the ring for a wavelength W2.
- the wavelength W2 is dropped at node 2, and thus the first node that can add it to the ring is node 3.
- the overlapping problems occur only when packets are crossing the origin.
- Examination of the path of W2 shows that time-slot k of node 3 overlaps with time-slot (k+X) modulo M of nodes 0 and 1.
- the dependent reservation map algorithm must not allocate time-slot k to node 3 and time-slot (k+X) modulo M to node 0 or 1. However it can allocate time-slot k to node 3 and 0.
- FIG. 6 shows an example to dependent reservation map for wavelength W2.
- both node 3 and node 1 transmit wavelength W2 and on time-slot 1 node 0 transmits it.
- the cross-filled cells represent time-slots in which transmitting wavelength W2 is not allowed due to allocation constraints.
- FIG. 8 shows a bipartite graph representing the problem for four nodes.
- the left nodes represent the source nodes and the right nodes represent the destination nodes in the two collision groups.
- the collision group and the edges between the nodes are defined according to the demand matrix.
- the maximum matching problem may be solved using, for example, the known HK algorithm ("An n 2'5 algorithm for maximum matching in bipartite graphs", J. E. Hopcroft and R. M. Karp.
- variables and initial conditions for the dependent reservation map can be as follows:
- Nodes identification is from 0 to N-1, starting at the master-node with id #0 and incrementing in the direction of the transmission.
- Reservation frame consist of M continuous time-slots.
- X is the number of time-slots around the ring modulo M. (modulo stands for the residue in integer division and is also marked as " ", i.e. X% is the same as X modulo M).
- the demand matrix marked as D, is NxN matrix which fulfills - a.
- d(s,d) is the demand from node 5 to node d in number of time-slots per reservation frame
- K ⁇ ,...,K M _ ⁇ are constrain groups for the M reservation map time-slots.
- B is the constrained time-slots group.
- E is tle non-constrained time-slots group.
- G(S9 ) T,E) is a bipartite graph with vertex set S JT and edges set ⁇ (if ⁇ i,j) is an edge in E then ieS,jeT or ieT,j ⁇ S).
- s is a set of vertices representing source- nodes ⁇ S 05 Si v-Sj-i), while T is the set representing destination-nodes & collision groups ⁇ T 0fi ,T ⁇ X ,T lfi ,T l ..T N _ l) ,T N _ ⁇ .
- H j) represents the weight of edge ⁇ i ) in E.
- R is the reservation mapNx matrix.
- the dependent reservation map is then constructed according to the following steps: 1. Build a bipartite graph according to the demand matrix and the collision groups.
- step number 2 If there is still an edge in the original graph, which has positive weight, go to step number 2, otherwise end algorithm.
- FIG.13 illustrates one example of a node implementation for an optical network based utilizing a MAC as described above.
- the optical network is built from several nodes connected by an optical fiber ring (FIG.
- Each node in the network has the same implementation, except for different wavelength drop ( ⁇ n).
- One node in the network is defined as master-node.
- the master- node broadcasts the system clock and time-slot synchronization.
- the network synchronization is done using dedicated common wavelength ( ⁇ c) that is received by each node and retransmitted (daisy-chain).
- ⁇ c dedicated common wavelength
- the common wavelength can also be used as a signaling channel between the nodes.
- the node 130 that is illustrated in FIG. 13 is connected to an optical ring using fiber-in input and fiber-out output.
- an optical amplifier 131 in the node entrance can be a low-gain amplifier which is located in each node, or a high-gain amplifier which is located in some but not necessarily all of the nodes.
- the optical signal pass subsequently thru a dual optical-drop element 132 and a wide optical add element 133.
- the dual optical-drop element 132 is used to filter out and drop the node-wavelength and common-wavelength from the passing optical signal.
- the drop element has one optical input (a) and three optical outputs (b, c, d).
- the optical signal includes of multiple wavelengths, comes into input (a) and splits to three optical signals - the node- wavelength which comes out of output (b), the common-wavelength which comes out of output (c), and all the other wavelengths which come out of output (d).
- the wideband optical add element 133 is used to add the transmitted-wavelength and the retransmitted common-wavelength to the optical signal. This element should be a wideband since the transmitted- wavelength can be from a variety of wavelengths.
- the passing optical signal comes into input (a) and combines with the transmitted signal that comes into input (b). The sum of the signals comes out from output (c).
- the synchronization module includes an optical transceiver including receiver 134a and transmitter 134b and synchronization logic block 135.
- the optical receiver 134a receives the dropped common- wavelength, recovers the data and clock, and converts the optical signal to an electrical signal.
- the electrical signal is processed by the synchronization logic 135 which synchronizes on the digital frame and extracts the time-slot synchronization. If the common-wavelength is used also as a signaling channel between the nodes the logic block drops and adds signaling packets, which are processed by CPU 136.
- the dropped node-wavelength comes into an optical burst mode receiver 137.
- the optical burst mode receiver includes of an amplifier, fast-locking CDR (clock data recovery) and a demux element; it extracts the packet from the optical signal and converts it to electrical signal.
- the transmitted packet is transmitted on the scheduled wavelength using an optical tunable transmitter 138.
- the RX-MAC module 139 handles the packets which are extracted by the burst mode receiver.
- the RX-MAC module handles the packets queuing and forwards the packets to the networking layer.
- the TX- MAC 1310 receives packets from the networking layer, handles the packets queuing and forwards the packets to the tunable transmitter according to the reservation map scheduling. In order to improve the BER performance it is possible to combine in the RX-MAC 139 a forward error correction decoder and an encoder in the TX-MAC 1310.
- RX-MAC 139 is connected to memory 139a for appropriate storage and buffering of packets; similarly, TX-MAC 1310 is connected to memory 1310a.
- These memories can be DRAM, SRAM, SDRAM, or any other suitable memory type of a suitable memory size based upon the particular application and network requirements. It should be noted that node 130 can be provided with a remote system clock, or local system clock 1311.
- the main tasks of the CPU 136 are the algorithm tasks of calculating the demand-matrix, creating the reservation map, and handling the system signaling channel.
- Calculating the reservation map can be done using two approaches - centralized and distributed.
- slave-nodes transmit the demand vectors to the master-node.
- the master- node builds from the demand vectors a demand-matrix and calculates an appropriate reservation map.
- the reservation map is then broadcast to the slave-nodes using the common channel.
- each node broadcasts its demand vectors to the other nodes.
- nodes build the demand-matrix from the demand vectors and create an appropriate reservation map locally.
- the centralized method is recommended since the reservation map calculation requires a large- processing power that can effectively be located only in a single node. However, based on available computing power, the distributed approach can be feasible even in large networks.
- FIG. 14 illustrates the negotiation phases between the slave- nodes and the master-node, to compute reservation map in a centralized approach.
- the negotiations in this case, are done in an out-of-band signaling channel, such as the common-wavelength channel.
- the slave-nodes transmit their demand vectors (resource demands for each other destination node) to the master node.
- Two types of demand vectors are transmitted to the master node -
- the committed bandwidth vector specifies the number of time-slots per reservation map the node need for each of its destination nodes.
- the best-effort bandwidth vector specifies the number of time-slots per reservation map the node optimally wants.
- This vector will also specify the priority of the best-effort resource demands; in order to let the master node divides the best-effort bandwidth between all of the network nodes.
- the master node is calculating the reservation map in Phase 2, the algorithm phase. The algorithm will first allocate the committed bandwidth between all the nodes and then will divide the extra bandwidth according to the best- efforts demands and priorities. At the end of this stage the master node will have a new reservation table optimized to the nodes' demands.
- the master node After the master node builds the reservation map it distributes it to the slave node in Phase 3, which is a reservation map distribution phase. The distribution of the reservation map is done via the broadcast channel or thru the in-band channels.
- Phase 4 the global update phase, occurs cyclic every R (R is predefined) reservation frame between time-slot M-1 and time-slot 0.
- R is predefined
- nodes replace the current reservation map with the latest reservation map.
- the global update at the same time- slot assures that time-slots will relate to the same reservation map, and collisions will not take place.
- Node that didn't receive a new reservation map from the last update time will stop transmitting when a new update time is reached. This will avoid a scenario in which the node fails to receive a new reservation map and keeps transmitting according to the old reservation map.
- optical network protection One of the important issues in optical network is the network protection.
- Carrier-class networks are demanded to guarantee "fife-nines" (99.999%) service availability, even if a single failure occurs.
- the most fatal failure in optical ring networks is a fiber cut, as illustrated in FIG. 9. This failure is more critical in all-optical networks since it influences half of the source-destination paths.
- synchronized optical packet ring networks are required to have a protection scheme, which will handle link failures. To achieve that, dual counter- rotating rings should be implemented. This is a known solution from other optical network such as SONET, however in the all-optical network a fiber- cut failure requires a different reconfiguration scheme.
- each node receives a valid data stream from at least one side (west or east) and thus simply selects the valid data stream.
- the two rings become dual unidirectional busses. This new configuration requires a new reservation map; one which will take into accounts that connection to a destination node, might be available only from a single direction. Possible connections between the nodes are lower and dependent on their positions. The two nodes on the edges of the bus suffer a cut of half the original bit rate. This is caused because there is only one direction to which they can receive and transmit data.
- the middle node for example, has still full capacity.
- the new reservation map can be computed using an independent reservation map, which is a faster algorithm. Still, the reconfiguration time (detection time + algorithm execution time) might require more than the 50mSec allowed by SONET. This is why critical services (such as SONET traffic) should be handled differently than non- critical services (such as IP traffic). As can be seen, a single cut doesn't cut-off any node, although it probably lowers its capacity. In order to recover as quickly as possible, critical connections between any two nodes should duplicate on the two separate fibers. In this method, when the connection is cut-off from one direction, the same packets can be taken from the unaffected direction.
- Non-critical connections which are less sensitive to reconfiguration time, are transmitted only on a single ring. This way, up to twice bandwidth can be achieved, time-critical traffic gets to the destination in a timely manner, and non-critical traffic reaches the destination after the new reservation map is configured.
- the node that initiates the multicast transmission transmits the multicast packets directly to the first member of the multicast group.
- the receiving node in its turn, transmits the same packet directly to the next node on the list. Aside from the nodes on the multicast tree, no other nodes are involved.
- the invention may use a spanning-tree multicast (FIG. 12).
- each receiving node duplicates the packet and transmits it to two other nodes in the multicast-group. This causes the multicast delay short form O(N) on the daisy-chain method to 0(Log 2 N) . Nevertheless this method requires additional bandwidth, which increases by bandwidth requirements by a factor of two when compared to the daisy chain method.
- node 6 On the first time-slot node 6 transmits to node 0. On the next time-slot node 6 transmits to node 1 and node 0 transmits to node 4. On the last time-slot node 0 transmit to node 5. This significantly decreases latency to node 5, but can, as discussed above, increase bandwidth requirements due to the fact that node 6 has to transmit the packet twice.
- node 6 would transmit the packet to node 0 in time slot 0, and then node 0 would broadcast the packet to node 1 in the following time slot, and node 1 would then broadcast the packet directly to node 4, which, when received, would broadcast the packet directly to node 5. While requiring less bandwidth, this introduces additional latency to node 5.
- the invention is directed to a reservation-based media access controller which is capable of providing a full reservation optical network.
- the invention is also directed to an optical network which implements the full reservation algorithm, and methods of providing full reservation optical communication utilizing reservation of time-slots and wavelengths.
- Various configurations of an optical network and the nodes thereof can be provided, as discussed herein, and the media access controller can be created based upon a plurality of discrete components configured to form a functioning unit, and can also be formed on a single semiconductor substrate.
- Cross-bar switch 160 has a plurality of ports 161 and 162. The ports can be configured to communicate with each other by using a series of buses and a series of time slots, based upon availability.
- the invention discussed above, including the discussion of the demand matrix and reservation map, is applicable to the reservation of the plurality of buses and the plurality of time slots in a cross-bar switch 160.
Abstract
Description
Claims
Priority Applications (6)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
KR1020047015282A KR100627445B1 (en) | 2002-03-28 | 2003-03-26 | Reservation-based mac and optical network |
IL16416403A IL164164A0 (en) | 2002-03-28 | 2003-03-26 | Reservation-based mac and optical network |
JP2003581389A JP4262607B2 (en) | 2002-03-28 | 2003-03-26 | Reserve-based MAC and optical networks |
EP03745597A EP1488561A4 (en) | 2002-03-28 | 2003-03-26 | Reservation-based mac and optical network |
AU2003225987A AU2003225987A1 (en) | 2002-03-28 | 2003-03-26 | Reservation-based mac and optical network |
IL164164A IL164164A (en) | 2002-03-28 | 2004-09-20 | Reservation-based mac and optical network |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US36778602P | 2002-03-28 | 2002-03-28 | |
US60/367,786 | 2002-03-28 | ||
US10/157,871 US7009991B2 (en) | 2002-03-28 | 2002-05-31 | Reservation-based media access controller and reservation-based optical network |
US10/157,871 | 2002-05-31 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2003084107A1 true WO2003084107A1 (en) | 2003-10-09 |
Family
ID=28456714
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/US2003/009129 WO2003084107A1 (en) | 2002-03-28 | 2003-03-26 | Reservation-based mac and optical network |
Country Status (7)
Country | Link |
---|---|
US (2) | US7009991B2 (en) |
EP (1) | EP1488561A4 (en) |
JP (1) | JP4262607B2 (en) |
KR (1) | KR100627445B1 (en) |
AU (1) | AU2003225987A1 (en) |
IL (2) | IL164164A0 (en) |
WO (1) | WO2003084107A1 (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2006229969A (en) * | 2005-02-18 | 2006-08-31 | Fujitsu Ltd | Optical network system, local node and hub node |
CN101990135A (en) * | 2009-07-30 | 2011-03-23 | 中兴通讯股份有限公司 | Maximum bandwidth constraint-based path query method and device |
Families Citing this family (82)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8296407B2 (en) * | 2003-03-31 | 2012-10-23 | Alcatel Lucent | Calculation, representation, and maintenance of sharing information in mesh networks |
US7689693B2 (en) * | 2003-03-31 | 2010-03-30 | Alcatel-Lucent Usa Inc. | Primary/restoration path calculation in mesh networks based on multiple-cost criteria |
US8867333B2 (en) * | 2003-03-31 | 2014-10-21 | Alcatel Lucent | Restoration path calculation considering shared-risk link groups in mesh networks |
US7646706B2 (en) * | 2003-03-31 | 2010-01-12 | Alcatel-Lucent Usa Inc. | Restoration time in mesh networks |
US7643408B2 (en) * | 2003-03-31 | 2010-01-05 | Alcatel-Lucent Usa Inc. | Restoration time in networks |
US7298716B2 (en) * | 2003-11-06 | 2007-11-20 | Lucent Technologies Inc. | Clustering based load adaptive sleeping protocol for ad hoc networks |
US7653042B2 (en) * | 2004-02-27 | 2010-01-26 | Alcatel-Lucent Usa Inc. | Method of burst scheduling in a communication network |
US7890629B2 (en) * | 2004-03-13 | 2011-02-15 | Adaptive Computing Enterprises, Inc. | System and method of providing reservation masks within a compute environment |
US8782654B2 (en) | 2004-03-13 | 2014-07-15 | Adaptive Computing Enterprises, Inc. | Co-allocating a reservation spanning different compute resources types |
EP1738258A4 (en) | 2004-03-13 | 2009-10-28 | Cluster Resources Inc | System and method for providing object triggers |
CA2559593C (en) | 2004-03-13 | 2013-12-31 | Cluster Resources, Inc. | System and method of co-allocating a reservation spanning different compute resources types |
CA2559603A1 (en) | 2004-03-13 | 2005-09-29 | Cluster Resources, Inc. | System and method for providing advanced reservations in a compute environment |
US8111612B2 (en) * | 2004-04-02 | 2012-02-07 | Alcatel Lucent | Link-based recovery with demand granularity in mesh networks |
US20070266388A1 (en) | 2004-06-18 | 2007-11-15 | Cluster Resources, Inc. | System and method for providing advanced reservations in a compute environment |
US8176490B1 (en) | 2004-08-20 | 2012-05-08 | Adaptive Computing Enterprises, Inc. | System and method of interfacing a workload manager and scheduler with an identity manager |
CA2586763C (en) | 2004-11-08 | 2013-12-17 | Cluster Resources, Inc. | System and method of providing system jobs within a compute environment |
US7356770B1 (en) * | 2004-11-08 | 2008-04-08 | Cluster Resources, Inc. | System and method of graphically managing and monitoring a compute environment |
US8255686B1 (en) * | 2004-12-03 | 2012-08-28 | Hewlett-Packard Development Company, L.P. | Securing sensed data communication over a network |
US7996455B2 (en) | 2005-06-17 | 2011-08-09 | Adaptive Computing Enterprises, Inc. | System and method for providing dynamic roll-back reservations in time |
US8863143B2 (en) | 2006-03-16 | 2014-10-14 | Adaptive Computing Enterprises, Inc. | System and method for managing a hybrid compute environment |
US9231886B2 (en) | 2005-03-16 | 2016-01-05 | Adaptive Computing Enterprises, Inc. | Simple integration of an on-demand compute environment |
EP3203374B1 (en) | 2005-04-07 | 2021-11-24 | III Holdings 12, LLC | On-demand access to compute resources |
EP1715632B1 (en) * | 2005-04-19 | 2008-03-12 | Alcatel Lucent | Method for operating a packet based data network |
US20060251421A1 (en) * | 2005-05-09 | 2006-11-09 | Ben Gurion University Of The Negev, Research And Development Authority | Improved free space optical bus |
US20070058530A1 (en) * | 2005-09-14 | 2007-03-15 | Sbc Knowledge Ventures, L.P. | Apparatus, computer readable medium and method for redundant data stream control |
WO2007033442A1 (en) * | 2005-09-21 | 2007-03-29 | Interuniversitair Microelektronica Centrum (Imec) | System with distributed analogue resources |
US7675899B2 (en) * | 2005-11-30 | 2010-03-09 | Alcatel-Lucent Usa Inc. | Packet-aware transport architecture for enhanced data volume |
US7967682B2 (en) | 2006-04-12 | 2011-06-28 | Bally Gaming, Inc. | Wireless gaming environment |
US7664467B2 (en) * | 2006-06-19 | 2010-02-16 | Alcatel-Lucent Usa Inc. | Method for coordinated control of radio resources for multicasting in a distributed wireless system |
US9101820B2 (en) | 2006-11-09 | 2015-08-11 | Bally Gaming, Inc. | System, method and apparatus to produce decks for and operate games played with playing cards |
US9111078B2 (en) | 2006-11-10 | 2015-08-18 | Bally Gaming, Inc. | Package manager service in gaming system |
US9508218B2 (en) | 2006-11-10 | 2016-11-29 | Bally Gaming, Inc. | Gaming system download network architecture |
US8920233B2 (en) | 2006-11-10 | 2014-12-30 | Bally Gaming, Inc. | Assignment template and assignment bundle in a gaming configuration and download system |
US8930461B2 (en) | 2006-11-13 | 2015-01-06 | Bally Gaming, Inc. | Download and configuration management engine for gaming system |
US9082258B2 (en) | 2006-11-13 | 2015-07-14 | Bally Gaming, Inc. | Method and system for providing download and configuration job progress tracking and display via host user interface |
KR101278774B1 (en) | 2006-12-19 | 2013-06-25 | 주식회사 케이티 | Transmitter initiated bandwidth reservation and release method for real-time traffic in synchronous Ethernet |
JP2010530725A (en) * | 2007-06-18 | 2010-09-09 | インフィネラ コーポレイション | Maintaining correlated virtual data streams over the network |
US8249451B2 (en) * | 2007-08-16 | 2012-08-21 | Futurewei Technologies, Inc. | Methods for characterizing optical switches and multiplexers/demultiplexers |
US8041773B2 (en) | 2007-09-24 | 2011-10-18 | The Research Foundation Of State University Of New York | Automatic clustering for self-organizing grids |
US8920236B2 (en) | 2007-11-02 | 2014-12-30 | Bally Gaming, Inc. | Game related systems, methods, and articles that combine virtual and physical elements |
US8616958B2 (en) | 2007-11-12 | 2013-12-31 | Bally Gaming, Inc. | Discovery method and system for dynamically locating networked gaming components and resources |
WO2009079853A1 (en) * | 2007-12-24 | 2009-07-02 | Zte Corporation | The method and device for protecting the shared channel in the optical transmission system |
WO2009094672A2 (en) * | 2008-01-25 | 2009-07-30 | Trustees Of Columbia University In The City Of New York | Belief propagation for generalized matching |
US20090249350A1 (en) * | 2008-03-31 | 2009-10-01 | John W. Senders | Resource Allocation Through Negotiation |
US9005034B2 (en) | 2008-04-30 | 2015-04-14 | Bally Gaming, Inc. | Systems and methods for out-of-band gaming machine management |
US8856657B2 (en) * | 2008-04-30 | 2014-10-07 | Bally Gaming, Inc. | User interface for managing network download and configuration tasks |
US9483911B2 (en) | 2008-04-30 | 2016-11-01 | Bally Gaming, Inc. | Information distribution in gaming networks |
US9443377B2 (en) | 2008-05-30 | 2016-09-13 | Bally Gaming, Inc. | Web pages for gaming devices |
US8824897B2 (en) * | 2008-06-04 | 2014-09-02 | Accipiter Systems, Inc. | Optical network systems and methods for operating same |
US7852152B2 (en) * | 2008-08-28 | 2010-12-14 | Menara Networks | Nth order tunable low-pass continuous time filter for fiber optic receivers |
US8266213B2 (en) | 2008-11-14 | 2012-09-11 | Bally Gaming, Inc. | Apparatus, method, and system to provide a multiple processor architecture for server-based gaming |
WO2010068840A1 (en) * | 2008-12-12 | 2010-06-17 | The Trustees Of Columbia University In The City Of New York | Machine optimization devices, methods, and systems |
CA2761944A1 (en) | 2009-05-20 | 2010-11-25 | The Trustees Of Columbia University In The City Of New York | Systems devices and methods for estimating |
US20110044166A1 (en) * | 2009-08-18 | 2011-02-24 | Electronics And Telecommunications Research Institute | Method for operating node in ethernet ring network |
US11720290B2 (en) | 2009-10-30 | 2023-08-08 | Iii Holdings 2, Llc | Memcached server functionality in a cluster of data processing nodes |
US10877695B2 (en) | 2009-10-30 | 2020-12-29 | Iii Holdings 2, Llc | Memcached server functionality in a cluster of data processing nodes |
EP2517474B1 (en) * | 2009-12-23 | 2016-03-30 | Telefonaktiebolaget LM Ericsson (publ) | Electrical signal packet routing |
US8509056B1 (en) * | 2010-05-13 | 2013-08-13 | The Directv Group, Inc. | Multi-ring IP multicast network and method using autonomous instances of interior gateway protocol (IGP) |
US9794019B2 (en) * | 2011-04-28 | 2017-10-17 | Hewlett Packard Enterprise Development Lp | Prioritized optical arbitration systems and methods |
US9521041B2 (en) * | 2011-05-10 | 2016-12-13 | Level 3 Communications, Llc | Apparatus, system, and method ordering and provisioning variable bandwidth capacity on a network |
US9058716B2 (en) | 2011-06-06 | 2015-06-16 | Bally Gaming, Inc. | Remote game play in a wireless gaming environment |
US9082082B2 (en) | 2011-12-06 | 2015-07-14 | The Trustees Of Columbia University In The City Of New York | Network information methods devices and systems |
US9120007B2 (en) | 2012-01-18 | 2015-09-01 | Bally Gaming, Inc. | Network gaming architecture, gaming systems, and related methods |
US8974305B2 (en) | 2012-01-18 | 2015-03-10 | Bally Gaming, Inc. | Network gaming architecture, gaming systems, and related methods |
US20130266315A1 (en) * | 2012-04-04 | 2013-10-10 | Accipiter Systems, Inc. | Systems and methods for implementing optical media access control |
WO2013187474A1 (en) * | 2012-06-13 | 2013-12-19 | 日本電信電話株式会社 | Optical network system, optical switch node, master node, and node |
US8902488B2 (en) | 2012-06-28 | 2014-12-02 | Accipiter Systems, Inc. | System architecture for an optical switch using wavelength, fiber and polarizaton addressing |
US8982695B2 (en) * | 2012-09-29 | 2015-03-17 | Intel Corporation | Anti-starvation and bounce-reduction mechanism for a two-dimensional bufferless interconnect |
US9130691B2 (en) * | 2013-02-25 | 2015-09-08 | Verizon Patent And Licensing Inc. | Optical burst switched network nodes |
CN104348551B (en) | 2013-07-23 | 2018-12-28 | 中兴通讯股份有限公司 | A kind of the dynamic bandwidth dispatching method and device of smooth burst mode transmission looped network |
CN104348754B (en) | 2013-07-26 | 2019-08-23 | 中兴通讯股份有限公司 | A kind of bandwidth allocation methods and device of optical burst ring net |
CN104427412B (en) * | 2013-08-20 | 2019-06-18 | 中兴通讯股份有限公司 | A kind of method and device that bandwidth map updates |
CN104468406B (en) * | 2013-09-13 | 2019-10-22 | 中兴通讯股份有限公司 | Across host node method and device for business processing |
CN104702397B (en) * | 2013-12-05 | 2019-07-12 | 中兴通讯股份有限公司 | A kind of OBTN slot length method of adjustment, device and node |
CN105656587B (en) * | 2014-11-12 | 2019-07-30 | 中兴通讯股份有限公司 | A kind of method and apparatus for realizing slot synchronization |
US9854585B2 (en) | 2015-04-30 | 2017-12-26 | Qualcomm Incorporated | Dynamic medium access control switching |
CN105978827A (en) * | 2016-05-09 | 2016-09-28 | 中国联合网络通信集团有限公司 | Wavelength distribution method and device |
US20170346445A1 (en) | 2016-05-31 | 2017-11-30 | Futurewei Technologies, Inc. | Dense Wavelength-Division Multiplexing (DWDM) Network and Method |
CA3025833A1 (en) * | 2016-06-01 | 2017-12-07 | Roshmere, Inc. | An optically-switched data network |
WO2017221878A1 (en) * | 2016-06-20 | 2017-12-28 | 日本電信電話株式会社 | Optical transceiver and control method |
KR20180042631A (en) * | 2016-10-18 | 2018-04-26 | 한국전자통신연구원 | Apparatus and method for processing of photonic frame |
JPWO2022123749A1 (en) * | 2020-12-10 | 2022-06-16 |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5191626A (en) * | 1991-04-22 | 1993-03-02 | The Trustees Of Columbia University In The City Of New York | Optical communications system and method |
US5696903A (en) * | 1993-05-11 | 1997-12-09 | Norand Corporation | Hierarchical communications system using microlink, data rate switching, frequency hopping and vehicular local area networking |
Family Cites Families (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CA2103112A1 (en) * | 1992-11-16 | 1994-05-17 | Toru Nakata | Communication method and communication system |
GB2282018B (en) | 1993-09-14 | 1998-03-18 | Northern Telecom Ltd | Optical communications network |
US5880864A (en) * | 1996-05-30 | 1999-03-09 | Bell Atlantic Network Services, Inc. | Advanced optical fiber communications network |
US6480495B1 (en) * | 1997-04-18 | 2002-11-12 | Nortel Networks Limited | Connectionless communications network |
US6502140B1 (en) * | 1999-01-29 | 2002-12-31 | International Business Machines Corporation | Multicast support for small groups |
US6415312B1 (en) * | 1999-01-29 | 2002-07-02 | International Business Machines Corporation | Reliable multicast for small groups |
US6477288B1 (en) * | 1999-03-15 | 2002-11-05 | The Furukawa Electric Co., Ltd. | Optical line switching system |
US6680912B1 (en) * | 2000-03-03 | 2004-01-20 | Luminous Networks, Inc. | Selecting a routing direction in a communications network using a cost metric |
US6816500B1 (en) * | 2000-07-10 | 2004-11-09 | 3Com Corporation | Apparatus, method and system for multimedia access network channel management |
US6925259B2 (en) * | 2000-10-12 | 2005-08-02 | At&T Corp. | MAC protocol for optical packet-switched ring network |
US7085494B2 (en) * | 2000-10-12 | 2006-08-01 | At & T Corp. | High-capacity packet-switched ring network |
-
2002
- 2002-05-31 US US10/157,871 patent/US7009991B2/en not_active Expired - Fee Related
-
2003
- 2003-03-26 WO PCT/US2003/009129 patent/WO2003084107A1/en active Application Filing
- 2003-03-26 IL IL16416403A patent/IL164164A0/en unknown
- 2003-03-26 KR KR1020047015282A patent/KR100627445B1/en not_active IP Right Cessation
- 2003-03-26 AU AU2003225987A patent/AU2003225987A1/en not_active Abandoned
- 2003-03-26 JP JP2003581389A patent/JP4262607B2/en not_active Expired - Fee Related
- 2003-03-26 EP EP03745597A patent/EP1488561A4/en not_active Withdrawn
- 2003-08-04 US US10/632,835 patent/US7660326B2/en not_active Expired - Fee Related
-
2004
- 2004-09-20 IL IL164164A patent/IL164164A/en not_active IP Right Cessation
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5191626A (en) * | 1991-04-22 | 1993-03-02 | The Trustees Of Columbia University In The City Of New York | Optical communications system and method |
US5696903A (en) * | 1993-05-11 | 1997-12-09 | Norand Corporation | Hierarchical communications system using microlink, data rate switching, frequency hopping and vehicular local area networking |
Non-Patent Citations (5)
Title |
---|
AURA GANZ ET AL.: "A TIME-WAVELENGTH ASSIGNMENT ALGORITHM FOR A WDM STAR NETWORK", ONE WORLD THROUGH COMMUNICATIONS, pages 19920504 |
ELEK V ET AL.: "PHOTONIC SLOT ROUTING: A COST-EFFECTIVE APPROACH TO DESIGNING ALL-OPTICAL ACCESS AND METRO NETWORKS", IEEE COMMUNICATIONS MAGAZINE, IEEE SERVICE CENTER, vol. 39, no. 11, November 2001 (2001-11-01), pages 164 - 171, XP001107821, DOI: doi:10.1109/35.965376 |
PROCEEDINGS OF THE CONFERENCE ON COMPUTER COMMUNICATIONS (INFOCOM, vol. 3, no. 11, January 1992 (1992-01-01), pages 2144 - 2150 |
See also references of EP1488561A4 |
T. GONZALEZ; S. SAHNI: "Open shop scheduling to minimize finish time", JOURNAL FOR THE ASSOCIATION FOR COMPUTING MACHINERY, vol. 23, no. 4, October 1976 (1976-10-01), XP058108051, DOI: doi:10.1145/321978.321985 |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2006229969A (en) * | 2005-02-18 | 2006-08-31 | Fujitsu Ltd | Optical network system, local node and hub node |
CN101990135A (en) * | 2009-07-30 | 2011-03-23 | 中兴通讯股份有限公司 | Maximum bandwidth constraint-based path query method and device |
CN101990135B (en) * | 2009-07-30 | 2013-08-21 | 中兴通讯股份有限公司 | Maximum bandwidth constraint-based path query method and device |
Also Published As
Publication number | Publication date |
---|---|
EP1488561A1 (en) | 2004-12-22 |
US20030185229A1 (en) | 2003-10-02 |
JP4262607B2 (en) | 2009-05-13 |
EP1488561A4 (en) | 2005-09-21 |
US7009991B2 (en) | 2006-03-07 |
US20040037301A1 (en) | 2004-02-26 |
KR20040111439A (en) | 2004-12-31 |
IL164164A0 (en) | 2005-12-18 |
JP2005522090A (en) | 2005-07-21 |
KR100627445B1 (en) | 2006-09-25 |
IL164164A (en) | 2010-05-17 |
US7660326B2 (en) | 2010-02-09 |
AU2003225987A1 (en) | 2003-10-13 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7009991B2 (en) | Reservation-based media access controller and reservation-based optical network | |
US6956824B2 (en) | Extension of link aggregation protocols over the network | |
US8948149B2 (en) | Access node/gateway to access node/gateway layer-2 connectivity (end-to-end) | |
US9887766B2 (en) | Layer-2 extension services | |
US20100265876A1 (en) | Layer-2 connectivity from switch to access node/gateway | |
WO2001045334A1 (en) | Backplane architecture for dynamic synchronous transfer mode | |
WO2005122480A2 (en) | Enabling multipoint services over a ring topology | |
US11368768B2 (en) | Optical network system | |
EP2424186B1 (en) | Dual-computer hot-standby method, device and system | |
US5982747A (en) | Method for managing failures on dynamic synchronous transfer mode dual ring topologies | |
US7512147B2 (en) | Method of reserving network bandwidth resources, and communications system and network device using the same | |
JP2015119227A (en) | Communication system, communication device, and path switching method | |
Cevher et al. | A fault tolerant software defined networking architecture for integrated modular avionics | |
US8243728B2 (en) | Apparatus and method for transmitting packets in a packet switched network | |
US7283552B2 (en) | Method of scheduling bursts of data for transmission in a communication network | |
Bouabdallah et al. | Resolving the fairness issue in bus-based optical access networks | |
Qin et al. | Architecture and analysis for providing virtual private networks (VPN) with QoS over optical WDM networks | |
EP1551131A1 (en) | Method of implementing virtual local area networks on electrical network communication systems | |
US7272315B1 (en) | Technique for transferring information in a passive optical network | |
Qin et al. | QoS for virtual private networks (VPN) over optical WDM networks | |
Salvador et al. | An all-optical WDM packet-switched network architecture with support for group communication | |
Maier et al. | Multicasting in IEEE 802.17 resilient packet ring | |
Papadimitriou et al. | Wavelength-conversion-based protocols for single-hop photonic networks with bursty traffic | |
Schupke | A throughput study of RPR networks subject to single failures |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ OM PH PL PT RO RU SD SE SG SK SL TJ TM TN TR TT TZ UA UG UZ VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 164164 Country of ref document: IL |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2003581389 Country of ref document: JP Ref document number: 1020047015282 Country of ref document: KR |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2003745597 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2418/CHENP/2004 Country of ref document: IN |
|
WWP | Wipo information: published in national office |
Ref document number: 2003745597 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 1020047015282 Country of ref document: KR |