EP1794940A1 - Procede de gestion de la charge reseau dans un reseau de telephonie mobile - Google Patents

Procede de gestion de la charge reseau dans un reseau de telephonie mobile

Info

Publication number
EP1794940A1
EP1794940A1 EP05787122A EP05787122A EP1794940A1 EP 1794940 A1 EP1794940 A1 EP 1794940A1 EP 05787122 A EP05787122 A EP 05787122A EP 05787122 A EP05787122 A EP 05787122A EP 1794940 A1 EP1794940 A1 EP 1794940A1
Authority
EP
European Patent Office
Prior art keywords
network
data
packet
data packets
data flow
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP05787122A
Other languages
German (de)
English (en)
Inventor
Andras Balazs
Stefan Rugel
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
Siemens AG
Nokia Siemens 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 Siemens AG, Nokia Siemens Networks GmbH and Co KG filed Critical Siemens AG
Publication of EP1794940A1 publication Critical patent/EP1794940A1/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/10—Flow control between communication endpoints
    • H04W28/14—Flow control between communication endpoints using intermediate storage

Definitions

  • the invention relates to a method for network load shaping in a mobile radio network, in particular a GPRS or UMTS network.
  • the transmission of data takes place packet-oriented, ie in the form of data packets which form a data flow between a data source and a mobile radio terminal.
  • packet-oriented networks eg GSM networks
  • the data flow in packet-oriented networks is no longer available with an exclusive connection with fixed and reserved bandwidth. Rather, the data packets of a plurality of packet data flows are routed over the same connection paths. Thus compete Since ⁇ tenfladore among themselves for the respective directions Netzwerkein ⁇ available bandwidths.
  • data flow is seen an ensemble of data packets to ⁇ here, which is to transmit between a transmitter and a receiver over a network. This may be such as to obtain the transfer of data between a server and a client, for example.
  • a data flow can, however, also be a "data stream” in which not only the complete transmission of the data but also the data rate at the receiver arrives, for example for telephony or video applications ("streaming media").
  • the worldwide Internet is also based on the principle of packet-switched data transmission. From this area, the problems arising from the common transmission of data flows are also known. Neither individual data flows, nor the aggregated data flows typical for backbone or core networks, which result from the aggregation or aggregation of multiple data flows, show a continuous or at least approximately continuous course in the data transmission rate, if they are analyzed at a certain point in the network. Rather, such data flows show a transmission rates for Internet traffic almost characteristic irregularity in the data ⁇ which is called the "burstiness". A one ⁇ of individual "burst" distinguishes itself by against an average erratic and significantly increased packet or Da ⁇ tenübertragungsrate, which lasts only for a short time.
  • Burstiness leads to overloading of network devices that can no longer handle the large number of incoming packets.
  • packet loss there is an increased loss probability of data packets since data packets are rejected ("packet loss") if there are no intermediate stores in the device concerned, for example a router, or if these are already completely occupied by data packets to be forwarded.
  • bursts For routers or comparable forwarding network devices, therefore, additional mechanisms for handling bursts are provided. These are usually based on the use of a cache in which data packets belonging to a burst are temporarily buffered. Such a buffer may, for example, be set up per physical connection of the device to neighboring devices in the network. After a certain delay time Verzöge ⁇ the cached packages happenge ⁇ be forwarded. As a result, the burst has disappeared, ie the resulting data transmission rate corresponds more to an average transmission rate per data flow.
  • Such network devices can then be designed, for example, to detect and evaluate specific identifications of data packets and to transmit the data packets in accordance with the
  • DiffServ Differentiated Services
  • the forwarding of data packets in network devices thus requires in principle always at least two steps, namely the classification of an incoming data packet and the treatment of the data packet according to a Klassifi ⁇ cation result.
  • the classification may be that the Zu ⁇ belonging to the data packet to a particular class (for example ⁇ a DiffServ class) or to a specific data flow (such as a RSVP data flow) is determined.
  • a particular class for example ⁇ a DiffServ class
  • a specific data flow such as a RSVP data flow
  • treatment instructions are stored which specify the treatment of the data packet for each possible classification result.
  • a corresponding treatment module can, for example, a Da ⁇ tenbyte release immediately for forwarding, so that this packet in an output queue of the network device is set, and is forwarded in accordance with the existing physical data transmission capacity.
  • the treatment module can ⁇ the data packet in the above-mentioned buffer to be also in the form of a queue or queue ⁇ forms can be, caching. After a certain delay time Ver ⁇ the stored data packet is read out and supplied to the same again or another Klassensmecha ⁇ mechanism.
  • a plurality of classification and treatment devices can be present one behind the other or else nested.
  • Classification and treatment of data packets in network devices can also be carried out independently of the data sources or sinks in the facilities of a network. This is referred to as network load shaping ("Traffic Shaping”), which is carried out by the network operator with the aim of generating the peak data limit and burst lengths that occur in data arriving at the network.
  • Traffic Shaping is carried out by the network operator with the aim of generating the peak data limit and burst lengths that occur in data arriving at the network.
  • GPRS Flow Control To Loss & Delay at the air interface as possible vermei ⁇ , is the "GPRS Flow Control" known according to the 3GPP TS 08.18 be ⁇ .
  • the GPRS flow control protects the air interface of ⁇ le upstream cache or buffer in the BSC / PCU. At this point, the transmission capacity is reduced to the bandwidth that is actually available on the air interface.
  • the GPRS Flow Control regulates the traffic per Cell (“BVC Flow Control") and per subscriber ("MS Flow Control", see Fig. 8.1 in TS 08.18).
  • Fig. 8.2 For flow control, an algorithm is used (Fig. 8.2), in which the filling level of the buffer or buckets and the leak rate (outflow rate) in the BSC to the SGSN simu ⁇ be profiled. The size of the bucket and the leak rate are reported to the SGSN by the BSC. In the event of an overload, the data packets are cached or buffered in the SGSN, allowing the transport to be prioritized according to 3GPP QoS principles.
  • a method for network load shaping for UMTS / GRPS networks aims in this direction.
  • a maximum bit rate ( “Maximum bitrate”) is defined as a maximum number of bits, the currency through a network entry point ⁇ ( "Service Access Point", SAP) in the mobile radio network for a certain period of time, divided by that period.
  • SAP Service Access Point
  • a data traffic goes to this maximum data rate compliant when a token bucket algo- rithm is formed according to, wherein the token rate is equal to or -large the maximum bit rate and the bucket size is equal to the maxi ⁇ paint SDU ( "Service Data Unit”) size (see, for example, section 6.4.3.1 in TS 23.107).
  • the maximum bitrate is the only bit rate control parameter specified for the QoS classes "Interactive" and "Back- ground” in TS 23.107.
  • the purpose here is to define a maximum bit rate for data flows at the boundaries of the mobile network. In particular, it concerns the limitation of the data rate on the part of the application, as can be seen from the passages relating to the two classes of traffic in Section 6.4.3.2 of TS 23.107.
  • TS 23.107 proposes a "conditioner" on the input side of a gateway, cf. Fig. 3 of the TS 23.107.
  • an architecture as indicated in FIG. 3 of TS 23.107, can lead only in exceptional cases to a reduction of the burstiness in the core network and radio access network (RAN) of a mobile radio operator, if, for example, the data source belongs to the mobile network or the operator of the network has made a corresponding agreement with the data provider.
  • RAN radio access network
  • the object of the invention is to probabilities reviewwahr- and to suggest the occurrence of delays in the forwarding of data packets from a data source via a mobile radio network to a mobile radio terminal in a simple and cost-effective manner to reduce, and correspondingly ⁇ upgraded network nodes.
  • bandwidth management has evolved into
  • An essential idea of the invention is to break away from this conventional approach and to include the network devices inside the core network in the consideration.
  • FIG. 1 shows a highly schematized GPRS network with the components of the core network GGSN and SGSN and the component of the radio access network BSC / PCU.
  • the Internet is generally available as well as on entry into The wireless core network via the Gi interface at GGSN zu ⁇ next still some 10 Mbit / s bandwidth available.
  • This bandwidth is sufficient, for example, to transmit moving pictures in the context of a video telephony session;
  • Such data flows are typically sent at 2 Mbit / s. This is significantly less (at least for a single such data flow) so that bandwidth is available as the available capacity, for example occurring in the current bursts enough to Ver ⁇ addition.
  • the data flow is forwarded via the Gn interface to that SGSN which is responsible for the care of the mobile radio terminal (MS), which represents the destination point of the data flow.
  • MS mobile radio terminal
  • the available bandwidth is reduced significantly to typically 2 Mbit / s.
  • the air-cut parts Abis / To switch between radio access network and mobile radio terminal, a point on the probability bursts to increased loss ⁇ and / or delays in packet data Trans ⁇ lead port. Namely, at this point, the available bandwidth for the transmission of one or more data flows is generally reduced significantly, for example from the originally 10 Mbit / s to less than 1 Mbit / s.
  • the burstiness of the packet data traffic can lead not only to the air interface, but also to the other, above-mentioned interfaces or points in the mobile radio network, in that the buffers or buffers in the GGSN, SGSN, BSC / PCU by one in a data flow occurring burst be overloaded and data packets of this or other data ⁇ flows to be delayed or discarded.
  • the GPRS flow control protects the bottleneck in air ⁇ interface, but not the collision and aggregation points on Gn interface. Also, in the core network or at the border of the radio access network consisting of aggregation points, insbesonde ⁇ re adjacent the Gb and Gn interface. Furthermore, the available bandwidth per data flow is also reduced at the Gb interface.
  • the GPRS flow control it also offers for the area Zvi ⁇ rule SGSN and BSC, the Gb interface does not provide sufficient protection.
  • the critical point here is the SGSN-side output of the NSVCs ("Network Service Virtual Circuits") to the BSC via the Gb interface. broad s ed to 64 kbit / up to 2 Mbit / s (Frame Relay) ⁇ redu.
  • the traffic is summarized len several Mobilfunkzel ⁇ here, so it can for mutual Behinde ⁇ tion of individual traffic flows come.
  • a suitable method for network load shaping should implement bandwidth management in the core network in order to be able to significantly reduce loss ⁇ likelihoods and delay of data packets for a data flow between a data source located internally or externally to the mobile radio network to a mobile radio terminal connected to the mobile radio network.
  • the data rate is proposed a ⁇ Since tenhnes to limit within the core network to a maximum data rate.
  • the excess traffic, ie, temporarily stored in zwi ⁇ appro ⁇ senem scope the extent of the expected burst.
  • a classification scheme to be implemented in a network device of the core network which is formed on the basis of a leaky-bucket algorithm.
  • Such algorithms are widely used for classifications and treatments used by data flows, thus existing algorithmic ⁇ men and implementations or software modules to resort to these algorithms mechanism and the implementation of the process is particularly simple.
  • Basic parameters of such an algorithm are always a leak rate, which according to the invention corresponds to a predetermined maximum data rate, and a maximum bucket size.
  • the bucket size of the leaky bucket algorithm according to the invention should be sufficiently large to minimize data loss. In any case, significantly more than one parcel must be able to be stored.
  • ll package data unit PDU
  • the typical bucket size should be sufficient to buffer the data flow to a mobile station for a period of 1 second.
  • a concrete, typical bucket size is called approx. 8.8 kByte, cf. Section 8.2.3.6. As noted above, however, the bucket size may well grow up to 50 kbytes.
  • condition is checked whether in the forwarding of a
  • Data packet from a series of successive pake ⁇ te a packet data flow which would be exceeded by the maximum data rate predetermined bandwidth for the transmission of the packet data ⁇ flow. If this is the case, it is additionally checked whether the total length of the data packets would exceed the maximum bucket size. If both conditions are fulfilled, the packet is delayed.
  • the packet data flow in particular diejeni comprises ⁇ gen packet data associated with a logical link between the mobile station and the network device, in particular in a PDP context.
  • the logical Verbin ⁇ dung therefore relates to data of a specific data type to be transmitted from a data source to the mobile terminal.
  • the method according to the invention can be implemented particularly simply and thus advantageously in the SGSN and / or GGSN of the core network of a GPRS / UMTS mobile radio network since the current parameter set for currently activated PDP contexts is present in each of these. These can thus simp ⁇ cher way be accessed tenrate by the value of the maximum DA or "maximum bit rate" for the treated data flow reading.
  • the maximum data rate is part of the PDP context parameters. Access to the data packets is possible up to the LLC level via the header information of the data packets. This value can then be assigned to the leak rate of the leaky bucket algorithm used according to the invention.
  • a combination of the method according to the invention with the flow control according to TS 08.18 in a SGSN is readily possible.
  • the inventive method of flow control is preferably downstream.
  • the maxi ⁇ male transmission rate of MSC and BVC flow control is limited in the SGSN to the maximum data rate.
  • the excess traffic per packet data flow is temporarily stored in an intermediate memory or queue memory. This has a space of sufficient size, so that data packets are buffered to an extent Kings ⁇ nen, as it be by typical occurring in the core network bursts ⁇ true. Here, in particular, source-level bursts are too that is caused by the data source of the packet data flow. If the buffer is filled, further, excess data packets are discarded.
  • FIG. 1 shows a schematic representation of the available bandwidths at important interfaces or reference points in a GPRS network
  • FIG. 2 is a schematic representation of a GPRS network with inventively enhanced SGSN and GGSN,
  • FIG. 3 is a flow diagram illustrating an inventive rate limiting algorithm for conformity testing ⁇ .
  • Fig. 4 is a functional block diagram of the components of a union erfindungschert ⁇ SGSN / GGSN from the Figure 2.
  • FIG. 2 shows in a schematized form network devices or network elements of a GPRS mobile radio network 10.
  • the core network 12 of the mobile network 10 includes two GGSNs 14-1 and 14-2 and two SGSNs 16-1 and 16-2. Furthermore, there is a gateway 18 in the core network 12, which functions according to a data flow shaping. TS 23.107 is fulfilled and will be described in more detail below.
  • the radio access network 20 of the mobile radio network 10 comprises a BSC / PCU 22.
  • a mobile radio terminal 24 receives via the mobile radio network 10 in the frame a data flow from an external data 25 a Pa ⁇ ket schemes 26 connected external data source 27th
  • Data flow 25 relates to data that is transmitted as part of a PDP context activated for terminal 24 in GGSN 14-1 and SGSN 16-1.
  • TCP packets that are used by an application, namely a Web browser on the terminal 24, to display a website.
  • other data services could of course be used as well, for example email download or similar download services.
  • Packet data flows such as flow 25 are shown by solid arrows. Interfaces or reference points between the network devices and at the network boundaries are provided with the designations "Gi”, “Gn”, etc., as known to those skilled in the 3GPP UMTS / GPRS specifications.
  • the data flow 25 is generated in response to a request originating from the terminal 24 in the data server 27 and sent from there to the mobile radio network 10 at a data rate which depends on the configuration of the server 27.
  • the data rate would be 10 Mbit / s. It Kings ⁇ nen bursts occur in which the data rate of some 10 milliseconds to several 100 milliseconds to several 10 Mbit / s increases.
  • the gateway 18 is the specification TS det according 23.107 gebil- to the data rate of data flow 25 of the mobile network 10 th adapt to the Ge sacrificehei ⁇ , specifically cash to the availa- ⁇ bandwidth in the core network 12 and radio access network 20.
  • the Gateway 18 could also be implemented as part of GGSN 14-1, but here is drawn as a standalone entity to make it clear that network load-shaping in accordance with FIG. the TS 23.107 on the outside of the mobile network 10 takes place.
  • further units for network load ⁇ are shaping, with respect to the path of the downlink data flow 25 is provided to the terminal 24, again only in the BSC / PCU 22 to the flow of data to the bandwidth capacity over the air interface ⁇ point adapt.
  • the data flow 25 (possibly together with further data flows, which are not drawn in extra) is output via a network interface unit 28 in the direction of the SGSN 16-1.
  • the interface unit 28-1 operates in a known manner to adapt the data flow 25 to the Gn interface.
  • the interface unit 29 in the SGSN 16-1 provides a gensets ⁇ gationsdazzling. As shown in the example of FIG. 2, are here data flows of the GGSNs leads 14-1 and 14-2 together quantitative ⁇ . If a burst only occurs in one of the data flows combined in unit 29, this can severely disrupt the aggregated data flow, as shown in the publication by Jiang & Dovrolis.
  • the interface units 29 and 31 for receiving aggregated data flows are each formed with an average bandwidth or data transmission rate. However, if a burst occurs in one of these data flows, u. For example, the capacity of the unit's inbound queue or queue may be overwhelmed, causing packets to be massively delayed or discarded.
  • the interface units 28-1, 28-2 and 30-1, 30-2 upstream of the aggregation points are further developed in accordance with the invention occurrence of bursts in the Da ⁇ tenflüssen reliably prevent.
  • FIG. 3 shows components of the interface unit 28-1 that are essential to the invention.
  • the construction of the units 28-2, 30-1 and 30-2 ent ⁇ speaks to that of the unit 28-1.
  • the interface unit 28-1 initially has an input queue or input queue 32.
  • a classification module 36 is implemented. To perform the classification, the module 36 accesses a constant memory 38, as will be described in greater detail below.
  • the classification result is passed to a treatmen ⁇ development module 40th
  • the module 40 is configured to adjust, depending on the classification result optionally vitespei ⁇ chernde data packets 34 in a buffer 42 to spei ⁇ manuals to remove the buffered packets from the memory 42 again, and after intermediate storage back to the inbound queue 32nd Not veinzuspei ⁇ chernde packets are adjusted by the processing module to the format of the Gn interface and ge in an output queue 44 provides ⁇ from which removed the forwarded packets to the SGSN 34 and 16-1 according to the physical capacity of the link between GGSN 14 1 and SGSN 16-1 undgelei ⁇ tet.
  • step S1 it is checked whether at least one data packet 34 is present in the input queue 32. If this is the case, the classification module (according to the FIFO principle) determines the length of the first packet 34 present in the queue. To this end, the length L (p) is determined the packet data unit ( "Packet Data Unit” PDU) in the LLC ( “Logical Link Control”) protocol layer of the classifi to ⁇ ornamental package p.
  • a predicted value of the thus genann ⁇ is ten in step S2 "Bucket-Counters" B * determined. This is calculated as the sum of the lengths of the last and the now to behan ⁇ delnden packet minus the desired maximum bit rate multiplied by the time which has elapsed since the sending of the vo ⁇ out previous packet.
  • step S4-A1 a ent ⁇ speaking classification result "forward PDU" is passed to the processing module 40 in a step S4-A1 (Alternative 1).
  • step S4-A1 Alternative 1
  • step S3 If, on the other hand, it is found in step S3 that the sending of the packet to be classified would result in exceeding the maximum bit rate R, in step S4-A2 a corresponding classification result "delay PDU" passed to the treatment module 40, and an update of the parameters B and T p is omitted.
  • the classification module 36 accesses the constant memory 38 (see Fig. 3) in which the value of the maximum data rate or maximum bitrate R is stored.
  • the maximum bucket size of the bucket implemented in the classification module 36 does not need to be stored since a determination and evaluation of the condition as to whether the bucket size would be exceeded when transmitting the respective packet to be classified need not be performed .
  • the Imp ⁇ lement ist of the leaky bucket mechanism of the invention is compared with token bucket algorithms, such as the TS
  • the classification module 36 is for reading out the value of
  • the treatment module 40 receives the classification result "forward PDU" from the classification module 36, then the treatment module 40 removes the first packet 34 from the queue 32 and forwards it in the direction SGSN 16-1 (see FIG.
  • the treatment module 40 If the treatment module 40 receives the "PDU delay" classification result, the module 40 removes the packet to be treated from the queue 32 and stores it in the buffer
  • a timer (not shown) is started in the treatment module 40.
  • the Action module 40 the cached packet the Zwi ⁇ schen arrived 42 and puts the packet back into the input ⁇ queue 32.
  • the value of running in the module 40 timer may, for example, from the stored in the constant memory 38 constant R (maximum data rate) result by with the help of R and the length of the packet a delay time ⁇ space is calculated. In this way, a packet is supplied to delay was ⁇ ner again the classification by the module 36 and is then either transmitted or delayed again.
  • the bucket size for the toe or leaky bucket algorithms implemented on the gateway 18 and in the interface unit 28-1 may assume different values, since both units serve different purposes.
  • the gateway 18 scales the data flow 25 with respect to the quality of service request of the carrier service (bearer service) used for the data flow 25 in the mobile radio network 10.
  • the interface unit 28 implemented on the output side in the GGSN 14-1 -1 serves to avoid packet losses and delays due to the aggregation points present in particular in the core network 12.
  • the data flow 25 is subjected to the SGSN 16-1 continues to be one GPRS flow control according to the TS 18.08 (not shown ge ⁇ ).
  • the performance of the buffer for the air interface in the BSC 22 is turned off.
  • there is no burst-switching network load-shaping because the flow control according to TS 08.18 provides a bucket size of up to about 50 kbytes or more.
  • the data flow 25 is finally subjected to a further shaping according to the TS 23.107 (not shown). This provides, that is / To transmitted to the terminal 24 data flow 25 formed over the air interface Abis conform to the demanding taken in An ⁇ GPRS Bearerservice structurige ⁇ .
  • the constant memory 38 in FIG. 3 may be a memory on which the parameter values for activated PDP contexts are stored.
  • Network interface units the inventive method can also be implemented on stand-alone units of network nodes in the mobile network.
  • the inventively further developed interface units (in the example of FIG. 2, the units 28-1, 28-2, 30-1, 30-2) are respectively in relation to downlink data flows to be protected aggregation ⁇ points or points at which the available Bandwidth decreases, arranged.
  • the points in the mobile radio network at which data flows are to be delimited or smoothed according to the invention should be selected such that no further bursts can arise between this point and the aggregation points to be protected.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention concerne un procédé de gestion de la charge réseau dans un réseau de téléphonie mobile (10) consistant à classifier et éventuellement retarder des paquets de données d'un flux de données par paquets (25) sur la base d'un schéma de classification à dispositif de fuite dans un dispositif réseau à l'intérieur d'un réseau central de téléphonie mobile (12), de manière à lisser des rafales et réduire, de manière simple et économique, les probabilités de pertes et l'apparition de délais lors du transfert des paquets de données d'une source de données (27) vers un terminal de téléphonie mobile (24) par l'intermédiaire du réseau de téléphonie mobile (10).
EP05787122A 2004-09-24 2005-09-22 Procede de gestion de la charge reseau dans un reseau de telephonie mobile Withdrawn EP1794940A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102004046400A DE102004046400B4 (de) 2004-09-24 2004-09-24 Verfahren zur Netzlastformung in einem Mobilfunknetz
PCT/EP2005/054751 WO2006032688A1 (fr) 2004-09-24 2005-09-22 Procede de gestion de la charge reseau dans un reseau de telephonie mobile

Publications (1)

Publication Number Publication Date
EP1794940A1 true EP1794940A1 (fr) 2007-06-13

Family

ID=35474711

Family Applications (1)

Application Number Title Priority Date Filing Date
EP05787122A Withdrawn EP1794940A1 (fr) 2004-09-24 2005-09-22 Procede de gestion de la charge reseau dans un reseau de telephonie mobile

Country Status (6)

Country Link
US (1) US20070268831A1 (fr)
EP (1) EP1794940A1 (fr)
KR (1) KR20070053256A (fr)
CN (1) CN101027876A (fr)
DE (1) DE102004046400B4 (fr)
WO (1) WO2006032688A1 (fr)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080175248A1 (en) * 2006-11-06 2008-07-24 Jagadeesh Dantuluri Method and Apparatus Regarding Monitoring a Streaming/Conversational-Class Data Session to Detect When a Mobile Data Flow Has been Dropped by a Mobile Network
US9467361B2 (en) * 2011-12-20 2016-10-11 Shoretel, Inc. Bandwidth utilization monitoring for a communication system
CN103150160B (zh) * 2013-02-04 2016-01-20 浙江大学 针对闭合模型***的突发性负载生成方法
KR101636198B1 (ko) * 2015-03-09 2016-07-05 강원대학교산학협력단 무선 통신 환경에서 비디오 스트리밍의 트래픽 제어 방법 및 이를 구현하는 수신기 장치
CN113784392A (zh) * 2020-06-10 2021-12-10 华为技术有限公司 通信方法、装置及***
CN113347665B (zh) * 2021-05-31 2023-12-19 中国银行股份有限公司 网关***中实时交易量控制方法及装置

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6937566B1 (en) * 1997-07-25 2005-08-30 Telefonaktiebolaget Lm Ericsson (Publ) Dynamic quality of service reservation in a mobile communications network
US6578082B1 (en) * 1999-08-02 2003-06-10 Nortel Networks Limited Distributed flow control system and method for GPRS networks based on leaky buckets
EP1133201A1 (fr) * 2000-03-07 2001-09-12 Lucent Technologies Inc. Système de radiotelecommunication à utilisation améliorée d'interface radio
EP1133202A1 (fr) * 2000-03-07 2001-09-12 Lucent Technologies Inc. Systeme de radiotelecommunication à utilisation améliorée 'interface radio
FI20002848A (fi) * 2000-12-22 2002-06-23 Nokia Corp Vuon valvonta tietoliikenneverkossa
US20030039233A1 (en) * 2001-08-14 2003-02-27 Aharon Satt Estimation of resources in cellular networks
FI20020673A0 (fi) * 2002-04-09 2002-04-09 Nokia Corp Ajantasaisen pakettidatan pakettien ajoittaminen

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO2006032688A1 *

Also Published As

Publication number Publication date
US20070268831A1 (en) 2007-11-22
CN101027876A (zh) 2007-08-29
DE102004046400B4 (de) 2008-08-28
KR20070053256A (ko) 2007-05-23
WO2006032688A1 (fr) 2006-03-30
DE102004046400A1 (de) 2006-04-06

Similar Documents

Publication Publication Date Title
EP1451980B1 (fr) Procede de transmission de donnees d'application avec une qualite differente
DE60031776T2 (de) Verfahren und vorrichtung für ein kommunkationsnetz
DE60115030T2 (de) Kommunikationen unter verwendung von adaptiven mehrraten kodierern/dekodierern
DE60211322T2 (de) Empfängerinitiierte Inkrementierung der Übertragungsrate
DE60108765T2 (de) Basis-qos-mechanismen zur drahtlosen übertragung von ip-verkehr
DE69818846T2 (de) Paketnetzwerk
DE69937537T2 (de) Überwachung von Internet unterschiedlichen Diensten für Transaktionsverwendungen
DE60032669T2 (de) Vorrichtung und Verfahren zur Bandbreitenüberwachung
DE69738359T2 (de) System zur Verbesserung des Datendurchsatzes einer TCP/IP Netzwerkverbindung mit langsamen Rückkanal
DE69921831T2 (de) Kontrolle der dienstqualitäten in einem mobilkommunikationssystem
DE602004000296T2 (de) Verfahren und Vorrichtung für die Erhöhung des drahtlosen Datendurchsatzes von QOS gesteuerten Paketen
DE60125473T2 (de) Paketwiederübertragung mit Prioritätinformationen
DE60306723T2 (de) Warteschlangensystem für Diffserv Router mit mehreren Betriebsmodi
DE60120354T2 (de) Rsvp-verarbeitung in 3g-netzwerken
DE69834188T2 (de) Dynamische dienstqualitätreservierung in einem mobilen kommunikationsnetz
DE602004001083T2 (de) Verfahren zur Planung von Übertragungen in drahtlosen Systemen
DE60106457T2 (de) Zuteilung von datenübertragungsbetriebsmitteln bei der paketvermittelten datenübertragung
DE112006001591T5 (de) Adaptiver Mobiltelefonie-Sprachtransport über ein Internetprotokollnetz
EP1794940A1 (fr) Procede de gestion de la charge reseau dans un reseau de telephonie mobile
DE60030187T2 (de) System und Verfahren zur Datagrammübertragung
DE602005005087T2 (de) System und verfahren zur verbesserung der audioqualität für auf ip basierende systeme unter verwendung eines amr-nutzinformationsformats
DE10393436T5 (de) Bitratensteuermittel in einem Telekommunikationssystem
EP1908234B1 (fr) Procede de controle de ressources dans des elements d'un reseau de telecommunication
EP2057789B1 (fr) Commande d'une adaptation de charge dans un réseau de communication radio
DE69905623T2 (de) Paketdatenübertragung im mobilfunksystem der dritten generation

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: 20070424

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

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

Owner name: NOKIA SIEMENS NETWORKS GMBH & CO. KG

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

Owner name: NOKIA SIEMENS NETWORKS S.P.A.

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

Owner name: NOKIA SIEMENS NETWORKS GMBH & CO. KG

DAX Request for extension of the european patent (deleted)
17Q First examination report despatched

Effective date: 20100407

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

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

18D Application deemed to be withdrawn

Effective date: 20100401