EP1024629A1 - System for scheduling competing digital emissions by circular inquiry - Google Patents

System for scheduling competing digital emissions by circular inquiry Download PDF

Info

Publication number
EP1024629A1
EP1024629A1 EP00410007A EP00410007A EP1024629A1 EP 1024629 A1 EP1024629 A1 EP 1024629A1 EP 00410007 A EP00410007 A EP 00410007A EP 00410007 A EP00410007 A EP 00410007A EP 1024629 A1 EP1024629 A1 EP 1024629A1
Authority
EP
European Patent Office
Prior art keywords
packet
source
sources
presented
packets
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.)
Withdrawn
Application number
EP00410007A
Other languages
German (de)
French (fr)
Inventor
Pascal Moniot
Marcello Coppola
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.)
STMicroelectronics SA
Original Assignee
STMicroelectronics SA
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 STMicroelectronics SA filed Critical STMicroelectronics SA
Publication of EP1024629A1 publication Critical patent/EP1024629A1/en
Withdrawn 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/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L12/5602—Bandwidth control in ATM Networks, e.g. leaky bucket
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
    • H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
    • H04Q11/0478—Provisions for broadband connections
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5614—User Network Interface
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5638—Services, e.g. multimedia, GOS, QOS
    • H04L2012/5646—Cell characteristics, e.g. loss, delay, jitter, sequence integrity
    • H04L2012/5651—Priority, marking, classes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5678—Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
    • H04L2012/5679—Arbitration or scheduling

Definitions

  • the present invention relates to a management system for several concurrent processes by the method of scrutiny cyclic, also called "round-robin" method.
  • the current invention more specifically relates to such a management system applied to multiple concurrent data shows on a single communication channel.
  • Figure 1 shows schematically such a system data transmission management.
  • Multiple data sources 10 are connected to a cyclic scanning circuit 12 which is intended to transmit data provided by sources 10 on a single OUT channel.
  • the system in Figure 1 is used, for example, in a multiprotocol switch intended to connect networks Ethernet to an ATM network.
  • the data sources 10 are flow shaping circuits or "shapers", of which each is intended to regulate the transmission rate on the network ATM based on a previously negotiated debit profile.
  • the cyclic scanning circuit 12 is intended for treat each of the 10 sources with the same priority and the as equitably as possible, taking into account that these sources ask to send asynchronously. For it, the system generally works as follows:
  • a source 10 Whenever a source 10 is ready to emit a data packet on the output channel OUT, it transmits a request RQ1 to the cyclic polling circuit 12.
  • the circuit 12 examines, at a given moment, the motions presented by the sources 10 and elects the corresponding sources to issue their packets consecutively on the OUT channel. Any request arising after the analysis time is ignored until the analysis time next which occurs at the end of the transmission of the last packet.
  • time between two moments of analysis is equal to the duration of transmission of packets by sources which have were elected to broadcast.
  • the maximum time interval between two analysis times is equal to the transmission time of N packets (N being the number of sources 10).
  • the system can guarantee, for each source 10, a maximum flow one packet per maximum scan interval.
  • the sources 10 generally respect this flow in an average manner. he as a result a source may have to send two separate packets an interval less than the maximum analysis interval. This is not a problem if a small number of sources 10 ask to broadcast. Indeed, the interval separating two moments of analysis is smaller than the maximum interval and probably less than the time between the two requests from the same source.
  • Another solution to avoid packet loss could be to store in a buffer the requests that cannot be processed in a current scan interval.
  • this solution only delays the need to stop a source without really removing the problem, except when use unreasonably large buffers.
  • An object of the present invention is to provide a management system for several concurrent data transmissions which avoids the above problems.
  • the present invention provides a single channel data transmission management system from multiple sources, a normal priority request being presented when a source is ready to send a packet data, including a cyclic polling circuit which examines the requests at successive analysis instants and causes a packet to be sent by the sources for which a request was presented before the current analysis time.
  • the system includes, for each source, a queue at two locations in which the source writes a package as soon as it is ready, a normal priority request being made when the file contains a single packet and a high priority request being presented when the queue contains two packets, the circuit being planned to cause the transmission of a packet of each queue associated with a high priority request and does not cause the transmission of packets of queues associated with requests of normal priority only if no request of high priority has was presented before a moment of analysis.
  • the scanning circuit is designed to modify randomly at each instant of analysis the order in which are issued source packages associated with queries.
  • FIG. 2 several data sources 10 are linked to a cyclic polling circuit 12 via respective rows 14 at two locations.
  • a queue 14 If a queue 14 contains a single datum, it transmits to the cyclic polling circuit 12 a normal request RQ1 which is treated in a conventional manner, as described in relationship to Figure 1.
  • the first location used of a file 14 corresponds to a register of the conventional system, used to keep a package pending authorization send polling circuit 12.
  • the scanning circuit 12 notes the requests presented by queues 14. If all requests are of normal priority, these requests are processed classic way as mentioned above. Through however, if there are high priority requests, only those 10 sources corresponding to high priority queries are elected to issue their packets consecutively, these packets being of course taken in the associated queues 14. Once these packets sent, the corresponding queues, containing only one packet, resubmit a normal priority request.
  • Normal requests that have not been processed are taken into account at the next analysis time, among possible new requests and requests returned to normal. Of course, some of these requests may have been transformed in the meantime in high priority requests and will therefore be processed in priority over normal requests.
  • the effectiveness of the system is based on the fact that the sources emitting at high speed are few and emit a short time at high speed. This is the most current, which can be treated without having to stop the sources that are transmitting at high speed.
  • Queue 14 performs this function by sending an STP stop signal to the source when it contains two packages.
  • Connection unavailability may occur during an analysis interval just after the issuance of a first packet on this connection, and the connection may become available again before the end of the current scan interval. AT the next scan interval, the connection can again become unavailable after the first packet has been sent, and and so on for several consecutive analysis intervals.
  • the scanning circuit cyclic 12 conventionally treats sources 10 consecutively, that is to say in order of increasing ranks. Yes we proceed in this way, the last source or sources associated with a connection which becomes unavailable, in the case mentioned above, will only be processed when the connection becomes new available continuously.
  • the cyclic polling circuit 12 is modified so that the order of treatment of elected sources to send either random.

