Method of upstream multiple access control in a transmission system

• US 6,031,844 A
• Filed: 09/03/1997
• Issued: 02/29/2000
• Est. Priority Date: 12/24/1996
• Status: Expired due to Term

• Current Assignee: National Science Council
• Original Assignee: National Science Council
• Inventors: Lin, Ying-Dar
• Primary Examiner(s): Horabik, Michael
• Assistant Examiner(s): PHAN, MAN U
• Application Number:
  US08/922,814
• Time in Patent Office: 909 Days
• Field of Search: 370/431, 370/432, 370/437, 370/442, 370/443, 370/444, 370/458, 370/508, 370/461, 370/462, 340/825.5, 340/825.07, 340/825.08
• US Class Current: 370/431
• CPC Class Codes: H04L 12/2801 Broadband local area networks
• CPC Class Codes: H04L 2012/561 Star, e.g. cross-connect, concentrator, subscriber group equipment, remote electronics
• CPC Class Codes: H04L 2012/5679 Arbitration or scheduling
• CPC Class Codes: H04N 21/454 Content or additional data filtering, e.g. blocking advertisements
• CPC Class Codes: H04N 7/173 with two-way working, e.g. subscriber sending a programme selection signal
• CPC Class Codes: H04Q 11/0478 Provisions for broadband connections

Abstract

A method of upstream multiple access control in a transmission system is disclosed. The transmission system includes a headend, a plurality of stations and a tree-and-branch network communicating the stations with the headend, in which the stations transmit information to the headend via upstream channels and the headend transmit information to the stations via downstream channels. The method of the present invention is composed of three mechanisms, namely, station positioning, membership control, and transmission scheduling.

Claims

1. A method of upstream multiple access control in a transmission system, said transmission system comprising a headend, a plurality of stations and a tree-and-branch network communicating said plurality of stations with said headend, in which said plurality of stations transmit information to said headend via upstream channels and said headend transmit information to said plurality of stations via downstream channels, said method comprising carrying out the following steps a) and b) for every several cycles and carrying out the following step c) for every cycle in said headend associated with said plurality of stations:

a) updating on-line stations in said plurality of stations, and optionally balancing loads in all the upstream channels;

b) positioning said on-line stations according to transmission delays between said on-line stations and said headend and in an ascending order; and

c) scheduling a transmission starting time and a transmission duration for each station of said on-line stations, which comprises calculations based on number of requested transmission cells and priority levels of the requested transmission cells provided bv each of said on-line station to said headend at the end of its preceding transmission duration, and said transmission delay, said transmission duration calculated in accordance with the following formula;

##EQU3## wherein i is the i^th on-line station according to transmission delays between said on-line stations and said headend and in an ascending order;

t_i is the transmission duration for the i^th on-line station;

b_i is a requested number of best-effort transmission cells of the i^th on-line station;

G_i is a requested number of guaranteed transmission cells of the i^th on-line station;

g_i is a minimum number of guaranteed transmission cells of the i^th on-line station;

α

_i is urgency of guaranteed transmission cells of the i^th on-line station;

β

_i is urgency of best-effort transmission cells of the i^th on-line station;

CBT is the number of slots within a transmission cycle; and

W_i is a guard-band time overhead of the i^th on-line station.

3. The method according to claim 1, wherein said updating on-line stations in said plurality of stations in step a) comprises issuing an invitation frame from said headend to stations which are not on-line, and starting a tree walk algorithm between said headend and said not-on-line stations are not on-line which intend to be on-line.

2. A method of upstream multiple access control in a transmission system, said transmission system comprising a headend, a plurality of stations and a tree-and-branch network communicating said plurality of stations with said headend, in which said plurality of stations transmit information to said headend via upstream channels and said headend transmit information to said plurality of stations via downstream channels, said method comprising carrying out the following steps a) and b) for every several cycles and carrying out the following step c) for every cycle in said headend associated with said plurality of stations:

a) updating on-line stations in said plurality of stations, and optionally balancing loads in all the upstream channels;

b) positioning said on-line stations according to transmission delays between said on-line stations and said headend and in an ascending order; and

c) scheduling a transmission starting time and a transmission duration for each station of said on-line stations, which comprises calculations based on number of requested transmission cells and priority levels of the requested transmission cells provided by each of said on-line station to said headend at the end of its preceding transmission duration, and said transmission delay, said transmission duration calculated in accordance with the following formula;

space="preserve" listing-type="equation">s.sub.i =Σ

.sub.j=1.sup.i-1 t.sub.j -τ

.sub.i

wherein

i is the i^th on-line station according to transmission delays between said on-line stations and said headend and in an ascending order;

j is an integer of 1 to i-1

S_i is the transmission starting time of the i^th on-line station;

t_j is the transmission duration for the j^th on-line station; and

τ

_i is the transmission delay of the i^th on-line station.

5. The method according to claim 2, wherein said updating on-line stations in said plurality of stations in step a) comprises issuing an invitation frame from said headend to stations which are not on-line, and starting a tree walk algorithm between said headend and said not-on-line stations are not on-line which intend to be on-line.

4. A method of upstream multiple access control in a transmission system, said transmission system comprising a headend, a plurality of stations and a tree-and-branch network communicating said plurality of stations with said headend, in which said plurality of stations transmit information to said headend via upstream channels and said headend transmit information to said plurality of stations via downstream channels, said method comprising carrying out the following steps a) and b) for every several cycles and carrying out the following step c) for every cycle in said headend associated with said plurality of stations:

a) updating on-line stations in said plurality of stations, and optionally balancing loads in all the upstream channels;

b) positioning said on-line stations according to transmission delays between said on-line stations and said headend and in an ascending order; and

c) scheduling a transmission starting time and a transmission duration for each station of said on-line stations, which comprises calculations based on number of requested transmission cells and priority levels of the requested transmission cells provided by each of said on-line station to said headend at the end of its preceding transmission duration, and said transmission delay wherein said positioning said on-line stations according to transmission delays between said on-line stations and said headend and in an ascending order in step b) comprises sending a position frame from said headend to each station of said on-line stations, which starts a timer for each transmitted position frame;

upon receiving said position frame said each station modifying a special field thereof and throwing back the position frame to said headend immediately; and

, computing a distance from said headend to said each station based on a difference of times when the position frame is sent from and thrown back to said headend.

6. The method according to claim 4, wherein said updating on-line stations in said plurality of stations in step a) comprises issuing an invitation frame from said headend to stations which are not on-line, and starting a tree walk algorithm between said headend and said not-on-line stations are not on-line which intend to be on-line.