[go: up one dir, main page]

EP1330891B1 - Ordonnancement des transferts dans un reseau de communications - Google Patents

Ordonnancement des transferts dans un reseau de communications Download PDF

Info

Publication number
EP1330891B1
EP1330891B1 EP01980568A EP01980568A EP1330891B1 EP 1330891 B1 EP1330891 B1 EP 1330891B1 EP 01980568 A EP01980568 A EP 01980568A EP 01980568 A EP01980568 A EP 01980568A EP 1330891 B1 EP1330891 B1 EP 1330891B1
Authority
EP
European Patent Office
Prior art keywords
network
node
transmission
reservation
nodes
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.)
Expired - Lifetime
Application number
EP01980568A
Other languages
German (de)
English (en)
Other versions
EP1330891A1 (fr
Inventor
Jori Arrakoski
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.)
Intellectual Ventures I LLC
Original Assignee
Spyder Navigations LLC
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 Spyder Navigations LLC filed Critical Spyder Navigations LLC
Publication of EP1330891A1 publication Critical patent/EP1330891A1/fr
Application granted granted Critical
Publication of EP1330891B1 publication Critical patent/EP1330891B1/fr
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/824—Applicable to portable or mobile terminals
    • 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/407—Bus networks with decentralised control
    • H04L12/417—Bus networks with decentralised control with deterministic access, e.g. token passing
    • 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
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/28—Flow control; Congestion control in relation to timing considerations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/72—Admission control; Resource allocation using reservation actions during connection setup
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/826—Involving periods of time
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/828—Allocation of resources per group of connections, e.g. per group of users
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/542—Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality
    • 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/6459—Multiplexing, e.g. TDMA, CDMA
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H04W72/1263—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/543—Allocation or scheduling criteria for wireless resources based on quality criteria based on requested quality, e.g. QoS