Abstract

The system provides first level priority for single packets and higher priority for two data packets from a single source. The system provides management of transmissions of data on a single channel (OUT), deriving data from several sources (10). A normal priority request is presented when a source is ready to transmit a packet of data. The system comprise a cyclical scrutiny circuit (12) which examines the requests at successive analysis instants, and provokes the transmission of a packet by the sources for which a request has been presented before the current analysis instant. The system further comprises for each source, a file with two positions (14) in which the source writes the packet as soon as it is ready. A higher priority request is presented when the file contains two packets. The scrutiny circuit is configured to provoke the transmission of a packet from each file associated with a high priority request.

Description

La présente invention concerne un système de gestion de plusieurs processus concourants par la méthode de la scrutation cyclique, également appelée méthode "round-robin". La présente invention concerne plus spécifiquement un tel système de gestion appliqué à plusieurs émissions concourantes de données sur un canal de communication unique.The present invention relates to a management system for several concurrent processes by the method of scrutiny cyclic, also called "round-robin" method. The current invention more specifically relates to such a management system applied to multiple concurrent data shows on a single communication channel.

La figure 1 représente schématiquement un tel système de gestion d'émissions de données. Plusieurs sources de données 10 sont reliées à un circuit de scrutation cyclique 12 qui est destiné à transmettre les données fournies par les sources 10 sur un canal unique OUT.Figure 1 shows schematically such a system data transmission management. Multiple data sources 10 are connected to a cyclic scanning circuit 12 which is intended to transmit data provided by sources 10 on a single OUT channel.

