ES2350516T3 - Procedure to transmit application data with different quality requirements. - Google Patents

Procedure to transmit application data with different quality requirements. Download PDF

Info

Publication number
ES2350516T3
ES2350516T3 ES01995603T ES01995603T ES2350516T3 ES 2350516 T3 ES2350516 T3 ES 2350516T3 ES 01995603 T ES01995603 T ES 01995603T ES 01995603 T ES01995603 T ES 01995603T ES 2350516 T3 ES2350516 T3 ES 2350516T3
Authority
ES
Spain
Prior art keywords
data
application
transmission
communication
procedure
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.)
Active
Application number
ES01995603T
Other languages
Spanish (es)
Inventor
Jens Hofmann
Jens Schneider
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.)
Nokia Solutions and Networks GmbH and Co KG
Original Assignee
Nokia Solutions and Networks GmbH and Co KG
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 Nokia Solutions and Networks GmbH and Co KG filed Critical Nokia Solutions and Networks GmbH and Co KG
Priority to PCT/DE2001/004724 priority Critical patent/WO2003055154A1/en
Application granted granted Critical
Publication of ES2350516T3 publication Critical patent/ES2350516T3/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/70Admission control or resource allocation
    • H04L47/80Actions related to the nature of the flow or the user
    • H04L47/805QOS or priority aware
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/10Flow control or congestion control
    • H04L47/15Flow control or congestion control in relation to multipoint traffic
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/10Flow control or congestion control
    • H04L47/18End to end
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/10Flow control or congestion control
    • H04L47/24Flow control or congestion control depending on the type of traffic, e.g. priority or quality of service [QoS]
    • H04L47/2416Real time traffic
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/10Flow control or congestion control
    • H04L47/24Flow control or congestion control depending on the type of traffic, e.g. priority or quality of service [QoS]
    • H04L47/2425Service specification, e.g. SLA
    • H04L47/2433Allocation of priorities to traffic types
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/70Admission control or resource allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/70Admission control or resource allocation
    • H04L47/72Reservation actions
    • H04L47/724Reservation actions involving intermediate nodes, e.g. RSVP
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/70Admission control or resource allocation
    • H04L47/80Actions related to the nature of the flow or the user
    • H04L47/801Real time traffic
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/70Admission control or resource allocation
    • H04L47/80Actions related to the nature of the flow or the user
    • H04L47/803Application aware

Abstract

Procedure for transmitting data (6) of applications with different transmission requirements in a data communication network (1) with packet switching with communication nodes (2, 5, 7), the procedure presenting at least the following steps: a . limitation of the data (6) of each application at a predetermined bit rate in a communication node (2, 5, 7) to be traversed during the transmission of the data (6) of the corresponding application, b. creation and memorization of specific application contexts in all communication nodes (2, 5, 7) to be traversed during the transmission of data (6) of the corresponding application, c. reservation of transmission resources in all communication nodes (2, 5, 7) to be traversed during the transmission of data (6) of the corresponding application depending on the specific contexts of the application, d. retransmission of the data (6) of each application from a communication node (2, 5, 7) to be traversed through the corresponding application to another communication node (2, 5, 7) to be traversed depending on the specific contexts of the application.

Description

Procedure to transmit data from applications with different quality requirements.

The present invention relates to a procedure to transmit data from applications with different requirements regarding the quality of a transmission service in a data communication network with packet switching.

In data communication networks with packet switching with for example transmission mechanisms based on IP, different types of data are transmitted from various applications through a network from a source to a destination. In this regard, the requirements vary according to the type and form of transmission. between various applications very strongly. This is so in particular for the transmission of data of applications that demand a real-time transmission and / or with a bit rate guaranteed against a data transmission in which no formulates no strict requirement of a real-time transmission and / or a guarantee of a bit rate. Applications with a transmission requirement in real time and with a bit rate guaranteed are for example voice telephony, online radio and Video streaming Electronic mail services or Internet applications, such as web-surfen, on the other hand they have no requirement comparable to transmission.