Definitions

  • the invention relates generally to media access control in a communications network. More particularly, the invention relates to the scheduling of transfers in a synchronized multi-hop packet network, especially in a mesh network, and it is intended for traffic which is sensitive to delay or delay variation. This type of traffic is typically generated by interactive and/or real-time services.
  • the packets serving the information transfer utilize the same communication resources, which can transmit a single packet at a time.
  • the packets must queue for their allocated transmission position in the packet transmission sequence, which causes transmission delay.
  • a packet typically travels from the source node to the destination node via one or more other nodes, since the source and destination nodes are normally not adjacent nodes in the network and therefore direct communication between said nodes is not possible. Since every additional hop (i.e. transmission path between adjacent nodes) generates a transmission delay equal to at least one frame, the delay accumulates considerably in a multi-hop network.
  • FIG. 1 illustrates these basic concepts of a synchronized network.
  • the nodes share a common time sequence, such as a frame, that repeats regularly in the time domain.
  • a single frame contains a predetermined number of time slots, which are divided between control (i.e. signaling) information and user data, the division being typically such that a certain predefined number of time slots, such as 10% of a frame time, is devoted to control packet transmission and the rest to data packet transmission.
  • the length of a packet as compared to a time slot may vary in various systems.
  • a synchronized multi-hop packet network of the above kind is depicted for example in the PCT application WO 00/48367 .
  • a node and its neighboring nodes form a neighborhood.
  • a node agrees about the time slot reservations with all the nodes within its neighborhood.
  • Each time slot in the control portion of a frame is typically allocated to a single node.
  • the node sends control packets including scheduling information, i.e. this information indicates how the node is scheduled to transmit and/or receive during the subsequent frames.
  • scheduling information i.e. this information indicates how the node is scheduled to transmit and/or receive during the subsequent frames.
  • Persistent reservations are time slot reservations made for a longer period, and these persistent time slots are used to accommodate delay sensitive traffic, such as traffic generated by real-time or interactive services.
  • delay sensitive traffic such as traffic generated by real-time or interactive services.
  • persistent flows are chosen to convey delay sensitive traffic. Persistent flows are used in the above-mentioned PCT application, for example.
  • a drawback relating to the present networks is that they do not provide a controlled way for minimizing delay or delay variation, but the performance of the system is more or less coincidental in view of delay and delay variation. Thus, the persistent time slots cannot guarantee a good performance in terms of transmission delay.
  • a conventional method for decreasing the delay in multi-hop networks is to reduce the frame size in order to shorten the buffering time in a node.
  • there is a minimum for the frame length as signalling overhead becomes dominant when the frame length is reduced.
  • the proportion of signalling information of the total transmission capacity becomes too high if the frame length is not above a certain minimum value.
  • the implementation constraints such as the processing power available in a node, will simply define the minimum frame size that can be processed in real-time.
  • This drawback also relates to the number of time slots in a frame; if a certain number of time slots is required in the frame, the minimum length of a time slot which can still be processed sets a limit below which the frame length cannot go.
  • the objective of the present invention is to obtain a solution by means of which the above-mentioned drawbacks relating to short frames can be eliminated, and to bring about a scheme, which enables a simple and controlled way for minimizing delay and delay variation in multi-hop packet networks.
  • the objective of the present invention is to bring about a scheduling method which enables effective delay control and minimization in synchronized multi-hop packet networks.
  • the present invention provides a network wide scheduling method for such traffic, which is sensitive to delay and/or to delay variation.
  • Other traffic is processed in a known manner, i.e. traffic, which does not belong to this category is transmitted in a known manner according to the capacity available at each time.
  • the solution is primarily intended for delay sensitive traffic, but since the correct operation of the method results in practically constant transmission delay, it is also suitable for traffic, which is sensitive to delay variation.
  • a synchronized packet network all the nodes are synchronized to a common time sequence, which recurs in time domain and includes transmission periods for both control information and (user) data.
  • the idea according to the invention is to introduce transmission periods (which are also called reservation periods) into the time sequence so that a data packet can be transferred across the network within a single time sequence.
  • the nodes of the network or the hops between the nodes
  • the nodes of the network are grouped into several groups according to their location in the network
  • the data portion of the time sequence is divided into successive reservation periods allocated to the groups
  • the groups and the reservation periods are associated with each other so that the position of an individual reservation period within the time sequence depends on the location of the corresponding group(s) within the network.
  • the data portion is divided into successive reservation periods for two transmission directions so that the reservation periods of both transmission directions occur simultaneously.
  • the time sequence is covered by a single frame and the data portion of the frame is divided into reservation periods of unequal lengths, the length of each period being inversely proportional to the distance at which the group(s) is/are from a certain center node relaying the largest amount of traffic.
  • the scheduling method according to the invention offers a simple way of minimizing the delay and delay variation, and therefore applications whose delay requirements have been difficult to support in (complex) mesh networks can now be made available in these networks.
  • the present invention is applicable in a synchronized multi-hop network, i.e. in a network implemented with similar devices utilizing the same MAC (Media Access Control) frames.
  • MAC Media Access Control
  • a prerequisite for the system is that it provides a time sequence, which recurs in the time domain and in which time is allocated for the transmission of both control and data packets.
  • the time sequence can consist of one or more frames. The time sequence typically repeats itself at regular intervals.
  • the distance from the center node to another node is measured as the number of hops required to reach said node from the center node.
  • the number associated with each node indicates the distance in hops from the center node to the node along the shortest path.
  • there are several shortest paths available and thus the intrinsic redundancy of a mesh network is still preserved, even though a huge amount of possible paths are discarded due to more hops than the optimal number of hops.
  • FIG 3 illustrates a more simplistic model of the network of Figure 2.
  • n 1,2,...,5 hops from the sink node
  • the traffic tends to flow inwards and outwards through the sink node.
  • the majority of applications lay in the network behind the sink node. This is the situation in many networks, for example in access networks.
  • T node is the average traffic generated by a node and i is the number of levels outside the particular node's level.
  • Figure 4 illustrates the first embodiment of the invention, intended for a multi-frame system, i.e. for a system where the time sequence T which recurs in a similar format and includes transmission periods for both control and data packets, contains a plurality of frames.
  • the frames F are relatively short as compared to the length of the time sequence T.
  • Figure 4 relates to a five level mesh according to Figures 2 and 3, it is applicable to any other number of levels.
  • part of the frames include both signaling (i.e. control) information and data, whereas the other frames include only data.
  • one out of N frames includes a control period (control packets), N being the number of levels outside the center node.
  • the data portion within the time sequence T is divided into several reservation periods, each period being allocated to transmission from a certain level to the neighboring level in accordance with the location of said levels in the network.
  • the first reservation period RP1 is scheduled (reserved) for delay sensitive traffic from the center node to the nodes on the first level
  • the second reservation period RP2 is scheduled for delay sensitive traffic from the first level to the second level
  • the fifth reservation period RP5 is reserved for the delay sensitive traffic from the fourth level to the fifth level.
  • the length of a reservation period corresponds otherwise to the length of a frame (or the data period within a frame with a control period), except that there is an empty period EP between two successive reservation periods in order to ensure enough processing time for the packets.
  • the length of each empty period can be of the order of one slot, provided that the length of the slot has been specified so that it can accommodate a packet of minimum length (i.e. the shortest possible burst).
  • Each reservation period is also allocated to traffic in the uplink direction (towards the center node). However, in this case the reservation order is the opposite; the first reservation period is scheduled for delay sensitive traffic from the fifth to the fourth level, the second reservation period for delay sensitive traffic from the fourth to the third level, etc, and the fifth reservation period is reserved for the delay sensitive traffic from the first level to the center node.
  • an uplink reservation scheme is used simultaneously with a downlink reservation scheme.
  • the reservation periods are preferably further divided into time slots and the scheduling of the time slots of each reservation period is negotiated among the nodes in the neighborhood, utilizing the control period.
  • Figure 5 illustrates the second embodiment of the invention, which is intended for a single frame system, i.e. for a system where the time sequence T contains only one frame.
  • the time sequence T contains only one frame.
  • sections are also reserved in a way that enables relaying the data several times during the same frame, preferably from the center node to the outermost level, or vice versa.
  • the uplink reservation scheme is used simultaneously with the downlink reservation scheme.
  • the data portion within the time sequence T is divided into several reservation periods, each period being allocated to transmission from a certain level to the neighboring level in accordance with the location of the connecting hop in the network.
  • the amount of time scheduled to the traffic of a certain hop depends on the hop in question, and the reservation periods are therefore separate in each transmission direction. The closer the hop is to the center node the more time is scheduled for the traffic. In this example 1/3 of the data portion is allocated to the traffic of the center node in each transmission direction. This means that up to 2/3 of the traffic through the center node can be delay sensitive.
  • the second embodiment is preferable in the sense that it enables more flexibility in distributing the reservation slots according to the network structure and traffic needs, especially in view of the traffic concentration around the center node.
  • the center node is always involved in the transmission.
  • an arbitrary number of the nodes on the associated levels can transmit or receive.
  • These transmissions can be simultaneous if they can be separated from each other, i.e. it is not necessary to use time division within a reservation period, if there are means for separating simultaneous transmissions from each other.
  • the reservation periods 1 ⁇ 2 and 2 ⁇ 1 are simultaneous in the example of Figure 5, the transmissions do not necessarily interfere with each other, even though they are simultaneous. This is because the nodes on levels 1 and 2 are already located in a rather large area and the number of possible hops between these levels is also large.
  • Persistent reservations are preferable for the delay sensitive traffic, and thus they are the above-described reservations. Persistent reservations are based on an estimate of the incoming data and they are made for a longer period of time. Due to the uncertaintity in filling up the persistent reservations, it is preferable to avoid excessive persistent reservations to ensure maximum available capacity. Normal reservations, in turn, are made for a known amount of data for a known period, and they are preferably made for normal traffic, which is not sensitive to delay (or delay variation).
  • a node and its neighboring nodes form a neighborhood.
  • a node on level i has neighbors on levels i-1, i, and i+1, except the center node or the nodes on the outermost level.
  • a node agrees about the reservations with all the nodes within its neighborhood.
  • the scheduling method according to the invention is not tied to any physical technology and therefore the underlaying physical layer can be implemented by many technologies used at present or in the future.
  • the hops can be wireless or wireline connections.
  • different transmissions must be separated from each other in order that they do not cause excessive interference with each other. This separation can be performed by frequency, time, space, code or any combination of these.
  • the time sequences or frames are multi-dimensional in the sense that in the first dimension the separation of the transmissions is based on time (separate reservation periods), while in the other dimensions the separation can be based on time (time slots within the reservation periods), frequency, space or code, or to any combination of these.
  • the nodes on the outermost level can be geographically rather far away from each other and may therefore be able to re-use the same resource (such as a frequency).
  • space is the factor, which can separate the transmissions, even though they are simultaneous.
  • a short reservation period (such as reservation periods 4 ⁇ 5 and 5 ⁇ 4 in Figure 5) may therefore be quite sufficient, especially if simultaneous transmissions can be used within said reservation period.
  • the separation can only be made between neighborhoods with no connection, since all nodes within a single neighborhood should receive the same messages.
  • the traffic is more node-to-node-related, and in this case more separate communication channels are available.
  • the invention is applicable to any multi-hop network utilizing the same MAC frame or time sequence.
  • the scheme is especially powerful in wireless mesh applications. These are mostly fixed broadband access or transmission networks, but the invention is also applicable to moving ad-hoc networks.
  • these moving networks require that the scheme is adaptive and the reservation periods can be altered during the operation of the network according to the changes in the topology of the network. This adaptability can also be used for improving the performance if the network capacity is not fully utilized or the load is non-uniformly distributed in the network.
  • control data comprises only a predefined delimiter between the sequences.
  • control data portion reduces to such a delimiter indicating a boundary between two successive sequences.
  • the common time sequencing can also be implemented using variable length time sequencies, i.e. the length of the common time sequence can vary on a sequence-basis, provided that the nodes know the start and end points of each sequence and can adapt to this variation.
  • the solution according to the invention can be applied on a certain part of the network only.
  • the term "network” therefore also covers a sub-network of a larger network.
  • the invention can also be implemented in many ways within a single network. For example, different parts of a network can have different time sequences, with different scheduling schemes. Furthermore, the time sequence used in the network (or in a sub-network) can include several separate control and/or data periods.