Le système de la figure 1 est utilisé, par exemple, dans un commutateur multiprotocole destiné à connecter des réseaux Ethernet à un réseau ATM. Dans ce cas, les sources de données 10 sont des circuits de mise en forme de flux ou "shapers", dont chacun est destiné à réguler le débit en émission sur le réseau ATM en fonction d'un profil de débit préalablement négocié.The system in Figure 1 is used, for example, in a multiprotocol switch intended to connect networks Ethernet to an ATM network. In this case, the data sources 10 are flow shaping circuits or "shapers", of which each is intended to regulate the transmission rate on the network ATM based on a previously negotiated debit profile.

Le circuit de scrutation cyclique 12 est destiné à traiter chacune des sources 10 avec la même priorité et de la manière la plus équitable possible, en tenant compte du fait que ces sources demandent à émettre de manière asynchrone. Pour cela, le système fonctionne généralement de la manière suivante :The cyclic scanning circuit 12 is intended for treat each of the 10 sources with the same priority and the as equitably as possible, taking into account that these sources ask to send asynchronously. For it, the system generally works as follows:

Chaque fois qu'une source 10 est prête à émettre un paquet de données sur le canal de sortie OUT, elle émet une requête RQ1 vers le circuit de scrutation cyclique 12. Le circuit 12 examine, à un instant donné, les requêtes présentées par les sources 10 et élit les sources correspondantes pour émettre leurs paquets consécutivement sur le canal OUT. Toute requête survenant après l'instant d'analyse est ignorée jusqu'à l'instant d'analyse suivant qui survient à la fin de l'émission du dernier paquet.Whenever a source 10 is ready to emit a data packet on the output channel OUT, it transmits a request RQ1 to the cyclic polling circuit 12. The circuit 12 examines, at a given moment, the motions presented by the sources 10 and elects the corresponding sources to issue their packets consecutively on the OUT channel. Any request arising after the analysis time is ignored until the analysis time next which occurs at the end of the transmission of the last packet.

Ainsi, le temps qui sépare deux instants d'analyse est égal à la durée d'émission des paquets par les sources qui ont été élues pour émettre. L'intervalle de temps maximal séparant deux instants d'analyse est égal à la durée de transmission de N paquets (N étant le nombre de sources 10).So the time between two moments of analysis is equal to the duration of transmission of packets by sources which have were elected to broadcast. The maximum time interval between two analysis times is equal to the transmission time of N packets (N being the number of sources 10).

Avec la configuration qui vient d'être décrite, le système peut garantir, pour chacune des sources 10, un débit maximal d'un paquet par intervalle d'analyse maximal. Toutefois les sources 10 respectent en général ce débit de manière moyenne. Il en résulte qu'une source peut avoir à émettre deux paquets séparés d'un intervalle inférieur à l'intervalle d'analyse maximal. Ceci ne pose aucun problème si un faible nombre de sources 10 demandent à émettre. En effet, l'intervalle séparant alors deux instants d'analyse est plus petit que l'intervalle maximal et probablement inférieur à la durée séparant les deux requêtes d'émission de la même source.With the configuration which has just been described, the system can guarantee, for each source 10, a maximum flow one packet per maximum scan interval. However the sources 10 generally respect this flow in an average manner. he as a result a source may have to send two separate packets an interval less than the maximum analysis interval. This is not a problem if a small number of sources 10 ask to broadcast. Indeed, the interval separating two moments of analysis is smaller than the maximum interval and probably less than the time between the two requests from the same source.

Par contre, lorsqu'un grand nombre de sources demandent à émettre, les deux requêtes d'émission consécutives d'une même source peuvent se produire à l'intérieur d'un même intervalle d'analyse, d'où il résulte qu'un seul des deux paquets correspondants peut être émis et que l'autre est perdu. Pour éviter la perte de paquets, il est classique d'arrêter chaque source après qu'elle a émis une requête, l'arrêt étant levé dès que le paquet correspondant a été émis. However, when a large number of sources ask to be sent, the two consecutive transmission requests of the same source can occur within the same interval analysis, which results in only one of the two packages correspondents can be issued and the other is lost. For avoid packet loss, it is conventional to stop each source after she issued a motion, the judgment being lifted as soon as that the corresponding packet has been issued.