US 2001/025310 A1 describes a method for processing data with different QoS requirements (a quality of service) in a network. The principle described here it consists of providing each data packet with information on the required transmission quality. Then they are defined in a network of data certain quality classes that adequately reflect the requirement to the transmission. Each data packet is assigned to a QoS class and is provided with the corresponding information. Each node of the network that retransmits data in such a network, prioritizes the Relay of the packet based on the QoS information that is found in each data packet. This means that in each data packet must be explicitly available a Information about the Quality of Service.

An essential feature of the networks of data communication with packet switching is that a data transmission does not take place through data paths dedicated switching, but through virtual data paths according to the principle of statistical multiplexing. Low multiplexed it is understood then the simultaneous transmission of several information through the same transmission route on the basis of the statistical distribution over time of the different information. The data that is usually transmitted in such networks are characterized by a so-called "burst" feature or bursts, that is, by oscillations in time of its width of band. To transmit the data effectively, they are added the same in general between communication nodes of the network of data communication with packet switching and are transmitted in based on statistical hypotheses together through existing transport, that is, through data paths virtual from one communication node to another communication node. Do not There is no exclusive provision of resources of transmission for individual applications on a "point to dot. "By statistical multiplexing they take advantage of Effectively existing transmission resources. Contrary to this, in data communication networks with line switching is made available for each application a own route through the data communication network, on the which guarantees both the transmission time and the bandwidth In the event that data is transmitted here with a variable bit rate, the width of band available in case of pauses or low speed periods of data.

Each application of a communication network packet switched data requires while the application lasts of the data communication network certain resources in terms of transfer capacity to make communication possible "point by point". In mobile data communication networks with packet switching is placed for this on each node of affected communication that has to go through a so-called context with a corresponding parameter block. A context contains all the relevant information that sufficiently describe the necessary service for data transmission. In particular each data communication network application requires a certain transmission service with a certain quality (QoS, Quality of Service) This requirement is characterized by the so-called parameters QoS, such as a maximum bit rate, a speed of bits to be guaranteed and a maximum allowable delay. When you create a context, manages each communication node based on its existing resources these QoS parameters, dealing with the parameters in each case staggered. The transmission of data from the corresponding application is then made based on these QoS parameters that are the same and that are treated and memorized in all communication nodes to cross.

The problem of data transmission from applications with different demands on transmission quality It was resolved so far in different ways.

There is a QoS architecture of 3GPP (TS 23.107) which describes certain QoS functions for telephone networks Third generation mobile (UMTS). However, the realization in each communication node it is not specified more accurately. In addition, there are principles that describe transmission procedures of application data with different QoS requirements in a network of data communication

A first principle is to provide each data packet of a transmission quality information required. Then they are defined in a data communication network certain quality classes, which adequately reflect the transmission requirements. These classes are called classes Quality of Service Each data packet is assigned to a QoS class and is provided with the corresponding information. Each node of communication to be traversed that retransmits data in such a network of data communication prioritizes the retransmission of a packet of data based on the QoS information found in each package of data. A usual treatment is then to distribute the packages based on the QoS information contained therein between corresponding queues (queues). These queues are empty and retransmit based on your QoS class with different speed. Through this principle statistically increases the probability that a high priority data packet will be drive through the data communication network much more quickly than a data package with lower priority. In this principle is an inconvenience that does not give any transmission time guaranteed or guaranteed transmission speed within the network of data communication. Other drawbacks are that data packets with a requirement for a time transmission real are memorized temporarily in each queue and with it They slow down. It is also an inconvenience that the information on the membership in a QoS class must be contained in each package of data and that the format of this information must be the same in All data communication network. This principle is described by example in the RFC 2474 standard of the IETF (Internet Engineering Task Force)

A second principle to solve the problem described above is to establish for each class of QoS different data paths within the data communication network. When a communication node can associate a data packet with a QoS class, this packet of data is retransmitted on a route of data that corresponds to this class of QoS.

A drawback in this procedure are the establishment and service costs of a large number of routes different of different quality between different communication nodes. The establishment of different routes of different QoS classes has been defined in various standards, for example in the specification Traffic Management of the ATM forum, called also AF-TM-0121,000.

