Reservation/retry media access control

• US 20060114919A1
• Filed: 11/15/2005
• Published: 06/01/2006
• Est. Priority Date: 07/20/2000
• Status: Abandoned Application

• Current Assignee: Raymond Bontempi
• Original Assignee: Raymond Bontempi
• Inventors: Bontempi, Raymond
• Application Number:
  US11/274,069
• Publication Number:
  US 20060114919A1
• Time in Patent Office: Days
• US Class Current: 370/408
• CPC Class Codes: H04H 60/97 using uplink of the CATV systems
• CPC Class Codes: H04N 21/437 Interfacing the upstream path of the transmission network, e.g. for transmitting client requests to a VOD server flow control in data networks H04L47/10; streaming protocols, e.g. RTP or RTCP, H04L65/65; scheduling or organising the servicing of application requests in data packet switching networks H04L67/60
• CPC Class Codes: H04N 21/6118 involving cable transmission, e.g. using a cable modem
• CPC Class Codes: H04N 7/17309 Transmission or handling of upstream communications

Abstract

All upstream messages that are desired to be sent from one of a plurality of settop terminals sharing a common upstream channel are segmented into data packets through an adaptation layer before sending into the upstream channel by a settop terminal, using the present invention using a hybrid of contention and reservation methodologies. If the upstream message is lengthy, a user settop terminal can request and gain exclusive control over the upstream channel and transmit the message using a reservation and self-acknowledging mechanism. In accordance with the present invention, a combination reservation mechanism and calculation method to optimize random backoff time for upstream transmission is added to conventional contention based Media Access Control methods and this embodiment to substantially enhance performance.

Claims

1-20. -20. (canceled)

21. A method for transmitting a first message on an upstream channel of a network from a terminal comprising:

determining a size of the first message;

comparing the size of the first message with a threshold size;

transmitting a second message if the first message is determined to be above the threshold size;

waiting for a period of time; and

transmitting the first message after the period of time has expired.

22. The method of claim 21 further comprising:

transmitting, substantially immediately, the first message if the first message is determined to be below or equal to the certain size instead of transmitting the second message;

waiting for the period of time and transmitting the first message after the period of time has expired.

23. The method of claim 21 further comprising:

retrieving a stored number of terminals in the network; and

using the stored number of terminals in the network to set the period of time.

24. A method of determining how many terminals are in a network comprising:

entering the network by a first terminal;

receiving a first message indicating a first number of terminals in the network just prior to the first terminal entering the network;

adding one to the first number of terminals to generate a second number of terminals; and

transmitting a second message from the first terminal that includes the second number of terminals.

25. The method of claim 24 further comprising:

storing the second number of terminals.

26. The method of claim 25 further comprising:

receiving a third message indicating a second terminal is leaving the network;

subtracting one from the stored second number of terminals to generate a third number of terminals; and

transmitting a fourth message from the first terminal that includes the third number of terminals.