Une autre solution pour éviter la perte de paquets pourrait être de stocker dans une mémoire tampon les requêtes qui ne peuvent être traitées dans un intervalle d'analyse courant. Toutefois, cette solution ne fait que retarder la nécessité d'arrêter une source sans vraiment supprimer le problème, sauf à utiliser des mémoires tampon de taille déraisonnable.Another solution to avoid packet loss could be to store in a buffer the requests that cannot be processed in a current scan interval. However, this solution only delays the need to stop a source without really removing the problem, except when use unreasonably large buffers.

Dans le cas où les sources 10 sont des circuits de mise en forme de flux, il est désavantageux de devoir les arrêter, car cela perturbe leur fonction de régulation de flux.In the case where the sources 10 are putting circuits in the form of a flow, it is disadvantageous to have to stop them, because this disrupts their function of flow regulation.

Un objet de la présente invention est de prévoir un système de gestion de plusieurs émissions de données concourantes qui évite les problèmes susmentionnés.An object of the present invention is to provide a management system for several concurrent data transmissions which avoids the above problems.

Pour atteindre cet objet, la présente invention prévoit un système de gestion d'émissions de données sur un canal unique à partir de plusieurs sources, une requête de priorité normale étant présentée lorsqu'une source est prête à émettre un paquet de données, comprenant un circuit de scrutation cyclique qui examine les requêtes à des instants d'analyse successifs et provoque l'émission d'un paquet par les sources pour lesquelles une requête a été présentée avant l'instant d'analyse courant. Le système comprend, pour chaque source, une file à deux emplacements dans laquelle la source écrit un paquet aussitôt qu'il est prêt, une requête de priorité normale étant présentée lorsque la file contient un seul paquet et une requête de priorité élevée étant présentée lorsque la file contient deux paquets, le circuit de scrutation étant prévu pour provoquer l'émission d'un paquet de chaque file associée à une requête de priorité élevée et ne provoquer l'émission des paquets de files associées à des requêtes de priorité normale que si aucune requête de priorité élevée n'a été présentée avant un instant d'analyse.To achieve this object, the present invention provides a single channel data transmission management system from multiple sources, a normal priority request being presented when a source is ready to send a packet data, including a cyclic polling circuit which examines the requests at successive analysis instants and causes a packet to be sent by the sources for which a request was presented before the current analysis time. The system includes, for each source, a queue at two locations in which the source writes a package as soon as it is ready, a normal priority request being made when the file contains a single packet and a high priority request being presented when the queue contains two packets, the circuit being planned to cause the transmission of a packet of each queue associated with a high priority request and does not cause the transmission of packets of queues associated with requests of normal priority only if no request of high priority has was presented before a moment of analysis.

Selon un mode de réalisation de la présente invention, le circuit de scrutation est prévu pour modifier de manière aléatoire à chaque instant d'analyse l'ordre dans lequel sont émis les paquets des sources associées aux requêtes. According to an embodiment of the present invention, the scanning circuit is designed to modify randomly at each instant of analysis the order in which are issued source packages associated with queries.