A third principle is to limit the access node in the data communication network, a so-called Edge Node, the total traffic to a previously defined traffic. Within the data communication network no longer differentiates this traffic, since that it is assumed that the data communication network is sufficiently sized. The drawback of this principle is lack of guarantee in terms of transmission time and speed of transmission. This principle is specified for example by the Service IETF Level Agreement Working Group.

It was a task of the invention to put provision of a procedure whose help can be transmitted application data with different transmission requirements with the highest possible efficiency and avoiding the inconveniences explained within a data communication network.

This task is solved by the procedure. corresponding to the invention according to claim 1. Other advantageous constructive forms of the procedure corresponding to The invention is indicated in the dependent claims.

According to claim 1 it is made available a procedure to transmit data from applications with different quality requirements in a data communication network with packet switching with communication nodes, presenting the procedure at least the following stages:

to.
data limitation of each application at a predetermined bit rate on a node of communication to go through during the transmission of data from the corresponding application,

b.
context creation and memorization specific to the application in all communication nodes to traverse during the transmission of the corresponding data application,

C.
reservation of transmission resources in all communication nodes to pass through during transmission of the corresponding application data based on the application specific contexts,

d.
retransmission of the data of each application from a communication node to cross through the corresponding application to another communication node to cross depending on the specific contexts of the application.

In a preferred embodiment of the procedure corresponding to the invention stage a is performed on an access communication node (Edge Node) to the network of packet switching data communication. A data flow that arrives from an application is limited to a bit rate predetermined, preferably at a maximum data rate allowable determined by the existing resources in the network of data communication This ensures that it is no longer possible. an inadmissible overflow in the communication nodes to go through the data communication network.

Especially preferably, the data limitation of each application at a data rate default measuring, in parallel to the retransmission of the data of the corresponding application, the amount of this data at over a period of time that can be set and compared with the amount of data corresponding to the bit rate default This means that throughout a given time interval (measurement interval) the size of the packets of data that arrive in parallel to its retransmission. This value reflects the amount of data within this range of weather. If for example the maximum amount of data is reached allowable corresponding to the maximum bit rate in this time interval, this information can be used to decide if the data packets that follow are rejected or eventually continue transporting, in the event that the total resources of the communication node allow it. At the beginning of each following measurement range begins a new sum of the size of the data packets, this sum can also be split from a value of non-zero start-up, for example bursts (bursts) precedents. With this, on the one hand, the delay of data packets and, on the other, avoid exceeding the speed of data agreed on the following communication nodes. Simultaneously they no longer need all the other nodes of communication to go through this data path in the network of data communication no bit rate monitoring maximum allowable

In a preferred embodiment of the procedure corresponding to the invention (in step c), deduces each communication node to go through the data of the corresponding application, from a bit rate guaranteed required by the corresponding application and of a maximum bit rate to support, a value in bandwidth for a transmission resource to reserve and reserve it.

In another preferred embodiment of the procedure corresponding to the invention stage c is performed of the procedure only for application data that requires a real time transmission This means that by establishing a context for an application with the requirement of a transmission in real time (real time application) deduces each node from communication to go through, from bit rate Guaranteed required and the maximum bit rate to support, a certain bandwidth value for a resource to reserve (B_ {EchtAppl}) And reserve this bandwidth for this application. When calculating the bit rate to reserve, they can also intervene measurements on the effective need for active application resources that have previously been active. In general is reserved for all real-time traffic on nodes of communication a certain part of the resources (B_ {SumEcht}) of the entire transmission width B_ {total}. This means that the value of the bandwidth intended for the application (B_ {EchtAppl}) is taken from part B_ {SumEcht} reserved for Real time traffic. This provides the application of width band (B_ {EchtAppl}) of the communication node. At the end of the application these reserved resources are released again. The part B_ {SumEcht} reserved for real-time traffic is chosen preferably always less than the entire bandwidth of the node Communication. This ensures that on the one hand there is of a certain proportion of resources for applications that do not they require a real-time transmission (non-time applications real) and that on the other hand brief overflows of the width of reserved band (bursts) for real time applications can be transmitted equally. For applications without the requirement of real-time transmission without guaranteed data speed, no bandwidth is reserved for an application individual. Instead, the unreserved part is kept free. B_ {SumNichtEcht} of all resources for all applications of this type (B_ {SumNichtEcht} = B_ {total} - B_ {SumEcht}). TO at the same time they can use applications without the requirement of transmission in real time also always the resources that are maintained reserved for real-time applications but that temporarily They are not used by them. Through statistical multiplexing data from this application can be transported with a certain probability. If the actual amount of traffic data is not time actual exceeds the available bandwidth for it, it delay or reject this traffic.