Landscapes

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

Claims (18)

  1. Procédé de programmation de transferts de données dans un réseau de paquets à plusieurs bonds, comprenant plusieurs noeuds connectés les uns aux autres par des bonds et adaptés pour programmer leurs transmissions par lesdits bonds en fonction d'une séquence temporelle commune se reproduisant dans un domaine temporel et comprenant une partie de commande réservée pour la transmission d'au moins un paquet de commande et une partie de données réservée pour la transmission de paquets de données,
    caractérisé par les étapes consistant à
    - classifier le réseau en plusieurs niveaux par rapport à un certain noeud, chaque niveau comprenant les noeuds situés à la même distance dudit certain noeud, la distance étant mesurée en nombre de bonds le long du chemin le plus court dans le réseau,
    - diviser ladite partie de données en périodes de réservation successives, et
    - attribuer chaque période de réservation aux transmissions du trafic sensible au délai par les bonds entre deux niveaux voisins prédéterminés de sorte que l'emplacement d'une période de réservation dans la partie de données dépende au moins de l'emplacement dans le réseau des bonds auxquels le trafic de la période de réservation est attribué.
  2. Procédé selon la revendication 1, caractérisé par la division de ladite partie de données en périodes de réservation successives pour deux directions de transmission, ladite distance augmentant dans la première transmission et diminuant dans la deuxième direction de transmission.
  3. Procédé selon la revendication 2, caractérisé en ce que les périodes de réservation se produisent simultanément dans les deux directions de transmission.
  4. Procédé selon la revendication 3, caractérisé en ce que ladite étape de division comprend de laisser une période vide entre deux périodes de réservation successives.
  5. Procédé selon la revendication 2, caractérisé par la représentation de la séquence temporelle par une seule trame.
  6. Procédé selon la revendication 5, caractérisé par la division de ladite partie de données en périodes de réservation de longueurs inégales, la longueur de chaque période étant inversement proportionnelle à la distance à laquelle les bonds auxquels le trafic de la période de réservation est attribué, sont dudit certain noeud.
  7. Procédé selon la revendication 6, caractérisé par l'attribution d'au moins un tiers de la partie de données au trafic sensible au délai du noeud central dans chaque direction de transmission.
  8. Procédé selon la revendication 2, caractérisé par les étapes consistant à :
    - diviser la séquence temporelle en plusieurs trames,
    - utiliser la partie de commande en partie des trames, et
    - introduire pour chaque direction de transmission au moins une période de réservation dans chaque trame.
  9. Procédé selon la revendication 2, caractérisé par la programmation d'un autre trafic que ledit trafic sensible au délai à une quelconque période de réservation ayant une capacité libre.
  10. Procédé selon la revendication 2, caractérisé par l'étape supplémentaire de changement des longueurs des périodes de réservation.
  11. Procédé selon la revendication 1, caractérisé en ce que ladite partie de commande comprend un délimiteur prédéfini indiquant une frontière entre deux séquences temporelles successives.
  12. Réseau de paquets à plusieurs bonds comprenant plusieurs noeuds connectés les uns aux autres par des bonds et adaptés pour programmer leurs transmissions par lesdits bonds selon une séquence temporelle commune, qui se reproduit dans un domaine temporel et comprend une partie de commande réservée pour une transmission d'au moins un paquet de commande, et une partie de données réservée pour une transmission des paquets de données,
    caractérisé en ce qu'il comprend
    un moyen pour diviser au moins une partie des noeuds du réseau en plusieurs niveaux par rapport à un certain noeud, chaque niveau comprenant les noeuds situés à la même distance dudit certain noeud, la distance étant mesurée en nombre de bonds le long du chemin le plus court dans le réseau,
    et dans chaque noeud, un moyen est programmé pour transmettre un trafic sensible au délai dans une période dont l'emplacement dans la partie de données dépend au moins de l'emplacement du bond dans le réseau, auquel bond le trafic sensible au délai va être transmis.
  13. Réseau de paquets à plusieurs bonds selon la revendication 12,
    caractérisé en ce que dans chaque séquence temporelle,
    - ledit certain noeud et les noeuds sur le niveau avec la distance la plus importante comprennent un moyen programmé pour transmettre pendant une période de réservation, et
    d'autres noeuds comprennent un moyen programmé pour transmettre pendant deux périodes de réservation, une période de réservation étant pour une transmission dans la direction dans laquelle ladite distance augmente et l'autre période de réservation étant pour la direction dans laquelle ladite distance diminue.
  14. Réseau de paquets à plusieurs bonds selon la revendication 12, caractérisé en ce qu'au moins une partie des noeuds est connectée à un autre réseau par ledit certain noeud.
  15. Réseau de paquets à plusieurs bonds selon la revendication 12, caractérisé en ce que ladite partie de commande comprend un délimiteur prédéfini indiquant une frontière entre deux séquences temporelles successives.
  16. Noeud pour un réseau de paquets à plusieurs bonds, le noeud étant connecté à d'autres noeuds par des bonds et adapté pour programmer ses transmissions selon une séquence temporelle, qui se reproduit dans un domaine temporel et comprend une partie de commande réservée pour la transmission d'au moins un paquet de commande et une partie de données réservée pour la transmission de paquets de données,
    caractérisé en ce que
    le noeud comprend un moyen programmé pour transmettre un trafic sensible au délai pendant une période dont l'emplacement dans la partie de données dépend au moins de l'emplacement du bond dans le réseau, auquel bond le trafic sensible au délai va être transmis.
  17. Noeud selon la revendication 16, caractérisé en ce que deux périodes sont fournies pour le noeud, une étant fournie pour une direction de transmission dans laquelle la distance d'un autre noeud prédéterminé augmente et l'autre étant fournie pour une direction de transmission dans laquelle la distance dudit noeud prédéterminé diminue.
  18. Noeud selon la revendication 16, caractérisé en ce que ladite partie de commande comprend un délimiteur prédéfini indiquant une frontière entre deux séquences temporelles successives.