Ces objets, caractéristiques et avantages, ainsi que d'autres de la présente invention seront exposés en détail dans la description suivante de modes de réalisation particuliers faite à titre non-limitatif en relation avec les figures jointes parmi lesquelles :

  • la figure 1, précédemment décrite, représente de manière schématique un système de gestion classique, par scrutation cyclique, de plusieurs émissions de données concourantes ; et
  • la figure 2 représente schématiquement un mode de réalisation de système de gestion d'émissions concourantes selon la présente invention.
    • These objects, characteristics and advantages, as well as others of the present invention will be explained in detail in the following description of particular embodiments given without limitation in relation to the attached figures, among which:
  • FIG. 1, previously described, schematically represents a conventional management system, by cyclic scanning, of several concurrent data transmissions; and
  • FIG. 2 schematically represents an embodiment of a system for managing concurrent emissions according to the present invention.

    • A la figure 2, plusieurs sources de données 10 sont reliées à un circuit de scrutation cyclique 12 par l'intermédiaire de files respectives 14 à deux emplacements.In FIG. 2, several data sources 10 are linked to a cyclic polling circuit 12 via respective rows 14 at two locations.

    Lorsqu'une source 10 est prête à émettre un paquet de données, ce paquet est immédiatement écrit dans la file correspondante 14.When a source 10 is ready to send a data packet, this package is immediately written to the corresponding queue 14.

    Si une file 14 contient une seule donnée, elle émet vers le circuit de scrutation cyclique 12 une requête normale RQ1 qui est traitée de manière classique, comme cela a été décrit en relation avec la figure 1. En fait, le premier emplacement utilisé d'une file 14 correspond à un registre du système classique, utilisé pour conserver un paquet en attente de l'autorisation d'émettre du circuit de scrutation 12.If a queue 14 contains a single datum, it transmits to the cyclic polling circuit 12 a normal request RQ1 which is treated in a conventional manner, as described in relationship to Figure 1. In fact, the first location used of a file 14 corresponds to a register of the conventional system, used to keep a package pending authorization send polling circuit 12.

    Lorsque la source est prête à émettre un deuxième paquet alors que le premier paquet inscrit dans la file 14 n'a pas encore été émis, ce deuxième paquet est écrit dans l'emplacement restant de la file 14. La file émet alors vers le circuit 12 une requête de priorité élevée RQ2.When the source is ready to send a second packet when the first packet entered in queue 14 has not yet issued, this second packet is written in the location remaining of queue 14. The queue then transmits to circuit 12 a high priority request RQ2.

    A chaque instant d'analyse, le circuit de scrutation 12 relève les requêtes présentées par les files 14. Si toutes les requêtes sont de priorité normale, ces requêtes sont traitées de manière classique comme cela a été mentionné ci-dessus. Par contre, s'il y a des requêtes de priorité élevée, seules les sources 10 correspondant aux requêtes de priorité élevée sont élues pour émettre leurs paquets consécutivement, ces paquets étant bien entendu pris dans les files 14 associées. Une fois ces paquets émis, les files correspondantes, ne contenant plus qu'un paquet, présentent de nouveau une requête de priorité normale.At each instant of analysis, the scanning circuit 12 notes the requests presented by queues 14. If all requests are of normal priority, these requests are processed classic way as mentioned above. Through however, if there are high priority requests, only those 10 sources corresponding to high priority queries are elected to issue their packets consecutively, these packets being of course taken in the associated queues 14. Once these packets sent, the corresponding queues, containing only one packet, resubmit a normal priority request.

    Les requêtes normales qui n'ont pas été traitées sont prises en compte à l'instant d'analyse suivant, parmi d'éventuelles nouvelles requêtes et les requêtes redevenues normales. Bien entendu, certaines de ces requêtes pourront entre temps avoir été transformées en requêtes de priorité élevée et seront donc traitées en priorité par rapport aux requêtes normales.Normal requests that have not been processed are taken into account at the next analysis time, among possible new requests and requests returned to normal. Of course, some of these requests may have been transformed in the meantime in high priority requests and will therefore be processed in priority over normal requests.

    L'efficacité du système est basé sur le fait que les sources émettant à débit élevé sont peu nombreuses et émettent peu longtemps à débit élevé. Ceci constitue la situation la plus courante, qui peut être traitée sans devoir arrêter les sources qui émettent à débit élevé.The effectiveness of the system is based on the fact that the sources emitting at high speed are few and emit a short time at high speed. This is the most current, which can be treated without having to stop the sources that are transmitting at high speed.

    Bien entendu, dans un cas exceptionnel où un grand nombre de sources émettent à débit élevé, il est possible que le nombre de requêtes de priorité élevée soit momentanément si élevé que certaines sources présentent un nouveau paquet de données avant même qu'un emplacement pour recevoir ce nouveau paquet ait été libéré dans la file correspondante 14. Dans ce cas, la source doit être arrêtée. La file 14 réalise cette fonction par l'émission d'un signal d'arrêt STP vers la source lorsqu'elle contient deux paquets.Of course, in an exceptional case where a large number of sources are emitting at high speed, it is possible that the number of high priority requests is momentarily so high that some sources present a new data packet even before a location to receive this new package has was released to the corresponding queue 14. In this case, the source must be stopped. Queue 14 performs this function by sending an STP stop signal to the source when it contains two packages.

    Dans le cas où le système est utilisé dans un commutateur multiprotocole, il est possible que plusieurs sources 10, qui sont alors des circuits de mise en forme de flux, soient associées à une même connexion physique en émission. Une telle connexion physique peut avoir des moments d'indisponibilité et nécessiter l'arrêt des sources 10 correspondantes. Une indisponibilité d'une connexion est indiquée au circuit de scrutation 12 qui est prévu pour ne pas traiter les sources associés à la connexion indisponible, même si elles présentent une requête de priorité élevée par l'intermédiaire de leurs files 14. Il en résulte l'arrêt des sources si leurs files 14 sont pleines. In case the system is used in a switch multiprotocol, it is possible that several sources 10, which are then flow shaping circuits, either associated with the same physical connection in transmission. Such a physical connection may have downtime and require stopping the corresponding sources 10. Unavailability of a connection is indicated on the scanning circuit 12 which is expected not to deal with the sources associated with the connection unavailable, even if they request high priority through their queues 14. There are results in the sources being stopped if their queues 14 are full.

    Une indisponibilité de connexion peut survenir pendant un intervalle d'analyse juste après l'émission d'un premier paquet sur cette connexion, et la connexion peut redevenir disponible avant la fin de l'intervalle d'analyse courant. A l'intervalle d'analyse suivant, la connexion peut de nouveau devenir indisponible après l'émission d'un premier paquet, et ainsi de suite pendant plusieurs intervalles d'analyse consécutifs.Connection unavailability may occur during an analysis interval just after the issuance of a first packet on this connection, and the connection may become available again before the end of the current scan interval. AT the next scan interval, the connection can again become unavailable after the first packet has been sent, and and so on for several consecutive analysis intervals.

    Comme on l'a précédemment indiqué, le circuit de scrutation cyclique 12 traite classiquement les sources 10 consécutivement, c'est-à-dire par ordre de rangs croissants. Si on procède ainsi, la ou les dernières sources associées à une connexion qui devient indisponible, dans le cas évoqué ci-dessus, ne seront traitées que lorsque la connexion devient de nouveau disponible de manière continue.As previously indicated, the scanning circuit cyclic 12 conventionally treats sources 10 consecutively, that is to say in order of increasing ranks. Yes we proceed in this way, the last source or sources associated with a connection which becomes unavailable, in the case mentioned above, will only be processed when the connection becomes new available continuously.

    Pour éviter cette iniquité de traitement, selon un mode de réalisation de l'invention, le circuit de scrutation cyclique 12 est modifié pour que l'ordre de traitement des sources élues pour émettre soit aléatoire.To avoid this inequity of treatment, according to a mode embodiment of the invention, the cyclic polling circuit 12 is modified so that the order of treatment of elected sources to send either random.

    De nombreuses variantes et modification de la présente invention apparaítront à l'homme du métier. Par exemple, bien que l'on ait décrit des files 14 à deux emplacements de deux niveaux de priorité, on peut prévoir des files à plus de deux emplacements de niveaux de priorité respectifs croissants.Many variations and modification of this invention will appear to those skilled in the art. For example, although we have described lines 14 at two locations of two levels priority, we can provide queues at more than two locations increasing respective priority levels.

    Claims (2)

    Système de gestion d'émissions de données sur un canal unique (OUT) à partir de plusieurs sources (10), une requête de priorité normale étant présentée lorsqu'une source est prête à émettre un paquet de données, comprenant un circuit de scrutation cyclique (12) qui examine les requêtes à des instants d'analyse successifs et provoque l'émission d'un paquet par les sources pour lesquelles une requête a été présentée avant l'instant d'analyse courant,
       caractérisé en ce qu'il comprend, pour chaque source, une file à deux emplacements (14) dans laquelle la source écrit un paquet aussitôt qu'il est prêt, une requête de priorité normale étant présentée lorsque la file contient un seul paquet et une requête de priorité élevée étant présentée lorsque la file contient deux paquets, le circuit de scrutation étant prévu pour provoquer l'émission d'un paquet de chaque file associée à une requête de priorité élevée et ne provoquer l'émission des paquets de files associées à des requêtes de priorité normale que si aucune requête de priorité élevée n'a été présentée avant un instant d'analyse.    Management system for transmitting data on a single channel (OUT) from several sources (10), a normal priority request being presented when a source is ready to transmit a data packet, comprising a cyclic polling circuit (12) which examines the requests at successive analysis instants and causes the transmission of a packet by the sources for which a request was presented before the current analysis instant,
    characterized in that it comprises, for each source, a queue at two locations (14) in which the source writes a packet as soon as it is ready, a normal priority request being presented when the queue contains a single packet and a high priority request being presented when the queue contains two packets, the polling circuit being provided to cause the transmission of a packet of each queue associated with a high priority request and not to cause the transmission of the packets of queues associated with normal priority requests only if no high priority request has been presented before an analysis instant.         Système de gestion d'émissions de données selon la revendication 1, caractérisé en ce que le circuit de scrutation est prévu pour modifier de manière aléatoire à chaque instant d'analyse l'ordre dans lequel sont émis les paquets des sources associées aux requêtes.Data transmission management system according to claim 1, characterized in that the scanning circuit is expected to change randomly at any time analyze the order in which the source packets are emitted associated with requests.
    EP00410007A 1999-01-29 2000-01-28 System for scheduling competing digital emissions by circular inquiry Withdrawn EP1024629A1 (en)

    Applications Claiming Priority (2)

    Application Number Priority Date Filing Date Title
    FR9901192 1999-01-29
    FR9901192A FR2789249A1 (en) 1999-01-29 1999-01-29 MANAGEMENT SYSTEM FOR COMPETITIVE DIGITAL BROADCASTS BY CYCLIC SCRUTATION

    Publications (1)

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

    Family

    ID=9541515

    Family Applications (1)

    Application Number Title Priority Date Filing Date
    EP00410007A Withdrawn EP1024629A1 (en) 1999-01-29 2000-01-28 System for scheduling competing digital emissions by circular inquiry

    Country Status (3)

    Country Link
    EP (1) EP1024629A1 (en)
    JP (1) JP2000224238A (en)
    FR (1) FR2789249A1 (en)

    Cited By (1)

    * Cited by examiner, † Cited by third party
    Publication number Priority date Publication date Assignee Title
    CN106559273A (en) * 2017-01-19 2017-04-05 中国人民解放军国防科学技术大学 Towards the self-adaptive service quality priority dispatching method of Time Triggered Ethernet

    Families Citing this family (1)

    * Cited by examiner, † Cited by third party
    Publication number Priority date Publication date Assignee Title
    JP2002185520A (en) 2000-12-12 2002-06-28 Fujitsu Ltd Mobile terminal dealing router and home agent router

    Citations (2)

    * Cited by examiner, † Cited by third party
    Publication number Priority date Publication date Assignee Title
    US5446738A (en) * 1992-12-29 1995-08-29 Electronics And Telecommunications Research Institute ATM multiplexing system
    EP0774848A2 (en) * 1995-11-15 1997-05-21 Xerox Corporation Method for providing integrated packet services over a shared-media network

    Patent Citations (2)

    * Cited by examiner, † Cited by third party
    Publication number Priority date Publication date Assignee Title
    US5446738A (en) * 1992-12-29 1995-08-29 Electronics And Telecommunications Research Institute ATM multiplexing system
    EP0774848A2 (en) * 1995-11-15 1997-05-21 Xerox Corporation Method for providing integrated packet services over a shared-media network

    Cited By (2)

    * Cited by examiner, † Cited by third party
    Publication number Priority date Publication date Assignee Title
    CN106559273A (en) * 2017-01-19 2017-04-05 中国人民解放军国防科学技术大学 Towards the self-adaptive service quality priority dispatching method of Time Triggered Ethernet
    CN106559273B (en) * 2017-01-19 2019-10-25 中国人民解放军国防科学技术大学 Self-adaptive service quality priority dispatching method towards time trigger Ethernet

    Also Published As

    Publication number Publication date
    FR2789249A1 (en) 2000-08-04
    JP2000224238A (en) 2000-08-11

    Similar Documents

    Publication Publication Date Title
    EP2940960B1 (en) Method and device for scheduling packets to be routed in a network with implicit determination of the packets to be given priority treatment
    EP0519796B1 (en) Multiplexer for inserting digital packets with different priority levels in a transmission channel
    US9276857B2 (en) Method and apparatus for scheduling packets for transmission in a network processor having a programmable pipeline
    US7889659B2 (en) Controlling a transmission rate of packet traffic
    EP1420590A1 (en) Content providing apparatus and content providing method
    EP0901249A2 (en) Server for interactive distribution of audio/video programmes over telecommunication networks
    US20040193687A1 (en) Message processing pipeline for streams
    EP1024629A1 (en) System for scheduling competing digital emissions by circular inquiry
    EP2540010A2 (en) Method for the optimized allocation of a satellite communication resource and associated communication system
    EP1286550B1 (en) Device for data processing and routing
    US6253245B1 (en) Transmission system with buffer between independently controlled data paths
    EP0573317B1 (en) Apparatus for controlling access priority to common resources of functional modules distributed among a plurality of local units, each one of them forming a local daisy chain
    FR2823037A1 (en) TV/radio digital transmission channel band processing having predetermined size/rate output with digital words buffer zone store/output when refilling factor equal/above predetermined packet size.
    EP1212879B1 (en) Method and system for transmitting a chain of messages for database
    FR2766938A1 (en) Serial interface circuit and associated signal processing method
    CN113409801B (en) Noise processing method, system, medium and device for real-time audio stream playing
    FR2922038A1 (en) Data frame management method for controller area network type communication bus of motor vehicle, involves storing frames by ascending order of identifiers of frames, where highest priority and lowest identifier frame is at top of queue
    FR2762172A1 (en) Signal processing circuit receiving packet data from application side for transfer to serial bus
    EP1427154B1 (en) Method for packet buffer management and corresponding apparatus
    FR2821224A1 (en) PROCESS FOR PROVIDING DATA FOR A SERIAL TRANSMISSION BY TIME MULTIPLEXING, SERIAL DATA TRANSMITTER AND SWITCH FOR IMPLEMENTING THIS PROCESS
    EP0961446A1 (en) Congestion control in an ATM node
    EP1455472A1 (en) Timing control for packet streams
    FR2726414A1 (en) MULTIPLEXER OF DIGITAL INFORMATION PACKAGES, ESPECIALLY FOR DIGITAL TELEVISION
    EP1710710A1 (en) Circuit interface within an electronic integrated circuit
    WO1996013940A1 (en) Digital data packet multiplexer, in particular for digital television

    Legal Events

    Date Code Title Description
    PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

    Free format text: ORIGINAL CODE: 0009012

    AK Designated contracting states

    Kind code of ref document: A1

    Designated state(s): DE FR GB IT

    AX Request for extension of the european patent

    Free format text: AL;LT;LV;MK;RO;SI

    17P Request for examination filed

    Effective date: 20010118

    AKX Designation fees paid

    Free format text: DE FR GB IT

    RAP1 Party data changed (applicant data changed or rights of an application transferred)

    Owner name: STMICROELECTRONICS S.A.

    STAA Information on the status of an ep patent application or granted ep patent

    Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

    18D Application deemed to be withdrawn

    Effective date: 20040803