The sum of data actually to be transported from Real-time applications can exceed resources reserved for it. This is the case for example when they arrive data streams with maximum bit rate for all or for many real-time applications at the same time to the node of communications and for these services a width of lower band If this case arises, parts are also used of the planned resources for non-real-time applications to the transport of real-time application data. Correspondingly, less resources are then available for data transmission of applications that are not real time. From the proportion of reserved resources B_ {SumEcht} and the algorithm Calculation for the bandwidth to be reserved depends to what extent Real-time application data can exceed reserved resources and what is the probability that they are transported data from applications that are not real time. Then can also play a role, among others, the amount of data flows Statistically multiplexed applications. The higher the proportion reserved for real-time applications, both less is the probability that overflows can be transmitted temporary (bursts) of reserved bandwidth. The older be the proportion reserved for real-time applications, both the lower the probability that data will be transported from applications that are not in real time.

In a way of execution especially Preferred process according to the invention, can influence this behavior in the activation of a context, that is, when treating the QoS parameters. When creating contexts specific to the applications in each communications node, it may vary advantageously and thereby limit the relationship between a guaranteed data rate required by the corresponding application and maximum bit rate to support.

In the context of the invention it is also possible under certain hypotheses to carry out a data transmission to real-time applications up to the maximum bit rate guaranteed B_ {maxEchtAppl} on each communication node without in the transmission of this data and with the bit rate guaranteed, it will reach stagnations or reject packages of data. On the one hand they should be distributed statistically bursts, that is, brief shipping with high data speed. Then it is not exceeded with great probability the sum of the reserved bandwidths B_ {SumEcht} In the case of overflows, a part of the Resources reserved for non-real-time applications. Then no must exceed the sum of the maximum bit rate of all contexts the total resources of a communication node a measure determined according to the usual sizing methods.

In another preferred embodiment of the procedure corresponding to the invention, are divided in the step d of the procedure corresponding to the invention the data of the applications depending on the specific contexts of the applications in at least two categories and are retransmitted based on of these categories. These two categories advantageously mean at least the division into real-time applications and applications Not real time. This categorization is preferably done in each communication node and takes place, as indicated, according to the existing contexts in the communication node. Every data packet that has been assigned to an application on time real, it is retransmitted immediately without intermediate memorization to Next communication node. The packages without time requirement real can be memorized temporarily in queues (queues) and retransmit based on a particular mechanism of choice from the queue. This mechanism of choice can by example distribute the transfer resources available to all traffic not real time or for parts thereof according to a predefined scheme or perform a simple prioritization of queues The transfer resources available for non-real-time data then depends on the momentary influx of real time data.

The special advantage of the present invention resides in that combining the mechanisms described as reserve of transfer resources, limitation of data flows of different applications at maximum data rate and prioritization of different categories of aggregated data flows in the processing and transport of these data streams, you can ensure a transmission as effective as possible and adapted to the individual needs of the most diverse applications.

Other advantages of the corresponding procedure to the invention will be shown in the following figures. It shows in:

Figure 1 block diagram for the schematic representation of stage a in a constructive way of the procedure corresponding to the invention,

Figure 2 block diagram for the schematic representation of stage d in a constructive way of the procedure corresponding to the invention.

