WO1999011025A1 - Method of sharing communication channels utilizing both contention and polling schemes - Google Patents
Method of sharing communication channels utilizing both contention and polling schemes Download PDFInfo
- Publication number
- WO1999011025A1 WO1999011025A1 PCT/US1998/002084 US9802084W WO9911025A1 WO 1999011025 A1 WO1999011025 A1 WO 1999011025A1 US 9802084 W US9802084 W US 9802084W WO 9911025 A1 WO9911025 A1 WO 9911025A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- channels
- upstream
- channel
- polling
- data
- Prior art date
Links
Classifications
-
- 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/2801—Broadband local area networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/40—Network security protocols
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
- H04L67/62—Establishing a time schedule for servicing the requests
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
- H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
- H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
- H04L69/329—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the application layer [OSI layer 7]
Definitions
- This invention relates to a method of sub-channelizing a broadband medium and assigning predefined protocols to respective subchannels thereof. More particularly, it relates to a method for sharing sub-channels based on the nature of the data to be transferred in a multi-channel communication network.
- the cable modems then contend for access to a single upstream channel. If messages of more than one modem collide with one another, a binary search method implemented in a media access controller arbitrates between and isolates colliding modems. However, only one upstream channel is available for the colliding modems to communicate upstream back to the controller. Thus, all modems assigned to a particular upstream channel must not only contend for channel access to respond to the downstream broadcast poll, but any subsequent data transmission must also contend for the same single upstream channel. This leads to congestion and lower performance.
- U.S. Patent No. 4,829,297 discloses a communication method wherein the same polling technique is used in two channels. While this increases performance only because it provides two upstream paths rather than just one, it fails to segregate busy users from inactive or idle users.
- U.S. Patent No. 4,754,426 teaches the prioritized polling technique of placing a higher priority on some users, and thus polling those higher priority users more frequently. However, all upstream communications remain on a single channel. Thus, the performance of the higher priority users is increased, but at the expense of the non-high priority users.
- the present invention exploits the beneficial aspects of both contention and polling protocols by employing dynamic allocation of upstream channels to move users of a network between diverse channels utilizing different protocols selected to maximize data transfer based on the instantaneous transmission status of the user. For instance, non-responding users (e.g., user equipment that is powered down) are assigned to a first group of channels utilizing a contention-only protocol in the upstream direction. After detection by a media access controller, the status of responding and active users are reclassified to use a second group of channels utilizing a polling protocol that is maximized for low latency, e.g., a limited-1 polling scheme.
- non-responding users e.g., user equipment that is powered down
- a media access controller After detection by a media access controller, the status of responding and active users are reclassified to use a second group of channels utilizing a polling protocol that is maximized for low latency, e.g., a limited-1 polling scheme.
- the media access controller is capable of switching the users' upstream channels dynamically and intelligently on a packet-by-packet basis. Rules based on activity level of the user are implemented to determine when the user is to switch between channel groups.
- the user can transmit on any of a plurality of upstream channels or sub-channels, utilizing either a contention-based protocol, or any of a plurality of polling-based protocols, on a per-packet basis.
- Contention based algorithms work well when there are a large number of subscribers but only a few of them are active at any time (i.e. in light traffic), while polling based algorithms work well in heavy traffic.
- the present invention utilizes the efficiencies of both protocols. First, by initially assigning non-responding users (e.g. powered-down users) to a channel chosen at random out of the group of contention mode channels. Once it becomes active, the user is moved to a first level polling mode channel selected from a first group of polling mode channels operating with a polling protocol that is maximized for low latency. Then, as necessary, the user is moved again to a higher level polling mode channel selected from a second group of polling mode channels operating with a polling protocol that is maximized for maximum throughput.
- non-responding users e.g. powered-down users
- Additional levels of polling mode channel groups blending a mix of low latency and maximum throughput, e.g., greater than limited-1 type polling, although adding to the complexity of the overall protocol, can add further efficiencies to the communication system. Ranging and synchronization between the media access controller and the users are not necessary according to the present invention because of the use of contention mode and polling mode channels.
- the present invention makes intelligent use of an expanded number of smaller bandwidth channels formed from a smaller number of larger bandwidth channels. It is found that there is a greater likelihood of having a larger number of usable smaller bandwidth upstream channels than there is of having an equivalent amount of usable larger bandwidth upstream channels due largely to the noise characteristics in the upstream path of a cable TV facility.
- Commonly assigned U.S. Patent Application Nos. 08/702,932 and 08/735,1 10 disclose the sub- channelization of a communication channel and are explicitly incorporated herein by reference.
- Fig. 1 shows a network including a controller (e.g., a TV facility head end) and a plurality of users (e.g., cable modems);
- a controller e.g., a TV facility head end
- a plurality of users e.g., cable modems
- Fig. 2 shows a user activity model for FTP and WWW type applications requiring high throughput for optimized performance
- Fig. 3 shows a user activity model for Telnet and Rlogin type applications requiring low latency for optimized performance
- Fig. 4 shows a grouping of available upstream channels into three groups based on an operating protocol
- Fig. 5 shows the calculation of delay between a user which is closest to the host computer or controller and a user which is farthest from the host computer or controller
- Fig. 6 shows downstream polling (e.g., 'credit' messages) from the controller to each of three users, and the response thereto (e.g., 'done' messages) sent in a selected polling mode upstream channel currently assigned to all three users;
- Fig. 7 is a diagram of a controller state machine
- Figs. 7A to 7D(3) are flow charts showing procedures implemented at various states of the controller state machine in the exemplary embodiment of the present invention
- Fig. 8 is a diagram of a user state machine
- Figs. 8A to 8D are flow chart showing procedures implemented at various states of the user state machine in the exemplary embodiment of the present invention.
- Fig. 1 shows a network including a host computer or controller 100 and a plurality of users 101-104 according to the present invention.
- the network may encompass virtually any medium, wired or wireless.
- the host computer or controller 100 may be, as in the exemplary embodiment, a TV facility head end, and the users 101-104 may be cable modems installed in subscribers homes.
- Fig. 2 shows Type I file transfer applications such as FTP, WWW, SMTP and NNTP
- Fig. 3 shows Type II file transfer applications such as Telnet and Rlogin.
- Users operating Type I applications are busy communicating, they cycle through alternate periods of bursting and processing. The sizes of the bursts are typically on the order of several thousand bytes of data. For maximum throughput and performance, Type I applications should conclude their bursts as quickly as possible.
- users operating Type II applications are busy, they generate relatively small packets on the order of a few bytes each, but on a more continuous basis as compared to Type I applications.
- a packet of only byte is generated each time the user types a character on his terminal, and is displayed only after it has been echoed back by the receiver.
- Type II applications are desirous of viewing typed characters as quickly as possible, and thus round trip latency must be minimized.
- Type I applications There is a conflicting interest between the needs of Type I applications and the needs of Type II applications.
- the performance for Type I applications is optimized only at the expense of performance for Type II applications.
- conventional systems utilizing a single channel and a single protocol, i.e., contention or polling balance the needs of Type I applications against the needs of Type II applications.
- the present invention does not balance the needs of Type I applications against the needs of Type li applications. Instead, it optimizes both the needs of Type I applications and the needs of Type II applications by providing separate communication channels for each type application.
- the present invention satisfies both the need for high throughput by Type I applications and the need for low latency by Type II applications by allowing each user to communicate with the controller via distinct channels or sub-channels operating with different protocols.
- Some applications alternate between Type I and Type II during the course of a session.
- FTP file transfer using file transfer protocol
- Type II application is typically preceded by several small messages that set up the FTP control connection (i.e., Type I application).
- Telnet user i.e., Type II user
- a Telnet user may be scrolling through several screens of data (i.e., Type I communications).
- applications alternate between communications which require rapid throughput and those which require low latency
- conventional systems typically classify the application as either a Type I application or a Type II application.
- the present invention classifies applications dynamically as either Type I or Type II based on their current traffic.
- TDMA time-division multiple access
- MAC medium access channel
- the protocol of the exemplary embodiment of the present invention differs from contention-only communication protocols in several respects.
- each user is provided with access to any one of a plurality of upstream channels or sub-channels operating under different protocols, based on characteristics ofthe data.
- assignment ofthe users to particular channels may be based on other rules established to provide the users with desired performance.
- Initial data is transmitted on one upstream channel in response to a broadcast polling message utilizing a contention protocol in a channel designated for contention mode communications. After the user is detected as active, subsequent data is transmitted utilizing a polling protocol in a polling mode channel. It is desirable to avoid any sustained data transfers in the contention mode channel. It is found that this provides a more deterministic performance for users.
- a head end controller at a cable TV facility communicates with a plurality of cable modems in subscribers homes (i.e., users).
- a plurality of upstream channels are formed within the bandwidth ofthe communication path between the user and the controller, e.g., a cable.
- the number of upstream channels from the cable modems to the head end controller is maximized.
- Sub-channels can be formed from the channels by frequency division or by time division to provide additional communication channels for use by the present invention.
- the channels and subchannels can be of equal bandwidth, or can be of differing bandwidth.
- a 6 MHz TV channel is frequency divided into three 2 MHz channels, although the 6 MHz TV channel could instead be divided into only two 3 MHz channels, six 1 MHz channels, or even unequal bandwidth channels such as one 2 MHz channel and four 1 MHz channel.
- a plurality of 6 MHz TV channels are subdivided to provide one common group of communication channels to be used by various contention and polling mode protocols.
- the available upstream channels are classified into particular protocol groups, e.g., Group A, B or C.
- Group A channels handle communications utilizing a contention protocol and thus operate as contention mode channels.
- Group B channels handle shorter length 'bursty' communications utilizing a limited type polling protocol and thus operate as limited polling mode channels.
- Group C channels handle longer length communications utilizing an exhaustive type polling protocol and thus operate as exhaustive polling mode channels.
- the use of a contention mode channel in Group A is restricted to initial communications from the user to the controller common to activation procedures.
- a newly active user is one which has not transmitted data for a period of time, e.g., within the previous five minutes. Of course, this length of time can vary depending upon the application.
- the user initially selects one of the available Group A contention mode channels at random, and contends for that channel using a contention protocol.
- the initial contention mode communication is received by the controller, the user's upstream path is reassigned to a limited polling mode channel in Group B.
- subsequent data e.g., subsequent packets, are transmitted on a channel different from that over which the initial contention mode communications occurred.
- A are not utilized for significant data transfers, but instead for the detection by the controller of the activation of users.
- a relatively large number of idle users can be supported on only one or a few contention mode upstream channels without any significant degradation of service.
- assigning users among the polling mode channels it is not best to allocate all Type I users in one group of channels and all Type II users in the other group of channels. Because of their bursty nature, only a fraction of the total allocated Type I users are actively transferring data at any one time, while the remaining Type I users are in-between bursts. Instead, it is desirable to keep only Type I users which are currently bursting together, while the remaining Type I users can be assigned to share the same group with Type II users.
- N (M/R)T
- N the average number of simultaneously bursting users
- M the number of active Type I users in the system
- R the average rate of transactions generated by an active Type I user (once every R seconds)
- T the average time in seconds burst time it takes for a Type I transaction to complete.
- Fig. 4 shows sub-channel assignment and allocation according to one embodiment of the present invention.
- K channels are assigned for detecting activity in idle users or cable modems utilizing contention mode protocols, and thus is classified as a Group A contention mode channel.
- I channels are assigned for polling, non-bursting, but active users or cable modems and thus is classified as a Group B polling mode channel.
- J channels are assigned for polling bursting modems and thus is classified as a Group C polling mode channel.
- One contention protocol suitable for use in the contention mode channel of the present invention utilizes a Binary Exponential Back-off based scheme. Simulations have shown that a Binary Exponential Back-off scheme provides adequate performance for a typical number of users (e.g., 1000) in a multiple user communication system, e.g., multiple cable modem subscribers served by a cable TV facility's headend. However, as the number of users utilizing the contention mode channel increases, transmission collisions occur more frequently and thus transmission delays increase and performance decreases. Thus, according the present invention performance is increased by dynamically moving transmissions from users between differently classified upstream channels, preferably on a packet-by- packet basis.
- Fig. 5 shows the minimum upstream packet size for a contention mode channel.
- I is the size of the downstream CREDIT packet
- L is the size of the upstream data packet
- C(d) is the capacity of the downstream link
- C(u) is the capacity ofthe upstream link
- PD M , N is the delay from the headend to the nearest modem
- PD MAX is the delay from the headend to the farthest modem.
- the first bit from the farthest modem arrives at time T2 equal to:
- a controller e.g., a headend in a cable TV facility broadcasts a polling CREDIT message to all users desiring to transmit packet information (e.g. all cable modems). Users that are in the contention mode and have a packet to transmit do so on a contention mode channel when they receive the CREDIT message.
- packet information e.g. all cable modems.
- Any collision between a plurality of users collide then the collision is detected at the controller, and the colliding users are informed of the collision in the next broadcast (polling) CREDIT message sent by the controller in the contention mode channel. Colliding users then undergo a simple binary-exponential back-off, and re-transmit the collided message after a random number of transmit opportunities. If there are multiple upstream contention mode channels available, e.g., Group A channels, then the user chooses one of the multiple upstream contention mode channels at random for each transmission of a packet of data.
- multiple upstream contention mode channels available, e.g., Group A channels
- contention mode channel there are effectively two sources of randomness that help reduce collisions in the contention mode channels: a first due to the existence of a plurality of contention mode channels, and the second due to the binary-exponential back-off scheme.
- a user with a packet of data to send monitors the primary contention mode channel for the broadcast poll. Upon detection of the broadcast poll, the user transmits the number of CREDITED packets on a Group A channel chosen at random.
- Each user utilizes a simple Ethernet style binary back-off scheme.
- the controller periodically transmits a broadcast poll message on the downstream contention mode channel, with a period TIME1 equal to the maximum delay for the farthest modem to respond to the poll.
- the controller informs the users about the collision/no collision results from the previous broadcast polling cycle, e.g., by including a COLLISION bit in the CREDIT message. If a collision occurred, the user calculates a back-off window of size , where i is a random integer in the range [0,2 ], and I is the number of collisions which have occurred.
- Fig. 5 shows the calculation of delay between a user which is closest to the host computer or controller and a user which is farthest from the host computer or controller. The maximum delay is based on the amount of time necessary to send a poll (e.g., a credit message) to the farthest modem, and to receive a response (e.g., a done message) therefrom.
- a poll e.g., a credit message
- a response e.g., a done message
- Fig. 6 shows downstream polling (e.g., 'credit' messages) from the controller to each of three users, and the responses (e.g., 'done' messages) therefrom.
- the polling messages are performed in the single downstream channel, while the response messages are sent in the currently assigned upstream channel, e.g., Group B or Group C channels.
- the preferred polling algorithm should combine the benefits of high throughput for Type I users such as is provided by exhaustive polling, together with low delay for Type II users such as is provided by Limited-1 polling.
- the channels serving Type I users would utilize a limited type Polling, while the channels serving Type II users would utilize exhaustive type polling.
- a limited-n polling scheme such as a limited-1 polling scheme, provides good service for Type II users, but at the cost of throttling back bursty Type I users. This problem is intractable for the single channel case.
- a plurality of channels as in the present invention it is found that good service can be provided to both Type I and Type II users by intelligently segregating busy Type I and Type II users into different channels.
- the controller is capable of polling the users assigned to upstream polling mode channels, e.g., Groups A and B, and the user receiving the poll transmits a packet of data.
- upstream polling mode channels e.g., Groups A and B
- the controller resumes polling the users in the polling mode channels.
- the available polling mode channels are classified as either a Group B or Group C type polling mode channel.
- an idle user When an idle user first becomes busy and has one or more packets of data to transmit, it is moved from a Group A contention mode channel to a Group B polling mode channel. If a user is assigned to a Group B polling mode channel for more than a predetermined amount of time, e.g., one minute, without transmitting any data, then it is at that time reassigned to utilize a Group A contention mode upstream channel for its next transmission.
- a user in Group A When a user in Group A first becomes active and is otherwise qualified to move to a Group B polling mode channel, it is left in that Group A contention mode channel and utilizes a polling protocol therein if the total number of users in the Group B polling mode channel is greater than twice N B , where
- CreditDoneCycleTime and LAT B is the target average latency in the Group B polling mode channel.
- the user is reassigned to a Group B polling mode channel when space becomes available and if the user has any remaining packets of data to transmit. If more than a predetermined number of packets of data (e.g., three or more) are queued for transmission to the controller from a user assigned to a Group B polling mode channel at the time of receiving a poll from the controller in the Group A contention mode channel (i.e., a burst is detected), then the user is first moved to a Group C polling mode channel for transmission of the burst of packets.
- a predetermined number of packets of data e.g., three or more
- F is equal to or greater than a predetermined number, e.g., two, where
- a user assigned to a Group C polling mode channel is reassigned to a
- Group B polling mode channel if: (1) the user has not sent data in a last predetermined period of time, e.g., 100 milliseconds; or (2) the user has spent more than a predetermined amount of time, e.g., ten seconds, assigned to a Group C polling mode channel.
- Fig. 7 shows the state machine of the controller 100.
- the controller state machine Upon start-up of the controller software at start 200, the controller state machine enters an endless loop or wait state 202. From the wait state 202, the controller 100 enters one of four alternate states 204-210. The first alternate state is entered on a periodic basis upon the expiration of a first interrupt timer, TIMER 2 to allow the users to transmit on a contention channel Group A. In the exemplary embodiment, the users choose from among the Group A channels at random.
- TIMER 2 the controller
- step 204 transmits a broadcast poll in step 204 enabling a contention-based transmission from all users currently assigned to a contention mode upstream channel, i.e., Group A.
- the process flow of step 204 is shown in more detail in Fig. 7A.
- the controller 100 broadcasts a contention grant message to the users on the downstream channel in step 300. Afterwards, the contention 0 status of all Group A channels is reset in step 302, and interrupt timer TIMER 2 is set for a desirable period of time for generating the next contention grant message in step 304
- the second alternate state 206 is entered into upon notice of the detection of a collision.
- the processes of step 206 are shown in Fig. 7B. 5
- step 206 after a collision is detected, the ID of the channel on which the collision occurred is obtained in step 400, and a collision detect flag is set in step 402.
- the third alternate state is entered upon the arrival of a data packet in shown in step 210 and Fig. 7C.
- the controller determines if the data 0 packet was received on a polling channel (i.e., Groups A or B). If not, processing continues. However, the data packet is forwarded to a local area network (LAN) or other network if the data packet was received on a polling channel in step 402. Similarly, the controller 100 determines if the data packet was instead received on a contention channel (i.e., Group A). If not, then the procedures of step 210 are 5 completed.
- a polling channel i.e., Groups A or B
- LAN local area network
- the controller 100 determines if the data packet was instead received on a contention channel (i.e., Group A). If not, then the procedures of step 210 are 5 completed.
- a collision status flag for the Group A contention channel is cleared in step 406
- the user is re-assigned to a Group B channel for the transmission in step 408, and that user is then polled on a polling channel in step 410.
- the controller 100 then forwards the data packet onto a LAN in step 412.
- Figs. 7D(1) to 7D(3) show the procedures carried out in step 208.
- Fig. 7D(1 ) relates particularly to processes with respect to users in Group B
- Fig. 7D(2) relates particularly to processes with respect to users in Group C
- Fig. 7D(3) relates to users in both Groups B and C.
- step 500 of Fig. 7D(1) the controller 100 determines if the user to whom the dedicated poll is being sent is currently assigned to transmit upstream on a Group B channel. If not, the processes of Fig. 7D(1) are bypassed. If so, then the controller 100 determines if the user is to transmit data in response to the poll from the controller 100 in step 502.
- step 502 the controller 100 determines if the user transmitted data during the current poll. If so, step 504 determines if the number of packets exceeds a predetermined threshold, and if space is available in Group C. If the result of step 504 is positive, the user is placed in a wait list for Group C in step 508. If not, the user is placed in a wait list for Group B in step 506. If the user did not transmit data during the current poll as determined in step 502, step 510 determines whether or not the user has been inactive for more than a predetermined timeout period TIMEOUT2. If the timeout period TIMEOUT2 has been exceeded, step 514 places the user in Group A, and step 516 sends a message to the user from the controller to change to contention mode.
- TIMEOUT2 timeout period
- Fig. 7D(1) are continued in Fig. 7D(3) at point 518.
- Fig. 7D(2) relates to the processes for users in Group C.
- step 600 if the user is in Group C, the processes shown in step 7D(2) are executed. If not, the controller continues on to the steps shown in Fig. 7D(3).
- Step 602 determines if the user has been inactive for a period of time greater than a predetermined TIMEOUT1. If so, the controller determines whether the user is in a polled state in step 604, or in a dedicated state in step 608. If the user is in a polled state, the user is placed in a wait list for Group B in step 606. If the user is in a dedicated state as determined in step 608, then the user is placed in a polled state in step 610. If, on the other hand, the user has not been inactive for a period of time greater than TIMEOUT1 , then it is similarly determined if the user is in a polled state (step 612) or in a dedicated state (step 616).
- the user is placed in a wait list for Group C in step 614. If the user is in a dedicated state as determined in step 616, then the user is placed in a dedicated state in step 618 if the number of users in Group C is less than a predetermined threshold, i.e., a maximum number of dedicated users in Group C. Also, the user is placed in a polled state in step 620 if the number of users in Group C is greater than the predetermined threshold.
- a predetermined threshold i.e., a maximum number of dedicated users in Group C.
- step 700 shown in Fig. 7D(3) the user is removed from a polling state and put on a wait list for Group B or C. Then, in step 702, while the wait list for Group C is non-empty, steps 704 and 706 are performed.
- step 704 the user at the top of the wait list for Group C is polled.
- step 706 the user is placed in a dedicated mode if the number of users in Group C is less than the number of channels in Group C.
- step 708 while the wait list for Group B is non- empty the user at the top of the wait list for Group B is polled in step 710.
- the controller 100 then reaches the end 712 and re-enters wait state 202.
- the user state machine is shown in Fig. 8.
- the user passes through start 812 and enters an endless loop or wait state 810.
- step 800 shown in more detail in Fig. 8A is entered.
- steps 802 and 804 are performed, as shown in more detail in Figs. 8B and 8C, respectively.
- step 806 shown in more detail in Fig. 8D is performed.
- Step 800 which is performed upon the arrival of a data packet, is shown in Fig. 8A.
- a packet is inserted into the upstream transmit queue, and in sub-step 902, the packet is transmitted if the user is in a dedicated state.
- step 802 shown in more detail in Fig. 8B, the user is placed in a dedicated state in sub-step 910 if the user's number of credits indicates a dedicated state for that user. If the user's number of credits indicates polling in sub-step 912, then the user is taken out of the dedicated state, and placed into either a polling or contention mode.
- sub-step 914 queued packets are transmitted if the user is in a polling state and credits are available to that user.
- sub-step 916 if no credits are available, or if the packet queue is empty, then a done message is transmitted.
- sub-step 918 if the user is in contention mode (i.e., in Group A), and if the packet queue is not empty, then the user transmits on a contention channel chosen at random.
- the contention backoff limit is set to a default value, e.g., two, in sub-step
- step 804 the user determines if the transmission was successfully received in sub-step 940. If so, step 804 is completed. If not, then the backoff limit is increased, e.g., doubled, in sub-step 942, and the user re-transmits in sub-step 944.
- Step 806 which is entered upon completion of an upstream transmission from the userto the controller 100, is shown in Fig. 8D.
- sub-step 950 a contention channel out of those available in Group A is chosen at random. The user then transmits on the chosen Group A channel in sub-step 952.
- the number of packets queued at the modem is computed, then acknowledgment suppression is accomplished. For example, if there are three packets which are suppressed into one packet, and two additional data packets, then the number of queued packets is reported to the controller 100 as five, resulting in 0 three packets being transmitted.
- a cable modem system is used as an exemplary embodiment.
- the choice of parameters in the exemplary embodiment was based on the following 5 assumptions:
- the last throughput requirement is included in this list for the following reason: It may happen that a bursting modem may not be able to move into Group
- RTD from the server at the headend and back is about 175 ms. It is concluded that a bursting user in Group B can sustain a throughput of 350 Kbytes/s with 150 ms maximum latency. For Group C, the minimum RTD is 25 ms (for the case of a dedicated channel) and the maximum RTD is 75 ms. It is concluded that the corresponding throughputs that can be achieved in a 10 second interval are 750 Kbytes/s and 600
- K 1 (one channel in Group A) is sufficient to provide adequate performance for up to 500 cable modems communicating with a controller.
- the value of I depends on two factors: the total number of simultaneously active subscribers M, and the target latency for Type II applications.
- J The main constraint on the value of J is that it be large enough to accommodate the simultaneously bursting users. If it is not large enough, then some of the bursting users will be forced to wait in Group B, which will decrease their throughput. Downstream file transfers typically require less than 1 second to complete once they gain access to Group C. Assuming an average user transfers a file every 20 seconds, the number of simultaneously bursting users B is given according to Little's Law by:
- the activity threshold T_ON is defined as the minimum number of packets queued at the user at the time at which the user is polled, causing the movement of the user to Group C.
- the parameters for Group C are chosen such that it is preferred that only Type I applications make use of the channels in Group C.
- T_ON 3 in the exemplary embodiment.
- the parameter TIMEOUT1 is defined as the period of time for which a user holds a dedicated channel in Group C without transmitting data, after which it gives up the channel and is reassigned to Group B.
- TheTIMEOUTI parameter is used to remove inactive users from Group C, for the case in which Group C is lightly loaded, so that each user gets its own dedicated channel.
- the value of TIMEOUT1 should be small enough such that unwanted Type II applications are quickly detected and removed from Group C.
- the parameter TIMEOUT2 is the amount of time a user in Group B may be idle or inactive before it is moved or reassigned to Group A.
- the invention is applicable not only to the transmission of data over TV channels, but to the transmission of packet data over any means, e.g., the Internet, RF, microwave, satellite, etc.
- the invention is equally applicable to the transmission of data over TV channels in utilizing any of the various TV standards utilized around the world.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Small-Scale Networks (AREA)
Abstract
Description
Claims
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
IL13134298A IL131342A0 (en) | 1997-02-10 | 1998-02-06 | Method of sharing communication channels utilizing both contention and polling schemes |
EP98904891A EP0963639A1 (en) | 1997-02-10 | 1998-02-06 | Method of sharing communication channels utilizing both contention and polling schemes |
CA002280822A CA2280822A1 (en) | 1997-08-27 | 1998-02-06 | Method of sharing communication channels utilizing both contention and polling schemes |
AU62656/98A AU750824B2 (en) | 1997-02-10 | 1998-02-06 | Method of sharing communication channels utilizing both contention and polling schemes |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US08/917,735 | 1997-08-27 | ||
US08/917,735 US6275497B1 (en) | 1997-02-10 | 1997-08-27 | Method and apparatus for controlling communication channels using contention and polling schemes |
Publications (2)
Publication Number | Publication Date |
---|---|
WO1999011025A1 true WO1999011025A1 (en) | 1999-03-04 |
WO1999011025A9 WO1999011025A9 (en) | 1999-11-18 |
Family
ID=25439249
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/US1998/002084 WO1999011025A1 (en) | 1997-02-10 | 1998-02-06 | Method of sharing communication channels utilizing both contention and polling schemes |
Country Status (3)
Country | Link |
---|---|
US (1) | US6275497B1 (en) |
CA (1) | CA2280822A1 (en) |
WO (1) | WO1999011025A1 (en) |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6480505B1 (en) | 1999-12-06 | 2002-11-12 | Telefonaktiebolaget Lm Ericsson (Publ) | Batched fair exhaustive polling scheduler |
US6535498B1 (en) | 1999-12-06 | 2003-03-18 | Telefonaktiebolaget Lm Ericsson (Publ) | Route updating in ad-hoc networks |
US6704293B1 (en) | 1999-12-06 | 2004-03-09 | Telefonaktiebolaget Lm Ericsson (Publ) | Broadcast as a triggering mechanism for route discovery in ad-hoc networks |
US6751200B1 (en) | 1999-12-06 | 2004-06-15 | Telefonaktiebolaget Lm Ericsson (Publ) | Route discovery based piconet forming |
US6975613B1 (en) | 1999-12-06 | 2005-12-13 | Telefonaktiebolaget L M Ericsson (Publ) | System and method for scheduling communication sessions in an ad-hoc network |
Families Citing this family (56)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO1998005144A1 (en) * | 1996-07-25 | 1998-02-05 | Hybrid Networks, Inc. | High-speed internet access system |
US6128653A (en) * | 1997-03-17 | 2000-10-03 | Microsoft Corporation | Method and apparatus for communication media commands and media data using the HTTP protocol |
GB2332602B (en) * | 1997-12-22 | 2000-03-08 | Lsi Logic Corp | Improvements relating to multidirectional communication systems |
US6434559B1 (en) * | 1998-10-09 | 2002-08-13 | Xpandable Technology, Inc. | Critical resource management |
US6374111B1 (en) * | 1999-03-12 | 2002-04-16 | Telefonaktiebolaget Lm Ericsson (Publ) | System and method for robust automatic cell retune |
US20090219879A1 (en) | 1999-05-21 | 2009-09-03 | Wi-Lan, Inc. | Method and apparatus for bandwidth request/grant protocols in a wireless communication system |
US6925068B1 (en) | 1999-05-21 | 2005-08-02 | Wi-Lan, Inc. | Method and apparatus for allocating bandwidth in a wireless communication system |
US8462810B2 (en) | 1999-05-21 | 2013-06-11 | Wi-Lan, Inc. | Method and system for adaptively obtaining bandwidth allocation requests |
US7006530B2 (en) | 2000-12-22 | 2006-02-28 | Wi-Lan, Inc. | Method and system for adaptively obtaining bandwidth allocation requests |
US7720468B1 (en) | 1999-06-23 | 2010-05-18 | Clearwire Legacy Llc | Polling methods for use in a wireless communication system |
US20020095498A1 (en) * | 2000-06-05 | 2002-07-18 | Accordion Networks | Network architecture for multi-client units |
US7024469B1 (en) * | 2000-08-28 | 2006-04-04 | Avaya Technology Corp. | Medium access control (MAC) protocol with seamless polling/contention modes |
US7113494B1 (en) * | 2000-10-17 | 2006-09-26 | Sprint Communications Company L.P. | Broadband wireless communications using multiple contention channels |
WO2002033901A2 (en) * | 2000-10-17 | 2002-04-25 | Sprint Communications Company, L.P. | Performance management system |
US7127519B2 (en) * | 2001-05-03 | 2006-10-24 | Lucent Technologies Inc. | Back off methods and systems |
US7197096B2 (en) * | 2001-06-08 | 2007-03-27 | Broadcom Corporation | Compensation of reference frequency drift in system requiring critical upstream timing |
US7433971B2 (en) * | 2001-11-16 | 2008-10-07 | Intel Corporation | Interface and related methods for dynamic channelization in an ethernet architecture |
US7286557B2 (en) * | 2001-11-16 | 2007-10-23 | Intel Corporation | Interface and related methods for rate pacing in an ethernet architecture |
JP2003169058A (en) * | 2001-11-30 | 2003-06-13 | Fujitsu Ltd | Line switching system, server and terminal device of local area network |
US7305357B2 (en) * | 2002-01-24 | 2007-12-04 | Shaw Cablesystems, G.P. | Method and system for providing and controlling delivery of content on-demand over a cable television network and a data network |
US7272149B2 (en) | 2002-08-19 | 2007-09-18 | World Wide Packets, Inc. | Bandwidth allocation systems and methods |
US7277389B2 (en) * | 2002-08-29 | 2007-10-02 | World Wide Packets, Inc. | Systems and methods for grouping of bandwidth allocations |
US20040054763A1 (en) * | 2002-09-12 | 2004-03-18 | Teh Jin Teik | Method for minimizing connection time for data synchronization |
US9325998B2 (en) * | 2003-09-30 | 2016-04-26 | Sharp Laboratories Of America, Inc. | Wireless video transmission system |
US8018850B2 (en) * | 2004-02-23 | 2011-09-13 | Sharp Laboratories Of America, Inc. | Wireless video transmission system |
US7439152B2 (en) * | 2004-08-27 | 2008-10-21 | Micron Technology, Inc. | Methods of forming a plurality of capacitors |
US20060072602A1 (en) * | 2004-10-05 | 2006-04-06 | Cisco Technology, Inc. | Method and apparatus for least congested channel scan for wireless access points |
US7797723B2 (en) * | 2004-10-30 | 2010-09-14 | Sharp Laboratories Of America, Inc. | Packet scheduling for video transmission with sender queue control |
US7784076B2 (en) * | 2004-10-30 | 2010-08-24 | Sharp Laboratories Of America, Inc. | Sender-side bandwidth estimation for video transmission with receiver packet buffer |
US8356327B2 (en) | 2004-10-30 | 2013-01-15 | Sharp Laboratories Of America, Inc. | Wireless video transmission system |
JP5118637B2 (en) * | 2005-07-14 | 2013-01-16 | ボストン−パワー,インコーポレイテッド | Control electronics for Li-ion batteries |
US8316225B2 (en) * | 2005-07-28 | 2012-11-20 | The Boeing Company | Automated integration of fault reporting |
JP4779788B2 (en) * | 2005-08-29 | 2011-09-28 | カシオ計算機株式会社 | Program recording apparatus, mobile receiving apparatus, and data management method |
GB0517843D0 (en) * | 2005-09-02 | 2005-10-12 | Pace Micro Tech Plc | Flexible data partitioning in systems using wideband channel bonding modems |
US20070067480A1 (en) * | 2005-09-19 | 2007-03-22 | Sharp Laboratories Of America, Inc. | Adaptive media playout by server media processing for robust streaming |
US7580382B1 (en) * | 2005-09-27 | 2009-08-25 | Rockwell Collins, Inc. | System and method for distributed channelized group formation in a mobile wireless communication network |
US9544602B2 (en) * | 2005-12-30 | 2017-01-10 | Sharp Laboratories Of America, Inc. | Wireless video transmission system |
GB2434717B (en) * | 2006-01-26 | 2008-04-30 | Toshiba Res Europ Ltd | Wireless communications apparatus |
US7652994B2 (en) * | 2006-03-31 | 2010-01-26 | Sharp Laboratories Of America, Inc. | Accelerated media coding for robust low-delay video streaming over time-varying and bandwidth limited channels |
JP2007296796A (en) * | 2006-05-02 | 2007-11-15 | Konica Minolta Business Technologies Inc | Image forming apparatus, image forming method, and image forming program |
US8326927B2 (en) * | 2006-05-23 | 2012-12-04 | Cisco Technology, Inc. | Method and apparatus for inviting non-rich media endpoints to join a conference sidebar session |
TWI426678B (en) * | 2006-06-28 | 2014-02-11 | Boston Power Inc | Electronics with multiple charge rate, battery packs, methods of charging a lithium ion charge storage power supply in an electronic device and portable computers |
US8526336B2 (en) * | 2006-08-09 | 2013-09-03 | Cisco Technology, Inc. | Conference resource allocation and dynamic reallocation |
US8861597B2 (en) * | 2006-09-18 | 2014-10-14 | Sharp Laboratories Of America, Inc. | Distributed channel time allocation for video streaming over wireless networks |
KR101353632B1 (en) | 2006-09-20 | 2014-01-20 | 엘지전자 주식회사 | EDCA Communication system, Station and Access point therefor and Communication method thereof |
US8630239B2 (en) * | 2006-09-20 | 2014-01-14 | Lg Electronics Inc. | Station and access point for EDCA communication, system thereof and communication method thereof |
US7652993B2 (en) * | 2006-11-03 | 2010-01-26 | Sharp Laboratories Of America, Inc. | Multi-stream pro-active rate adaptation for robust video transmission |
US20100108291A1 (en) * | 2008-09-12 | 2010-05-06 | Boston-Power, Inc. | Method and apparatus for embedded battery cells and thermal management |
EP2211586B1 (en) | 2009-01-27 | 2011-09-21 | Fluidmesh Networks, LLC | Automatic selection of a MAC protocol for a communication system |
US20100289457A1 (en) * | 2009-05-18 | 2010-11-18 | Boston-Power, Inc. | Energy efficient and fast charge modes of a rechargeable battery |
EP2474058A4 (en) * | 2009-09-01 | 2014-11-12 | Boston Power Inc | Large scale battery systems and method of assembly |
US9117054B2 (en) | 2012-12-21 | 2015-08-25 | Websense, Inc. | Method and aparatus for presence based resource management |
US9361116B2 (en) | 2012-12-28 | 2016-06-07 | Intel Corporation | Apparatus and method for low-latency invocation of accelerators |
US10140129B2 (en) | 2012-12-28 | 2018-11-27 | Intel Corporation | Processing core having shared front end unit |
US9417873B2 (en) | 2012-12-28 | 2016-08-16 | Intel Corporation | Apparatus and method for a hybrid latency-throughput processor |
US10346195B2 (en) | 2012-12-29 | 2019-07-09 | Intel Corporation | Apparatus and method for invocation of a multi threaded accelerator |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4887265A (en) * | 1988-03-18 | 1989-12-12 | Motorola, Inc. | Packet-switched cellular telephone system |
US5563883A (en) * | 1994-07-18 | 1996-10-08 | Cheng; Alexander L. | Dynamic channel management and signalling method and apparatus |
US5651009A (en) * | 1995-05-02 | 1997-07-22 | Motorola, Inc. | System and method for hybrid contention/polling protocol collision resolution using a depth first search technique |
Family Cites Families (29)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4667193A (en) | 1983-12-13 | 1987-05-19 | Honeywell, Inc. | Addressing system for simultaneously polling plural remote stations |
US4754426A (en) | 1984-05-31 | 1988-06-28 | American Television & Communications Corporation | System for controlling communications on a cable television network |
US4829297A (en) | 1987-05-08 | 1989-05-09 | Allen-Bradley Company, Inc. | Communication network polling technique |
US4928177A (en) | 1988-04-11 | 1990-05-22 | Cooper Industries, Inc. | Two-way data broadcast networks |
US5012469A (en) * | 1988-07-29 | 1991-04-30 | Karamvir Sardana | Adaptive hybrid multiple access protocols |
US5483676A (en) | 1988-08-04 | 1996-01-09 | Norand Corporation | Mobile radio data communication system and method |
US5070536A (en) | 1988-08-04 | 1991-12-03 | Norand Corporation | Mobile radio data communication system and method |
US5673252A (en) * | 1990-02-15 | 1997-09-30 | Itron, Inc. | Communications protocol for remote data generating stations |
US5130983A (en) * | 1990-03-27 | 1992-07-14 | Heffner Iii Horace W | Method of polling to determine service needs and the like |
US5361091A (en) * | 1990-09-28 | 1994-11-01 | Inteletext Systems, Inc. | Interactive home information system for distributing video picture information to television viewers over a fiber optic telephone system |
JPH0738612B2 (en) | 1992-03-18 | 1995-04-26 | 日本電気株式会社 | Control device in satellite communication system |
US5347515A (en) | 1992-03-27 | 1994-09-13 | Pittway Corporation | Method and apparatus for global polling having contention-based address identification |
US5355375A (en) | 1993-03-18 | 1994-10-11 | Network Systems Corporation | Hub controller for providing deterministic access to CSMA local area network |
US5581555A (en) * | 1993-09-17 | 1996-12-03 | Scientific-Atlanta, Inc. | Reverse path allocation and contention resolution scheme for a broadband communications system |
NZ329739A (en) | 1993-11-01 | 2000-02-28 | Ericsson Telefon Ab L M | Cellular communication method using partial echo values during arq mode transmission |
US5534941A (en) | 1994-05-20 | 1996-07-09 | Encore Media Corporation | System for dynamic real-time television channel expansion |
CA2158588C (en) * | 1994-09-21 | 2003-01-14 | Belwinder Singh Barn | Multiple channel terminal server communications network |
US5572517A (en) * | 1995-02-28 | 1996-11-05 | General Instrument Corporation | Configurable hybrid medium access control for cable metropolitan area networks |
US5648958A (en) * | 1995-04-05 | 1997-07-15 | Gte Laboratories Incorporated | System and method for controlling access to a shared channel for cell transmission in shared media networks |
US5586121A (en) * | 1995-04-21 | 1996-12-17 | Hybrid Networks, Inc. | Asymmetric hybrid access system and method |
US6006017A (en) * | 1995-05-02 | 1999-12-21 | Motorola Inc. | System for determining the frequency of repetitions of polling active stations relative to the polling of inactive stations |
US5805586A (en) * | 1995-05-02 | 1998-09-08 | Motorola Inc. | Method, device and data communication system for multilink polling |
US5684802A (en) * | 1995-05-02 | 1997-11-04 | Motorola, Inc. | System and method for hybrid contention/polling protocol collison resolution used backoff timers with polling |
US5793307A (en) * | 1995-05-05 | 1998-08-11 | Motorola, Inc. | Method and apparatus for a hybrid limited contention and polling protocol |
US5615212A (en) * | 1995-09-11 | 1997-03-25 | Motorola Inc. | Method, device and router for providing a contention-based reservation mechanism within a mini-slotted dynamic entry polling slot supporting multiple service classes |
EP0818899A1 (en) * | 1996-07-09 | 1998-01-14 | Alcatel Bell N.V. | Log-in method for a telecommunication network, main station and terminal station adapted to perform the method |
US5956338A (en) * | 1996-07-09 | 1999-09-21 | Ericsson, Inc. | Protocol for broadband data communication over a shared medium |
US5926476A (en) * | 1996-07-09 | 1999-07-20 | Ericsson, Inc. | Network architecture for broadband data communication over a shared medium |
US5909444A (en) * | 1996-12-16 | 1999-06-01 | Motorola, Inc. | System, device, and method for aggregating users in a shared-medium network |
-
1997
- 1997-08-27 US US08/917,735 patent/US6275497B1/en not_active Expired - Fee Related
-
1998
- 1998-02-06 WO PCT/US1998/002084 patent/WO1999011025A1/en active IP Right Grant
- 1998-02-06 CA CA002280822A patent/CA2280822A1/en not_active Abandoned
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4887265A (en) * | 1988-03-18 | 1989-12-12 | Motorola, Inc. | Packet-switched cellular telephone system |
US5563883A (en) * | 1994-07-18 | 1996-10-08 | Cheng; Alexander L. | Dynamic channel management and signalling method and apparatus |
US5651009A (en) * | 1995-05-02 | 1997-07-22 | Motorola, Inc. | System and method for hybrid contention/polling protocol collision resolution using a depth first search technique |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6480505B1 (en) | 1999-12-06 | 2002-11-12 | Telefonaktiebolaget Lm Ericsson (Publ) | Batched fair exhaustive polling scheduler |
US6535498B1 (en) | 1999-12-06 | 2003-03-18 | Telefonaktiebolaget Lm Ericsson (Publ) | Route updating in ad-hoc networks |
US6704293B1 (en) | 1999-12-06 | 2004-03-09 | Telefonaktiebolaget Lm Ericsson (Publ) | Broadcast as a triggering mechanism for route discovery in ad-hoc networks |
US6751200B1 (en) | 1999-12-06 | 2004-06-15 | Telefonaktiebolaget Lm Ericsson (Publ) | Route discovery based piconet forming |
US6975613B1 (en) | 1999-12-06 | 2005-12-13 | Telefonaktiebolaget L M Ericsson (Publ) | System and method for scheduling communication sessions in an ad-hoc network |
Also Published As
Publication number | Publication date |
---|---|
WO1999011025A9 (en) | 1999-11-18 |
US6275497B1 (en) | 2001-08-14 |
CA2280822A1 (en) | 1999-03-04 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6275497B1 (en) | Method and apparatus for controlling communication channels using contention and polling schemes | |
EP1255376B1 (en) | Near optimal fairness back off method and system | |
US7206319B2 (en) | Fixed collision rate back off methods and systems | |
KR100746017B1 (en) | Methods and apparatus for random backoff based access priority in a communications system | |
US6349210B1 (en) | Method and apparatus for broadcasting messages in channel reservation communication systems | |
US6049549A (en) | Adaptive media control | |
US5935218A (en) | Method and apparatus for bus network prioritization using the broadcast of delay time to lower priority users from high priority users in a token or loop network | |
EP1109356A2 (en) | Collision-free multiple access reservation scheme for burst communications using a plurality of frequency tones | |
KR20000034996A (en) | Methods and apparatus for retransmission based access priority in a communications system | |
US5721735A (en) | Method and apparatus for arbitrating access of plural bidding devices to a central device using a goal index | |
US20060114919A1 (en) | Reservation/retry media access control | |
EP1021891A1 (en) | Medium access control protocol for data communications | |
US20040156350A1 (en) | Hybrid polling/contention MAC layer with multiple grades of service | |
JP2022542460A (en) | RTA queue management in wireless local area network (WLAN) stations | |
AU720470B2 (en) | System, device, and method for providing low access delay for time-sensitive applications in a shared medium network | |
US6801537B1 (en) | Adaptive contention algorithm based on truncated binary exponential back-off | |
AU750824B2 (en) | Method of sharing communication channels utilizing both contention and polling schemes | |
KR20050009863A (en) | Method of multimedia data transmssion in wireless network | |
Malarvizhi et al. | A near optimum MAC protocol based on the incremental collision resolution multiple access protocol for CDMA based communications system | |
Kwon et al. | Improving transport layer performance by using a novel medium access control protocol with fast collision resolution in wireless lans | |
Malarvizhi et al. | Performance Analysis of Collision |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 131342 Country of ref document: IL |
|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AU CA IL JP KR |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): AT BE CH DE DK ES FI FR GB GR IE IT LU MC NL PT SE |
|
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
ENP | Entry into the national phase |
Ref document number: 2280822 Country of ref document: CA Ref country code: CA Ref document number: 2280822 Kind code of ref document: A Format of ref document f/p: F |
|
WWE | Wipo information: entry into national phase |
Ref document number: 62656/98 Country of ref document: AU |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1998904891 Country of ref document: EP |
|
AK | Designated states |
Kind code of ref document: C2 Designated state(s): AU CA IL JP KR |
|
AL | Designated countries for regional patents |
Kind code of ref document: C2 Designated state(s): AT BE CH DE DK ES FI FR GB GR IE IT LU MC NL PT SE |
|
COP | Corrected version of pamphlet |
Free format text: REQUEST FOR RECTIFICATION UNDER RULE 91.1 (F), ADDED, 3 PAGES |
|
WWP | Wipo information: published in national office |
Ref document number: 1998904891 Country of ref document: EP |
|
NENP | Non-entry into the national phase |
Ref country code: KR |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: 1998904891 Country of ref document: EP |
|
WWG | Wipo information: grant in national office |
Ref document number: 62656/98 Country of ref document: AU |