CN1262008A - System device and method for providing low access delay for time-sensitive applications in a shared medium network - Google Patents

System device and method for providing low access delay for time-sensitive applications in a shared medium network Download PDF

Info

Publication number
CN1262008A
CN1262008A CN98806655A CN98806655A CN1262008A CN 1262008 A CN1262008 A CN 1262008A CN 98806655 A CN98806655 A CN 98806655A CN 98806655 A CN98806655 A CN 98806655A CN 1262008 A CN1262008 A CN 1262008A
Authority
CN
China
Prior art keywords
mac
mac user
user
priority
poll
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN98806655A
Other languages
Chinese (zh)
Inventor
克里世南·拉马克里世南
迈克尔·W·帕特里克
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Motorola Solutions Inc
Original Assignee
Motorola Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Motorola Inc filed Critical Motorola Inc
Publication of CN1262008A publication Critical patent/CN1262008A/en
Pending legal-status Critical Current

Links

Images

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/40—Bus networks
    • H04L12/403—Bus networks with centralised control, e.g. polling
    • 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/40—Bus networks
    • H04L12/403—Bus networks with centralised control, e.g. polling
    • H04L12/4035—Bus networks with centralised control, e.g. polling in which slots of a TDMA packet structure are assigned based on a contention resolution carried out at a master unit
    • 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/40—Bus networks
    • H04L12/40143—Bus networks involving priority mechanisms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/64—Hybrid switching systems
    • H04L12/6418—Hybrid transport
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/64—Hybrid switching systems
    • H04L12/6418—Hybrid transport
    • H04L2012/6421—Medium of transmission, e.g. fibre, cable, radio, satellite
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/64—Hybrid switching systems
    • H04L12/6418—Hybrid transport
    • H04L2012/6424—Access arrangements
    • H04L2012/6427—Subscriber Access Module; Concentrator; Group equipment
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/64—Hybrid switching systems
    • H04L12/6418—Hybrid transport
    • H04L2012/6445—Admission control
    • H04L2012/6448—Medium Access Control [MAC]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/64—Hybrid switching systems
    • H04L12/6418—Hybrid transport
    • H04L2012/6464—Priority

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Small-Scale Networks (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

A system, device, and method for providing low access delay for time-sensitive applications in a shared medium network segregates MAC Users into a high-priority group and a low-priority group. Where the MAC User priorities are not known a priori, the MAC User priorities are inferred from the size of the data packets transmitted by the MAC Users. MAC Users transmitting small packets are placed in the high-priority group, while MAC Users transmitting large packets are placed in the low-priority group. The headend unit first polls all of the high-priority MAC Users, and then polls low-priority MAC Users until either all low-priority MAC Users have been polled or the low-priority MAC Users have been serviced for a predetermined maximum polling time. The headend unit repeats this polling sequence in sequential polling cycles to provide the high-priority MAC Users with expedited access to the shared channel.

Description

In shared-media network, the application of time-sensitive is provided system, the apparatus and method of low access delay
Background of invention
TECHNICAL FIELD OF THE INVENTION
Generally, the present invention relates to communication system, more specifically, relate to the multiple access protocol that on common share communication medium, uses.
Description of related art
In the current information age, exist the needs growing, and this high-speed communication is that the communication user of growing quantity is given security the service (QoS) of quality for prerequisite to high-speed communication.For this reason, various communication networks and technology have been developed, to satisfy the present and following demand.Specifically, developing various new networks, these networks are realized the terminal use of bigger quantity and are being developed the variety of protocol of the additional bandwidth that utilizes these networks efficiently.
A kind of technology that will be used more and more in the future is a shared-media network.Shared-media network is a single communication channel (shared channel) by a plurality of terminal use institute share technique, makes that the difference from the different terminals user sends and can not disturb mutually.In various modern broadband communication networks, general shared communication channel is by one of several frequency ranges of a shared physical media transmission, all (HFC) networks of hybrid fiber/coaxial in this way of these shared physical medias or the electromagnetic wave in free space.Because general various communication network has limited number of communication channels, shared-media network allows many terminal uses to be able to access network by the single communication channel, therefore makes all the other each communication channels will be used to other purposes.But, only to work as each terminal use and all send data off and on, and during quiescent period, allow other user to send, shared-media network is only practicable.
In shared-media network, to shared channel, this interface unit allows the terminal use to send and receive through shared channel to each terminal use by means of access interface unit (AIU) interface.Single AIU can support one or more terminal uses.Wish to utilize each terminal use of this shared channel to share according to medium access control (MAC) agreement, this agreement provides one group of rules and procedures that are used to insert shared channel.For convenience, each sharer in the MAC agreement is called as a MAC user.
Fig. 1 is the logical relation according to the known shared-media network 100 of prior art.Represented as Fig. 1, headend unit 110 is connected to a plurality of AIU 120 through shared channel 130 aTo 120 n(total AIU that is called as s120).In the preferred embodiment, shared channel 130 is by one of a plurality of communication channels of the shared physical medium transmission such as HFC or wireless network.In other embodiments, shared physical medium can be coaxial cable, optical cable, twisted-pair feeder or the like and can also comprise air, atmosphere, or be used for wireless and space satellite communication.Headend unit 110 also is connected to communication network 140, and this network can also comprise such as internet, various in line service, phone and various cable system and other communication system.
Continuation is with reference to Fig. 1, and in the preferred embodiment, the shared physical medium such as HFC or wireless network has or supports a plurality of communication channels.Easy in order to reference, the headend unit in communication channel such as headend unit 110 is used for transmission information, signal or other data to such as AIU 120 nAnd so on the channel of AIU be called as the downing code flow channel.Also easy in order to reference, in communication channel such as AIU 120 nAnd so on AIU be used for transmission information, signal or other data and be called as up code stream channel to the channel of the headend unit such as headend unit 110.Certainly, these various up code streams may be identical physical channels with the downing code flow channel or may be other physical channel of branch, for example, and by the channel of time division multiplexing or frequency division multiplexing.Except up code stream and downing code flow direction, these various channels also may logically be divided otherwise.In a preferred embodiment, communication medium is a hfc plant, the up code stream channel of the downing code flow channel of general using 50-750MHz (reaching as high as 1GHz) frequency spectrum (frequency range) and general using 5-42MHz frequency spectrum.
In a kind of simple mode of exemplary hfc plant, the information that headend unit is utilized single downing code flow channel to send and comprised polling message is used to send information to headend unit to each MAC user and single up code stream channel by MAC user.Because headend unit is the device that only sends at the downing code flow channel, the downing code flow channel is not " shared channel " that defines according to the present invention.But because a plurality of MAC user sends on this up code stream channel, up code stream channel is a shared channel, and comes access channel in order with the MAC agreement, makes to obtain maximum data throughput by this channel.
Developed multiple different access technology for the user.Generally, these technology can be classified as: uncontested technology, and this technology is avoided conflict on shared channel by means of the various methods of presetting; With the competition technology is arranged, this technology does not avoid conflict, and replaces to eliminate any conflict appear on the shared channel.With being arranged, contention protocols compares with the uncontested agreement the cyclic polling agreement such as time division multiplexing (TDMA), general is inefficient under light load, because no matter whether MAC user has information to send, general uncontested agreement all will distribute the bandwidth of some to give each MAC user.On the other hand, those MAC users that have contention protocols only to distribute the bandwidth information of giving to send, though when requiring to manage conflict, some bandwidth has been wasted.Developed and utilized hybrid protocol uncontested and that have competition to insert, to attempt to obtain the advantage of two kinds of technology.
In many multiple access protocols, utilize some form of cyclic polling.In the cyclic polling technology, keep a MAC subscriber's meter and the MAC user on this table by order poll singly, provide each MAC user on shared channel, to send the chance of data.In direct cyclic polling, the chance that is linked into shared channel that each MAC user is provided equates no matter this MAC user is still " not positive " (that is, often not having data to send) of " positive " (that is, producing data) regularly.
Some cyclic polling agreement is attempted by the frequency that has data to send according to MAC user, each MAC user is divided into effectiveness and the efficient of improving poll in the difference tabulation.Generally " positive " MAC user is placed in " fast poll " table, and carried out poll with relative high frequency, and general " non-positive " MAC user is placed in " poll at a slow speed " table, and is carried out poll by relative low frequency.A kind of alternative method keeps " recently positive ", and MAC user (promptly, " not positive " but the MAC user of " actively " not long ago once recently) table, this MAC user is lower than the MAC user's frequency by quick polling list polling table, carries out poll but be higher than by the MAC user's of polling list polling table frequency at a slow speed.By by with have the frequency poll MAC user that the possibility that sends data is complementary, can improve bandwidth efficiency.
Hybrid protocol readvances step and utilize and to have competition to insert to substitute " not positive " MAC user's cyclic polling.Provide with other " not positive " MAC user for " not positive " MAC user and compete the chance that is linked in the shared channel.In this method, the independent polling message that does not have " not positive " the MAC user that data send is not wasted.
Utilize a problem of cyclic polling to be, each the MAC user on each polling list polling table is seen as to have equal priority and has been provided the access chance to shared channel that equates, even each MAC user has different priority.For example, " positive " the MAC user with time-sensitive data of a high priority by with " positive " with insensitive data of time of a low priority in a like fashion with the polled family of identical frequency.In this case, may be delayed from the MAC user's data of high priority, and be sent out from the data of low priority user.Obviously, only according to availability of data grouping MAC user and be not suitable for solving the problem of MAC user's transmission being carried out priority rating.Priori about the MAC User Priority can make polling sequence consider MAC user's priority.But general MAC User Priority is when MAC user enters system and do not know, and because MAC user serves by network insertion is different, priority may change along with the time.Therefore, still exist the time-sensitive in shared-media network is provided by the system of low access delay, the demand of apparatus and method of providing.
The accompanying drawing summary
In the accompanying drawings,
Fig. 1 is the block diagram of the known shared-media network of prior art;
Fig. 2 is used to handle the logical flow chart that up code stream pulse train sends; With
Fig. 3 is the logical flow chart for a polling cycle.
Describe in detail
As mentioned above, still exist in the system of the low access delay that is provided for the time-sensitive application in the shared-media network, the demand of apparatus and method.The present invention divides into groups each MAC user for high priority bank and low priority group by headend unit, and this low access delay is provided.This headend unit is all high-priority MAC users of poll and poll low priority MAC user then at first, finishes or the serviced predetermined maximum poll time of low priority MAC user until all low priority MAC users are polled.This headend unit repeats this polling sequence in each polling cycle of order, be provided to the rapid access of shared channel for each high-priority MAC user.
In order to make headend unit divide into groups each MAC user for high priority bank and low priority group, headend unit must be able to be determined each MAC user's relative priority level.In some network, MAC user's priority can know in advance, for example, and configuration by the network manager or the regulation by the service type in ATM or other network.In other network, MAC user's priority is ignorant in advance, and in fact, because the terminal use by the network insertion different application, may change in time.In the network that the MAC User Priority can not clearly be known, headend unit must be determined MAC user's priority by other measure.
In the preferred embodiment, MAC user's priority is in advance ignorant and replaces to be that characteristic from the up code stream that this MAC user produces sends is inferred out.Headend unit monitors this MAC user's transmission and according to the size such as pulse train/packet that is sent by this MAC user, be included in the type of the packet of MAC user's transmission, the application that MAC user will visit and to those skilled in the art will be obvious some other parameters any one and so on the predefined parameter setting, determine this MAC user's delay requirement.Headend unit can utilize one or more parameters to determine MAC user's relative priority level, and can use different parameter settings to each MAC user.
In the preferred embodiment, MAC user's priority is only to infer from the size of the data set that sent by MAC user.Have been found that general time-sensitive, low postpone application produce little data set, and general insensitive application of time produces bigger data set.For example, generally in the shared-media network that transmits the TCP/IP business, the most up code stream business of using for TCP/IP will be the TCP acknowledgment data set, and this data set sends by up code stream channel, make TCP/IP professional mobile by the continuation of downing code flow channel.Generally, the application of Web roaming and recreation produces little data set in up code stream direction equally.These little data sets that send by up code stream channel are time-sensitives, because the delay in their transmission may cause the significant unacceptable performance of this application.On the other hand, the transmission of general up ASCII stream file ASCII will be to be feature with the big data set that sends by up code stream channel.It is insensitive that these big data sets that send by up code stream channel are considered to the time, because general delay in their transmission will be unnoticed.Although time-sensitive uses and to send little data set and insensitive application of time by up code stream channel to send big data set by up code stream channel always incorrect, the size of data set is used to a kind of hypothesis that the delay as this application requires also so MAC user is categorized as high priority or low priority by headend unit.
Because the data set that sends may change between each time sends, the preferred embodiment utilization is to the exponent-weighted average of the burst size of each MAC user's reception.When the pulse train by up code stream channel was received, headend unit was to each MAC user's gauge index weighted average.Have the MAC user that average data group size is lower than predetermined threshold data group size and be placed in the high priority bank, and residue MAC user is placed in the low priority group.MAC user's exponent-weighted average calculates according to following formula;
avg_packet_size＝α *avg_packet_size+(1-α) *received_burst_size
Wherein α is that predetermined weight coefficient and received_burst_size are the sizes from the nearest pulse train that receives of MAC user.
Every next upstream bursts sends by when MAC user receives, and headend unit is upgraded the calculating of MAC user's average data group size and reclassified MAC user and is high priority bank or low priority group.Fig. 2 represents to be used to handle the logical flow chart that upstream bursts sends.Begin and the pulse train that receives from MAC user in step 220 sends in this logic of step 210, in the size of this logical renewal of step 230 from MAC user's average data group.Determine whether that in this logic of step 240 this average data group size is lower than the size of predetermined threshold data group then.If this MAC user's average data group size is lower than the size (in step 240 for "Yes") of predetermined threshold data group, then this MAC user of this logical division of step 250 in high priority bank; Otherwise this MAC user of this logical division of step 260 in the low priority group.This logic finishes in step 299.
Because the hypothesis that the delay about this MAC user requires has been represented in MAC user's classification, whether make effective classification for predetermined weight coefficient α and the selected value influence of predetermined threshold data group size.The selection of predetermined weight coefficient α is a kind of based on determining on the strategy, and expression is added in the relative situation that weighted sum on the pulse train of nearest reception is added in the weighting on the history average that calculates by each pulse train of past.In the preferred embodiment, this predetermined weight coefficient is selected as 0.5, and the weighting that this value is positioned at by the pulse train of nearest reception and history average equates.The selection of predetermined threshold data group size is based on observed traffic performance.In the preferred embodiment, this predetermined threshold size is chosen as 200 bytes.
Fig. 3 represents the logical flow chart of a polling cycle.Begin and advance to the next high-priority MAC user of poll in high priority cyclic polling table in the logic of each polling cycle of step 310 in step 320.Behind the poll MAC user, logic advances to 330 in step 320, determines whether all polled mistake of all high-priority MAC users during this polling cycle.If in all polled mistake of not all high-priority users during the polling cycle ("No" in step 330), then this logic turns back to step 320, the next high-priority MAC user of poll.But, if during this polling cycle all polled mistakes of all high-priority MAC users ("Yes" in step 330), then this logic advances to step 340, next the low priority MAC user of poll in low priority cyclic polling table.At step 340 poll behind the next low priority MAC user, determine whether all polled mistake of all low priority MAC users during this polling cycle in this logic of step 350.If all polled mistakes of all low priority MAC users ("Yes" in step 350) during this polling cycle, then this logic is returned new polling cycle of step 310 beginning.But, if during this polling cycle all polled mistake of not all low priority MAC user ("No" in step 350), then determine whether that in this logic of step 360 these low priorities MAC user has used up the predetermined maximum poll time.If the still unexhausted predetermined maximum poll time of these low priorities MAC user ("No" in step 360), then this logic is returned and is decreased the next low priority MAC user of step 340 poll.But if the predetermined maximum poll time reaches ("Yes" in step 360), then this logic is returned step 310, begins a new polling cycle.
If before all low priority MAC users of poll (promptly, reach the predetermined maximum poll time in step 360) headend unit finishes polling cycle, then during next polling cycle in step 340 to low priority MAC user's poll from table then last time last low priority MAC user that poll is crossed next low priority MAC user begin.As a result, each low priority MAC user can be recycled poll by several polling cycles.
Under the situation that does not break away from its spirit and essential characteristic, the present invention may be implemented within other specific forms.It is illustrative and not restrictive that described embodiment will be regarded as merely in all respects.

Claims (10)

1. a plurality of MAC users of grouping are the method for high priority bank and low priority group, and this method may further comprise the steps:
Each MAC user is calculated the size of average data group; With
To each MAC user:
If the size of this MAC user's average data group is lower than the size of predetermined threshold data group, this MAC user that then classifies is in high priority bank; With
Otherwise this MAC user that classifies is in the low priority group.
2. the process of claim 1 wherein average data group size to MAC user be according to each pulse train that receives from this MAC user as follows exponent-weighted average determine:
Average data group size=α *Average data group size+(1-α) *The burst size that receives
Wherein α is that the burst size of predetermined weight coefficient and reception is the size from the nearest pulse train that receives of MAC user.
3. in shared-media network time-sensitive is used the method that low access delay is provided for one kind, wherein each application is linked into shared-media network by MAC user, and this method may further comprise the steps:
Divide into groups each MAC user for high priority bank and low priority group; With
By each MAC user of order poll of each polling cycle, wherein each polling cycle may further comprise the steps:
Each user of each high-priority MAC user of poll; With
After each of poll high-priority MAC user, then some low priority MAC users of poll are again taken place until one of following situation;
The all polled mistake of all each low priority MAC users; With
These low priorities MAC user is serviced the predetermined maximum poll time.
4. the method for claim 3, the MAC user's that wherein divides into groups step comprises following each step:
Monitor each MAC user's transmission; With
Be each MAC user:
From described transmission, determine this MAC user's access delay requirement;
If this MAC customer requirements low access delay is then placed this MAC user to high priority bank; With
Otherwise, place this MAC user to the low priority group.
5. the method for claim 4, determine that wherein the step that MAC user's access delay requires may further comprise the steps:
Calculate MAC user's average data group size; With
If the size of this average data group is lower than the size of predetermined threshold data group, then determine the low delay of this MAC customer requirements.
6. the method for claim 3, wherein each polling cycle may further comprise the steps:
(a) the next high-priority MAC user of poll;
(b) during this polling cycle, determine whether all polled mistake of all high-priority MAC users;
(c) during this polling cycle, polled if at least one high-priority MAC user still remains, then return step (a);
(d) during this polling cycle, if all polled mistake of all high-priority MAC users, then the low priority MAC user that follows of poll;
(e) whether determine during this polling cycle all polled mistake of all low priority MAC users;
(f) during this polling cycle,, begin next polling cycle if all polled mistake of all low priority MAC users is then returned step (a);
(g) during this polling cycle, polled if at least one low priority MAC user still remains, whether then definite these low priorities MAC user is serviced the predetermined maximum poll time;
(h) if these low priorities MAC user does not have serviced being somebody's turn to do the predetermined maximum poll time, then return step (d); With
(i) if each low priority MAC user serviced should the predetermined maximum poll time, then return step (a) and begin next polling cycle.
7. in shared-media network time-sensitive is used the device that low access delay is provided for one kind, wherein each application is linked into shared-media network by MAC user, and this device comprises:
The logical circuit of each MAC user for high priority bank and low priority group is used to divide into groups; With
By continuous polling cycle order, poll MAC user's logical circuit, wherein each polling cycle comprises:
Each user of poll high-priority MAC user; With
Behind intact each the high-priority MAC user of poll, follow a plurality of low priority MAC users of poll, take place until one of following situation:
The all polled mistake of all low priority MAC users; With
These low priorities MAC user is serviced the predetermined maximum poll time.
8. the device of claim 7, the MAC user that wherein is used to divide into groups comprises for the logical circuit of high priority bank and low priority group:
Be used for each MAC user is calculated the logical circuit of average data group size;
If this MAC user's average data group size is lower than predetermined threshold data group size, the logical circuit of MAC user to high priority bank is used to divide into groups; With
Otherwise the circuit of NAC user to the low priority group is used to divide into groups.
9. the device of claim 8, wherein MAC user's average data group size be by the pulse train that receives from MAC user as follows exponent-weighted average determine:
Average data group size=α *Average data group size+(1-α) *The burst size that receives
Wherein α is that the burst size of predetermined weight coefficient and reception is the size from the nearest pulse train that receives of MAC user.
10. a composition is used to control the system that a plurality of MAC users are linked into the headend unit of sharing transmission medium, and wherein this headend unit comprises:
The logical circuit of each MAC user to high priority bank and low priority group is used to divide into groups; With
Be used for by continuous polling cycle order, each MAC user's of poll logical circuit, wherein each polling cycle comprises:
Among the poll high-priority MAC user each; With
Finish each of high priority MAC user at poll after, a plurality of low priority MAC users of poll, take place until one of following situation:
The all polled mistake of all low priority MAC users; With
Served the predetermined maximum poll time for these low priorities MAC user.
CN98806655A 1997-06-27 1998-05-13 System device and method for providing low access delay for time-sensitive applications in a shared medium network Pending CN1262008A (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US88452797A 1997-06-27 1997-06-27
US08/884,527 1997-06-27

Publications (1)

Publication Number Publication Date
CN1262008A true CN1262008A (en) 2000-08-02

Family

ID=25384828

Family Applications (1)

Application Number Title Priority Date Filing Date
CN98806655A Pending CN1262008A (en) 1997-06-27 1998-05-13 System device and method for providing low access delay for time-sensitive applications in a shared medium network

Country Status (8)

Country Link
EP (1) EP0990331A1 (en)
JP (1) JP2002506593A (en)
KR (1) KR20010014200A (en)
CN (1) CN1262008A (en)
AU (1) AU720470B2 (en)
BR (1) BR9810343A (en)
CA (1) CA2292479A1 (en)
WO (1) WO1999000941A1 (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2006063499A1 (en) * 2004-12-17 2006-06-22 Zte Corporation A METHOD FOR GROUP POLLING IN WLAN BASED ON ADAPTIVE QoS ASSURANCE
CN100401709C (en) * 2004-12-17 2008-07-09 中兴通讯股份有限公司 WLAN subgroup polling method based on fixed service quality assurance policy
CN102291836A (en) * 2010-06-21 2011-12-21 中兴通讯股份有限公司 Random access control method and system
CN101433032B (en) * 2006-04-28 2012-04-25 西门子公司 Quality guarantee for real-time applications over shared networks
CN1842979B (en) * 2003-07-31 2012-05-09 摩托罗拉移动公司 System and method for adaptive polling in a WLAN
CN102523607A (en) * 2004-07-19 2012-06-27 美商内数位科技公司 Method and wireless transmission/ receiving unit for multiplexing data

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100598078B1 (en) * 2001-01-05 2006-07-10 삼성전자주식회사 Wireless communication apparatus, wireless communication system employing the same and the method thereof
KR100442346B1 (en) * 2001-11-19 2004-07-30 엘지전자 주식회사 Polling list employment method in ieee802.11 mac layer
KR100846767B1 (en) * 2002-01-29 2008-07-16 삼성전자주식회사 Method and apparatus for preventing collision between appliances in the network
KR100461539B1 (en) * 2002-11-26 2004-12-17 한국전자통신연구원 Packet scheduler method for considering accumulation counter in wireless communication system
CN1302637C (en) * 2003-01-28 2007-02-28 华为技术有限公司 A multiple spanning tree protocol bridge priority coordination method
WO2014094229A1 (en) 2012-12-18 2014-06-26 Telefonaktiebolaget L M Ericsson (Publ) Method and apparatus for managing media access control addresses
CN103248675A (en) * 2013-04-23 2013-08-14 浪潮电子信息产业股份有限公司 Polling method for monitoring state of server hardware
US11228996B2 (en) * 2018-09-28 2022-01-18 Qualcomm Incorporated Delivery time windows for low latency communications

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE68916231T2 (en) * 1989-03-23 1995-02-02 Ibm Method and device for multiple access with distributed queues in a communication system.
US5892910A (en) * 1995-02-28 1999-04-06 General Instrument Corporation CATV communication system for changing first protocol syntax processor which processes data of first format to second protocol syntax processor processes data of second format

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1842979B (en) * 2003-07-31 2012-05-09 摩托罗拉移动公司 System and method for adaptive polling in a WLAN
CN102523607A (en) * 2004-07-19 2012-06-27 美商内数位科技公司 Method and wireless transmission/ receiving unit for multiplexing data
CN102523607B (en) * 2004-07-19 2015-11-18 英特尔公司 The method of multiplexed data and wireless transmission/receive unit
WO2006063499A1 (en) * 2004-12-17 2006-06-22 Zte Corporation A METHOD FOR GROUP POLLING IN WLAN BASED ON ADAPTIVE QoS ASSURANCE
CN100401709C (en) * 2004-12-17 2008-07-09 中兴通讯股份有限公司 WLAN subgroup polling method based on fixed service quality assurance policy
CN100401708C (en) * 2004-12-17 2008-07-09 中兴通讯股份有限公司 WLAN subgroup polling method based on self-adaptive service quality assurance
CN101433032B (en) * 2006-04-28 2012-04-25 西门子公司 Quality guarantee for real-time applications over shared networks
CN102291836A (en) * 2010-06-21 2011-12-21 中兴通讯股份有限公司 Random access control method and system
WO2011160519A1 (en) * 2010-06-21 2011-12-29 中兴通讯股份有限公司 Method and system for controlling random access
CN102291836B (en) * 2010-06-21 2016-01-20 中兴通讯股份有限公司 A kind of random access control method and system

Also Published As

Publication number Publication date
EP0990331A1 (en) 2000-04-05
CA2292479A1 (en) 1999-01-07
KR20010014200A (en) 2001-02-26
WO1999000941A1 (en) 1999-01-07
AU720470B2 (en) 2000-06-01
BR9810343A (en) 2000-09-05
AU7483198A (en) 1999-01-19
JP2002506593A (en) 2002-02-26

Similar Documents

Publication Publication Date Title
US5615212A (en) Method, device and router for providing a contention-based reservation mechanism within a mini-slotted dynamic entry polling slot supporting multiple service classes
CN1262008A (en) System device and method for providing low access delay for time-sensitive applications in a shared medium network
CN1237761C (en) Multi-level scheduling method for multiplexing packets in a communications network
JP2957062B2 (en) Switching system using priority and method for limiting jitter in this system
AU623953B2 (en) A communications method for a shared-medium communications network
US20030065809A1 (en) Scheduling downstream transmissions
CN1520663A (en) Method and appts. for providing communications bandwidth to users having committed data rate based on priority assignment
EP1744557B1 (en) Method and device for shaping the service flow transmitted in network
US7688863B2 (en) Methods and apparatus for sharing network bandwidth
Miyoshi et al. QoS-aware dynamic bandwidth allocation scheme in Gigabit-Ethernet passive optical networks
JPH11289350A (en) Data transmitter
JPH09319671A (en) Data transmitter
US5909444A (en) System, device, and method for aggregating users in a shared-medium network
CN1196145A (en) Device, router, method and system for providing hybrid multiple access protocol for users with multiple priorities
KR100397718B1 (en) Offered load estimation and applications for using same in a communication network
CN1275425C (en) Upward bandwidth controlling method for wide band radio switching in system
Jan et al. CSMA/CD protocol for time-constrained communication on bus networks
Ju et al. Adaptive scheduling in DOCSIS-based CATV networks
US7304946B2 (en) Packet multiplexing control method and a concentrator using the same
Schmickler et al. Applying the SRPT Principle to Improve the Performance of the CSMA/CD Media Access Control Protocol
Lee et al. A Collision-Free CSMA Protocol for Real-Time Communication
CN115915260A (en) Resource scheduling method and device, communication method and device, and readable storage medium
Woo HFC {Jana—g—Unslotted CSMA—CD gaeagl
CA2309563A1 (en) Method and apparatus for managing data traffic between a high capacity source and multiple destinations
CN114157610A (en) High-speed network protocol system and transmission method suitable for block chain network

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication
REG Reference to a national code

Ref country code: HK

Ref legal event code: WD

Ref document number: 1029235

Country of ref document: HK