Figure 1 shows a diagram of blocks to describe a possibility of limiting the data of a application at a predetermined bit rate. The data of a application reach the data communication network 1 through a access node (Edge Node) 2. To achieve the least delay possible on the Edge Node 2 and to give up a memorization intermediate to find out the bit rate of the data that arrive, this process can be carried out as follows: Throughout a certain time interval (measurement interval) is added the size of data packets that arrive in parallel to their retransmission as indicated by the date felt "uplink" (ascending), which is represented in diagram 3. This value reflects the amount of data in this time interval. If the corresponding maximum permissible amount of data is reached at the maximum bit rate B_ {max} within this range, then this information can be used to decide if reject the data that follows, as depicted in the diagram 4, or if they are eventually retransmitted, since the total resources Edge Note 3 allows it. The same mechanism is performed in the inverse sense, that is, in the "dowlink" sense (falling). At the beginning of the next time interval or of a measurement interval, a new sum of the sizes of data packets, this sum can also be split from a value non-zero boot, to take into account for example bursts With this, on the one hand, packet delay is minimized of data and on the other hand it avoids exceeding the data rate agreed on the following communication nodes 5. Simultaneously they do not need to monitor the maximum speed of B_ {max} bits all other communication nodes 5 a cross.

A block diagram is shown in Figure 2 to schematically represent stage d of a form of Execution of the procedure corresponding to the invention. Be represents a retransmission of data packets 6 of various applications through a data communication network 1 that includes several communication nodes 7. When a request is made application, is created in the communication nodes 7 of the network data communication 1 to be traversed by the data or packets of data 6 of the requested application, a context, which contains between others the quality of transmission (QoS) to demand for the application. This request is determined by various parameters. Between they meet, a maximum bit rate, a speed of guaranteed bits and a maximum allowable delay. A packet of data 6 that reaches the data communication network 1 of an application will assign now, in communication nodes 7 to cross, depending on of the context created and memorized in the corresponding nodes of communication 7, to one of two categories 8, 9. In the examples represented correspond the two categories 8, 9 to a division into real-time applications (black stripes) 8 and non-applications real time (gray stripes) 9. This categorization is done in each communication node 7 to cross. Each 6 data packet that has been associated with a real-time application, it is retransmitted immediately without intermediate memorization to the next node of communication 7. Data packets 6 without real time requirement can be stored temporarily in queues or queues and retransmit based on a particular mechanism of choice to from the tail. This mechanism of choice can distribute the resources available for all data packets 6 of applications that are not real-time or for part of them according to a previously defined scheme or according to a simple queuing prioritization. The resources available for 6 data packages of non-real-time applications then depend on the momentary influx of data from Real time applications.

Claims (10)

1. Procedure for transmitting data (6) of applications with different transmission requirements in a network of data communication (1) with packet switching with nodes of communication (2, 5, 7), presenting the procedure at least following stages:
to.
data limitation (6) of each application at a predetermined bit rate on a node of communication (2, 5, 7) to go through during the transmission of data (6) of the corresponding application,
b.
context creation and memorization application-specific in all communication nodes (2, 5, 7) to pass through during the transmission of the data (6) of the corresponding application,
C.
reservation of transmission resources in all communication nodes (2, 5, 7) to go through during the data transmission (6) of the corresponding application in function of the specific contexts of the application,
d.
retransmission of data (6) of each application from a communication node (2, 5, 7) to cross through the corresponding application to another communication node (2, 5, 7) to cross according to the specific contexts of the application.
\ vskip1.000000 \ baselineskip
2. Method according to claim 1,
characterized in that step a is performed on an access communication node (Edge Node) in the packet-switched data communication network (1).
\ vskip1.000000 \ baselineskip
3. Method according to claim 1 or 2,
characterized in that the limitation of the data (6) of each application to a predetermined bit rate is performed by measuring in parallel to the retransmission of the data (6) of the corresponding application the amount of this data (6) along a time interval that can be set and comparing it with the amount of data corresponding to the predetermined bit rate.
\ vskip1.000000 \ baselineskip
4. Procedure according to one of the preceding claims,
characterized in that step c is only performed for data (6) of applications that require real-time transmission.
\ vskip1.000000 \ baselineskip
5. Procedure according to one of the preceding claims,
characterized in that in stage c each of the communication nodes (2, 5, 7) to be traversed by the data of the corresponding application is deducted and reserved from a guaranteed bit rate requested by the corresponding application and a speed of maximum bits to support, a bandwidth value for a transmission resource to reserve.
\ vskip1.000000 \ baselineskip
6. Procedure according to one of the preceding claims,
characterized in that when creating the specific contexts of the application in each communication node (2, 5, 7) the relationship between a guaranteed bit rate requested by the corresponding application and a maximum bit rate to support, may vary.
\ vskip1.000000 \ baselineskip
7. Procedure according to one of the preceding claims,
characterized in that a certain part (B_ {SumEcht}) of transmission resources among all transmission resources (B_ {total}) is reserved for application data that in each case requires a real-time transmission.
\ vskip1.000000 \ baselineskip
8. Method according to claim 7,
characterized in that the part (B_ {SumEcht}) of transmission resources that is reserved for data (6) of applications that require real-time transmission in each case, is chosen lower than the total transmission resources (B_ {total} ).
\ vskip1.000000 \ baselineskip
9. Procedure according to one of the preceding claims,
characterized in that in stage d the data (6) of the applications are divided according to the specific contexts of the application into at least two categories (8, 9) and are retransmitted according to these categories (8, 9).
\ vskip1.000000 \ baselineskip
10. Method according to claim 9,
characterized in that the two categories correspond to a division in real-time applications (8) and non-real-time applications (9).
ES01995603T 2001-12-10 2001-12-10 Procedure to transmit application data with different quality requirements. Active ES2350516T3 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/DE2001/004724 WO2003055154A1 (en) 2001-12-10 2001-12-10 Method for transmitting data of applications with different quality