EP01980568A 2000-10-30 2001-10-26 Ordonnancement des transferts dans un reseau de communications Expired - Lifetime EP1330891B1 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
FI20002387 2000-10-30
FI20002387A FI110903B (fi) 2000-10-30 2000-10-30 Lähetysten ajoittaminen tietoliikennejärjestelmässä
PCT/FI2001/000934 WO2002037752A1 (fr) 2000-10-30 2001-10-26 Ordonnancement des transferts dans un reseau de communications

Publications (2)

Publication Number Publication Date
EP1330891A1 EP1330891A1 (fr) 2003-07-30
EP1330891B1 true EP1330891B1 (fr) 2007-12-19

Family

ID=8559400

Family Applications (1)

Application Number Title Priority Date Filing Date
EP01980568A Expired - Lifetime EP1330891B1 (fr) 2000-10-30 2001-10-26 Ordonnancement des transferts dans un reseau de communications

Country Status (7)

Country Link
US (1) US7769041B2 (fr)
EP (1) EP1330891B1 (fr)
AT (1) ATE381823T1 (fr)
AU (1) AU2002212382A1 (fr)
DE (1) DE60132006T2 (fr)
FI (1) FI110903B (fr)
WO (1) WO2002037752A1 (fr)

Families Citing this family (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1461907B1 (fr) * 2001-11-28 2013-01-16 Millennial Net Protocole de reseau pour un reseau sans fil ad hoc
RU2229771C2 (ru) * 2002-05-28 2004-05-27 Общество с ограниченной ответственностью "НАТА-ИНФО" Способ обмена информацией между устройствами локальной сети
TW200742378A (en) * 2006-02-28 2007-11-01 Nokia Corp Multicast group address signaling using MAC header for power save delivery in a wireless network
US7751396B2 (en) * 2006-02-28 2010-07-06 Nokia Corporation Multicast address signaling for power save delivery in a wireless network
KR101254801B1 (ko) * 2006-04-19 2013-04-15 삼성전자주식회사 패킷 데이터 통신 시스템에서 데이터 제어 채널의 송수신방법 및 장치
JP4902366B2 (ja) * 2006-06-21 2012-03-21 独立行政法人情報通信研究機構 無線通信システム
US20080117856A1 (en) * 2006-10-25 2008-05-22 Wong Wendy C Multi-phase frame structure to support multi-hop wireless broadband access communications
US8031604B2 (en) 2006-10-25 2011-10-04 Sydir Jaroslaw J Algorithm for grouping stations for transmission in a multi-phase frame structure to support multi-hop wireless broadband access communications
US8045505B2 (en) 2007-01-18 2011-10-25 Science Applications International Corporation Mechanism for automatic network formation and medium access coordination
US20080205281A1 (en) * 2007-02-28 2008-08-28 Haihong Zheng Scheduling synchronization techniques for wireless networks
US20090069041A1 (en) * 2007-09-11 2009-03-12 Qualcomm Incoporated Scheduling information transfer
JP5152967B2 (ja) 2007-10-12 2013-02-27 パナソニック株式会社 通信方法、通信装置、及び通信システム、
WO2010018643A1 (fr) * 2008-08-12 2010-02-18 株式会社日立コミュニケーションテクノロジー Système de radiocommunication, dispositif de radiocommunication et procédé de gestion de ressource radio
US8949436B2 (en) * 2009-12-18 2015-02-03 Alcatel Lucent System and method for controlling peer-to-peer connections
DE102011112047A1 (de) * 2011-09-01 2013-03-07 Techem Energy Services Gmbh Verfahren und Gerät zur Übertragung von Daten in einem hierarchisch gegliederten Funknetzwerk
MY164428A (en) 2012-05-11 2017-12-15 Mimos Berhad A method and system for transmitting and receiving data packets in a wireless multi-hop network
US9202371B2 (en) 2012-07-17 2015-12-01 Robert Bosch Gmbh Method for robust data collection schemes for large grid wireless networks
US9202370B2 (en) 2012-07-17 2015-12-01 Robert Bosch Gmbh Method for robust wireless monitoring and tracking of solar trackers in commercial solar power plants
US9202369B2 (en) 2012-07-17 2015-12-01 Robert Bosch Gmbh Method for robust wireless monitoring and tracking of solar trackers in commercial solar power plants
JP2014137732A (ja) * 2013-01-17 2014-07-28 Fujitsu Ltd 情報処理システム及び情報処理システムの制御方法
US10404608B2 (en) * 2014-10-31 2019-09-03 Huawei Technologies Co., Ltd. Systems, devices, and methods for low-jitter communication over a packet-switched network
US10187285B2 (en) * 2015-06-02 2019-01-22 Texas Instruments Incorporated Adaptive time slot allocation to reduce latency and power consumption in a time slotted channel hopping wireless communication network
EP3294014B1 (fr) * 2016-09-08 2019-12-18 ADVA Optical Networking SE Procédé permettant de programmer une transmission de paquets dans un réseau
EP3667951B1 (fr) * 2018-12-13 2022-06-29 ADVA Optical Networking SE Détermination de la latence d'une liaison de transmission optique
JP7637931B2 (ja) * 2021-12-16 2025-03-03 パナソニックＩｐマネジメント株式会社 警報システム、警報器、転送方法、プログラム
US20250175437A1 (en) * 2023-11-29 2025-05-29 Cisco Technology, Inc. Coalescing public internet packets into jumbo frames between sd-wan provider network services

Family Cites Families (35)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4878219A (en) * 1988-04-28 1989-10-31 Digital Equipment Corporation Method and apparatus for nodes in network to avoid shrinkage of an interframe gap
US6389010B1 (en) * 1995-10-05 2002-05-14 Intermec Ip Corp. Hierarchical data collection network supporting packetized voice communications among wireless terminals and telephones
US5297144A (en) * 1991-01-22 1994-03-22 Spectrix Corporation Reservation-based polling protocol for a wireless data communications network
US5229993A (en) * 1991-02-25 1993-07-20 Old Dominion University Control of access through local carrier sensing for high data rate networks and control of access of synchronous messages through circulating reservation packets
US5315636A (en) * 1991-06-28 1994-05-24 Network Access Corporation Personal telecommunications system
CA2113750C (fr) * 1993-04-30 1999-08-24 Hamid Ahmadi Un plan d'acces multiple pour reseaux locaux integres et mobiles
US5838696A (en) * 1994-02-16 1998-11-17 U.S. Philips Corporation Record carrier and devices for reading and recording such a record carrier
JP3500785B2 (ja) * 1995-07-12 2004-02-23 ソニー株式会社 通信制御方法及び電子機器
SE515901C2 (sv) * 1995-12-28 2001-10-22 Dynarc Ab Resursadministrering, plan och arrangemang
US5844894A (en) * 1996-02-29 1998-12-01 Ericsson Inc. Time-reuse partitioning system and methods for cellular radio telephone systems
US5838674A (en) * 1996-07-31 1998-11-17 Telefonaktiebolaget L M Ericsson Circuitry and method for time division multiple access communication system
US6335922B1 (en) * 1997-02-11 2002-01-01 Qualcomm Incorporated Method and apparatus for forward link rate scheduling
US6577610B1 (en) 1997-06-30 2003-06-10 Spacenet, Inc. Flex slotted Aloha transmission system and method
US6904110B2 (en) * 1997-07-31 2005-06-07 Francois Trans Channel equalization system and method
US6574211B2 (en) * 1997-11-03 2003-06-03 Qualcomm Incorporated Method and apparatus for high rate packet data transmission
US6236656B1 (en) * 1998-03-19 2001-05-22 Telefonaktiebolaget Lm Ericsson (Publ) Link-efficiency based scheduling in radio data communications systems
KR100290862B1 (ko) * 1998-04-02 2001-07-12 구자홍 이동통신시스템에서의패킷데이터를전송하기위한슬롯의구조
US6130881A (en) * 1998-04-20 2000-10-10 Sarnoff Corporation Traffic routing in small wireless data networks
US6246713B1 (en) * 1998-06-08 2001-06-12 Telefonaktiebolaget Lm Ericsson (Publ) Frequency-hopping in a bandwidth-on-demand system
US6317415B1 (en) * 1998-09-28 2001-11-13 Raytheon Company Method and system for communicating information in a network
US20020167918A1 (en) * 1998-12-24 2002-11-14 Brewer Charles R. Real-time satellite communication system using separate control and data transmission paths
US7184413B2 (en) 1999-02-10 2007-02-27 Nokia Inc. Adaptive communication protocol for wireless networks
JP3319723B2 (ja) * 1999-04-02 2002-09-03 日本電気株式会社 スイッチ及びそのスケジューラ並びにスイッチスケジューリング方法
JP2003500951A (ja) * 1999-05-21 2003-01-07 コーニンクレッカ フィリップス エレクトロニクス エヌ ヴィ 可変チャネルローディング式セルラー通信システム
US6788702B1 (en) * 1999-10-15 2004-09-07 Nokia Wireless Routers, Inc. Protocol for neighborhood-established transmission scheduling
US6748233B1 (en) * 1999-10-28 2004-06-08 Telcordia Technologies, Inc. System and method for energy-efficient transmission power control, routing and transmission scheduling in wireless communication networks
US6697334B1 (en) * 2000-01-18 2004-02-24 At&T Corp. Method for designing a network
AU2001230424A1 (en) * 2000-01-20 2001-07-31 Nortel Networks Limited Frame structure for variable rate wireless channels transmitting high speed data
US6721290B1 (en) * 2000-04-03 2004-04-13 Hrl Laboratories, Llc Method and apparatus for multicasting real time traffic in wireless ad-hoc networks
US6735178B1 (en) * 2000-05-10 2004-05-11 Ricochet Networks, Inc. Method for maximizing throughput for multiple links using directional elements
AU2001269827A1 (en) * 2000-06-16 2002-01-02 The Regents Of The University Of California Bandwidth efficient source tracing (best) routing protocol for wireless networks
US6973089B1 (en) * 2000-06-21 2005-12-06 Northrop Grumman Corporation Beam hopping self addressed packet switched communication system with locally intelligent scheduling
US7068974B1 (en) * 2000-06-21 2006-06-27 Northrop Grumman Corporation Beam hopping self addressed packet switched communication system with power gating
US6928061B1 (en) * 2000-09-06 2005-08-09 Nokia, Inc. Transmission-scheduling coordination among collocated internet radios
WO2002028020A2 (fr) * 2000-09-29 2002-04-04 The Regents Of The University Of California Systeme et procede d'acces de reseau ad hoc au moyen du choix reparti d'un calendrier d'emission partage

Also Published As

Publication number Publication date
FI20002387A0 (fi) 2000-10-30
US7769041B2 (en) 2010-08-03
US20040047293A1 (en) 2004-03-11
WO2002037752A1 (fr) 2002-05-10
FI20002387L (fi) 2002-05-01
DE60132006T2 (de) 2008-04-10
FI110903B (fi) 2003-04-15
EP1330891A1 (fr) 2003-07-30
DE60132006D1 (de) 2008-01-31
ATE381823T1 (de) 2008-01-15
AU2002212382A1 (en) 2002-05-15

Similar Documents

Publication Publication Date Title
EP1330891B1 (fr) Ordonnancement des transferts dans un reseau de communications
US7693122B2 (en) Resource reservation in a wireless network with distributed medium access control
US8837345B2 (en) Wireless broadband systems with relay stations
US6198728B1 (en) Medium access control (MAC) protocol for wireless ATM
EP1059773B1 (fr) Protocole pour communications de données par paquets, en particulier dans réseau sans fil avec une topologie maillée
KR100564778B1 (ko) 무선자원 할당 방법 및 기지국장치
US6711177B1 (en) Method and apparatus for managing communication resources using frame fitting
CN113939030B (zh) 一种基于节点优先级的动态tdma时隙分配方法
JPH07303090A (ja) スペクトル使用の最適化システム及び方法
US20080170544A1 (en) Method of transmitting between two nodes
EP3860302B1 (fr) Procédés, systèmes et dispositifs pour communications sans fil basées sur des schémas de modulation numérique ofdma
CN101124846B (zh) 无线电通信系统的通信方法、无线电台和无线电通信系统
CN121284723A (zh) Tsch无线通信网络中的自适应时隙分配
EP2178328A2 (fr) Procédé de transmission de données dans un réseau maillé
US20030214933A1 (en) System and method for single-point to fixed-multipoint data communication
EP2242326B1 (fr) Système de réseau, procédé de retransmission de paquets, et support d'enregistrement
JP2006157640A (ja) 無線通信システム
EP2210380A1 (fr) Affectation de largeur de bande
CN113455046B (zh) 用于在无线通信系统中分配资源的方法
Liao et al. An efficient scheduling algorithm for radio resource reuse in IEEE 802.16 j multi-hop relay networks
Foudriat et al. H3M—A Rapidly Deployable Architecture with QoS Provisioning forWireless Networks
Zeng et al. Bandwidth guaranteed shortest path routing in wireless mesh networks
JP3571010B2 (ja) 無線パケット通信方法
JPWO2005094010A1 (ja) 通信システム

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

17P Request for examination filed

Effective date: 20030220

AK Designated contracting states

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

AX Request for extension of the european patent

Extension state: AL LT LV MK RO SI

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

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

Owner name: SPYDER NAVIGATIONS LLC

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REF Corresponds to:

Ref document number: 60132006

Country of ref document: DE

Date of ref document: 20080131

Kind code of ref document: P

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20071219

Ref country code: CH

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20071219

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080319

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20071219

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20071219

NLV1 Nl: lapsed or annulled due to failure to fulfill the requirements of art. 29p and 29m of the patents act
REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

ET Fr: translation filed
PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20071219

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080330

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20071219

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080519

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

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

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20071219

26N No opposition filed

Effective date: 20080922

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080320

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20081031

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20071219

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20081027

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20081026

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20071219

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20081031

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 16

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 17

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 18

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20200930

Year of fee payment: 20

Ref country code: FR

Payment date: 20200923

Year of fee payment: 20

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20200916

Year of fee payment: 20

REG Reference to a national code

Ref country code: DE

Ref legal event code: R071

Ref document number: 60132006

Country of ref document: DE

REG Reference to a national code

Ref country code: GB

Ref legal event code: PE20

Expiry date: 20211025

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION

Effective date: 20211025