Publications (1)

Publication Number Publication Date
ES2350516T3 true ES2350516T3 (en) 2011-01-24

Family

ID=5648326

Family Applications (1)

Application Number Title Priority Date Filing Date
ES01995603T Active ES2350516T3 (en) 2001-12-10 2001-12-10 Procedure to transmit application data with different quality requirements.

Country Status (12)

Country Link
US (1) US20050131984A1 (en)
EP (1) EP1451980B1 (en)
JP (1) JP2005513917A (en)
KR (1) KR100632529B1 (en)
CN (1) CN1293733C (en)
AT (1) AT477647T (en)
AU (1) AU2002226296A1 (en)
BR (1) BRPI0117193B1 (en)
DE (2) DE10197195D2 (en)
ES (1) ES2350516T3 (en)
PT (1) PT1451980E (en)
WO (1) WO2003055154A1 (en)

Families Citing this family (34)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7801171B2 (en) 2002-12-02 2010-09-21 Redknee Inc. Method for implementing an Open Charging (OC) middleware platform and gateway system
US7457865B2 (en) * 2003-01-23 2008-11-25 Redknee Inc. Method for implementing an internet protocol (IP) charging and rating middleware platform and gateway system
US7440441B2 (en) 2003-06-16 2008-10-21 Redknee Inc. Method and system for Multimedia Messaging Service (MMS) rating and billing
US7873347B2 (en) * 2003-06-19 2011-01-18 Redknee Inc. Method for implementing a Wireless Local Area Network (WLAN) gateway system
US8376855B2 (en) 2004-06-28 2013-02-19 Winview, Inc. Methods and apparatus for distributed gaming over a mobile device
US8870639B2 (en) 2004-06-28 2014-10-28 Winview, Inc. Methods and apparatus for distributed gaming over a mobile device
US10226698B1 (en) 2004-07-14 2019-03-12 Winview, Inc. Game of skill played by remote participants utilizing wireless devices in connection with a common game event
WO2007002284A2 (en) * 2005-06-20 2007-01-04 Airplay Network, Inc. Method of and system for managing client resources and assets for activities on computing devices
US9919210B2 (en) 2005-10-03 2018-03-20 Winview, Inc. Synchronized gaming and programming
US9511287B2 (en) 2005-10-03 2016-12-06 Winview, Inc. Cellular phone games based upon television archives
US8002618B1 (en) 2006-01-10 2011-08-23 Winview, Inc. Method of and system for conducting multiple contests of skill with a single performance
US10556183B2 (en) 2006-01-10 2020-02-11 Winview, Inc. Method of and system for conducting multiple contest of skill with a single performance
US9056251B2 (en) 2006-01-10 2015-06-16 Winview, Inc. Method of and system for conducting multiple contests of skill with a single performance
JP5046316B2 (en) * 2006-03-10 2012-10-10 富士通株式会社 Network management method, program and system
US8705195B2 (en) 2006-04-12 2014-04-22 Winview, Inc. Synchronized gaming and programming
US8149530B1 (en) 2006-04-12 2012-04-03 Winview, Inc. Methodology for equalizing systemic latencies in television reception in connection with games of skill played in connection with live television programming
US8775621B2 (en) * 2006-08-31 2014-07-08 Redknee Inc. Policy services
WO2009033249A1 (en) * 2007-09-13 2009-03-19 Redknee Inc. Billing profile manager
US8813112B1 (en) 2007-10-23 2014-08-19 Winview, Inc. Method of and apparatus for utilizing SMS while running an application on a mobile device controlling a viewer's participation with a broadcast
JP4951486B2 (en) * 2007-12-13 2012-06-13 株式会社日立産機システム Information processing apparatus and information processing method
US8428186B1 (en) 2007-12-27 2013-04-23 Exalt Communications Incorporated Decision directed DC offset removal
US9059871B2 (en) 2007-12-27 2015-06-16 Redknee Inc. Policy-based communication system and method
US9203928B2 (en) 2008-03-20 2015-12-01 Callahan Cellular L.L.C. Data storage and retrieval
US8458285B2 (en) 2008-03-20 2013-06-04 Post Dahl Co. Limited Liability Company Redundant data forwarding storage
US8452844B2 (en) 2008-05-07 2013-05-28 Tajitshu Transfer Limited Liability Company Deletion in data file forwarding framework
CN101621457B (en) * 2008-07-01 2012-05-23 大唐移动通信设备有限公司 Multi-service scheduling method and system
US8599678B2 (en) * 2008-07-10 2013-12-03 Tajitshu Transfer Limited Liability Company Media delivery in data forwarding storage network
US7636761B1 (en) * 2008-09-29 2009-12-22 Gene Fein Measurement in data forwarding storage
US9716918B1 (en) 2008-11-10 2017-07-25 Winview, Inc. Interactive advertising system
CN101772010B (en) * 2008-12-30 2012-09-05 联芯科技有限公司 Abnormal processing method for terminal and network for packet switching service district refreshment
US20110002230A1 (en) * 2009-07-02 2011-01-06 Research In Motion Limited Quality of Service Parameter Relaxation for Non-Conversational Voice Calls Over a Packet-Switched Network
US8611356B2 (en) 2009-11-13 2013-12-17 Exalt Communications Incorporated Apparatus for ethernet traffic aggregation of radio links
US8307111B1 (en) * 2010-04-13 2012-11-06 Qlogic, Corporation Systems and methods for bandwidth scavenging among a plurality of applications in a network
CN103297349B (en) * 2013-05-30 2017-04-05 北京蓝汛通信技术有限责任公司 A kind of method of adjustment and device of Internet resources presentation mode

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6473793B1 (en) * 1994-06-08 2002-10-29 Hughes Electronics Corporation Method and apparatus for selectively allocating and enforcing bandwidth usage requirements on network users
US5675573A (en) * 1995-03-22 1997-10-07 Lucent Technologies Inc. Delay-minimizing system with guaranteed bandwidth delivery for real-time traffic
US6282561B1 (en) * 1995-12-07 2001-08-28 Microsoft Corporation Method and system for resource management with independent real-time applications on a common set of machines
JP3193947B2 (en) * 1997-01-08 2001-07-30 株式会社ディジタル・ビジョン・ラボラトリーズ Data transmission system and data transmission method
US6104720A (en) * 1997-04-28 2000-08-15 Intel Corporation Dynamic communication path selection for data transmission between computers
US5996013A (en) * 1997-04-30 1999-11-30 International Business Machines Corporation Method and apparatus for resource allocation with guarantees
JP3803712B2 (en) * 1997-04-30 2006-08-02 富士通株式会社 Dynamic control method of bandwidth limit value for non-real-time communication
US6154776A (en) * 1998-03-20 2000-11-28 Sun Microsystems, Inc. Quality of service allocation on a network
EP1001574A1 (en) * 1998-11-10 2000-05-17 International Business Machines Corporation Method and system in a packet switching network for dynamically adjusting the bandwidth of a continuous bit rate virtual path connection according to the network load
US7149222B2 (en) * 1999-12-21 2006-12-12 Converged Access, Inc. Integrated access point network device
AU3486001A (en) * 2000-02-04 2001-08-14 Hrl Lab Llc A system for pricing-based quality of service (pqos) control in networks
EP1154664A1 (en) * 2000-05-09 2001-11-14 Lucent Technologies Inc. Resource reservation in 3G or future generation telecommunication network II
EP1154600A1 (en) * 2000-05-09 2001-11-14 Lucent Technologies Inc. Resource reservation in 3G or Future Generation telecommunication network (iv)
US6839808B2 (en) * 2001-07-06 2005-01-04 Juniper Networks, Inc. Processing cluster having multiple compute engines and shared tier one caches

Also Published As

Publication number Publication date
KR20040059493A (en) 2004-07-05
WO2003055154A1 (en) 2003-07-03
BRPI0117193B1 (en) 2015-07-28
DE50115595D1 (en) 2010-09-23
JP2005513917A (en) 2005-05-12
BR0117193A (en) 2004-11-09
AU2002226296A1 (en) 2003-07-09
KR100632529B1 (en) 2006-10-11
AT477647T (en) 2010-08-15
DE10197195D2 (en) 2004-10-28
PT1451980E (en) 2010-11-17
US20050131984A1 (en) 2005-06-16
EP1451980A1 (en) 2004-09-01
EP1451980B1 (en) 2010-08-11
CN1579069A (en) 2005-02-09
CN1293733C (en) 2007-01-03

Similar Documents

Publication Publication Date Title
JP4796157B2 (en) System and method for implementing resource allocation in network communications
CA2699325C (en) Method, system, and computer program product for adaptive congestion control on virtual lanes for data center ethernet architecture
Chen et al. An integrated QoS control architecture for IEEE 802.16 broadband wireless access systems
US7072336B2 (en) Communications using adaptive multi-rate codecs
EP0872988B1 (en) A method for supporting per-connection queuing for feedback-controlled traffic
JP3831628B2 (en) Improved quality of service control in mobile communication networks.
US7688731B2 (en) Traffic congestion
US6404735B1 (en) Methods and apparatus for distributed control of a multi-class network
US6879561B1 (en) Method and system for wireless packet scheduling with per packet QoS support and link adaptation
ES2201024T3 (en) Ip platform for advanced multipoint access systems.
US7327681B2 (en) Admission control method in internet differentiated service network
KR100822707B1 (en) Apparatus and method for managing quality of service in integrated network of heterogeneous mobile networks
US7706353B2 (en) Congestion control in connection-oriented packet-switching networks
KR101205805B1 (en) Method of providing resource admission control
US7817624B2 (en) Methods and systems for configuring voice over internet protocol network quality of service
US7729247B2 (en) Voice over internet protocol (VoIP) downlink packet scheduling apparatus and method in a mobile communication base station (BS) system
ES2376942T3 (en) SERVICE QUALITY PLANNING (QoS) SENSITIVE TO INTEGRATED PACKAGE LATENCY USING PROPORTIONAL EQUITY AND SETTING IN WEIGHTED EQUITABLE TAIL FOR WIRELESS INTEGRATED MULTIMEDIA PACKAGE SERVICES.
JP4078755B2 (en) Bandwidth monitoring method
US5970048A (en) Control of overload situations in frame relay network
US6438135B1 (en) Dynamic weighted round robin queuing
JP3597505B2 (en) Admission control method based on measurement using effective envelope and service curve
US6538989B1 (en) Packet network
EP2201730B1 (en) Method and arrangement for scheduling data packets in a communication network system
AU2002339313B2 (en) Distributed transmission of information in a connection-less packet-oriented communication network
EP2127254B1 (en) Quality of service (qos) class reordering with token retention