EP1192766B1 - Migration of downlink traffic in gprs - Google Patents

Migration of downlink traffic in gprs Download PDF

Info

Publication number
EP1192766B1
EP1192766B1 EP00948476A EP00948476A EP1192766B1 EP 1192766 B1 EP1192766 B1 EP 1192766B1 EP 00948476 A EP00948476 A EP 00948476A EP 00948476 A EP00948476 A EP 00948476A EP 1192766 B1 EP1192766 B1 EP 1192766B1
Authority
EP
European Patent Office
Prior art keywords
time
packet
lsp
load sharing
sharing function
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
EP00948476A
Other languages
German (de)
French (fr)
Other versions
EP1192766A1 (en
Inventor
Per Magne Hoff
Karsten Marius Gruneng Vileid
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.)
Telefonaktiebolaget LM Ericsson AB
Original Assignee
Telefonaktiebolaget LM Ericsson AB
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 Telefonaktiebolaget LM Ericsson AB filed Critical Telefonaktiebolaget LM Ericsson AB
Publication of EP1192766A1 publication Critical patent/EP1192766A1/en
Application granted granted Critical
Publication of EP1192766B1 publication Critical patent/EP1192766B1/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

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/08—Load balancing or load distribution
    • H04W28/082—Load balancing or load distribution among bearers or channels
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
    • H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
    • H04Q11/0478—Provisions for broadband connections
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/12—Avoiding congestion; Recovering from congestion
    • H04L47/122—Avoiding congestion; Recovering from congestion by diverting traffic away from congested entities
    • 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/08—Load balancing or load distribution
    • H04W28/0867—Load balancing or load distribution among entities in the downlink

Definitions

  • the present invention relates to a method for improving the traffic handling capacity of a packet switched mobile telephone communication system.
  • GPRS is a new standard for packet switched mobile telephony.
  • This invention proposes an improvement in the SGSN for the NS ETSI specification, see ref. [1], of the GPRS interface, i.e. the interface from SGSN towards BSS (downlink direction).
  • NS-VCs links between the SGSN and the BSS.
  • the number of links might vary from one to many hundreds.
  • LSP traffic related to a specific MS
  • NSC link
  • This will ensure in order delivery of packets from the SGSN to the BSS or vice-versa for one MS. Transmission capability of the different links might very well be different. The in-order delivery might be jeopardised if using multiple links for the same MS.
  • the problem with not being able to migrate traffic for an MS from one link to another is that if the link currently assigned gets congested then there is no way of reducing the traffic load on the congested link. I.e. if the link gets congested the MS can not send on another link which is not congested instead, since that might inflict out of order delivery of the packets.
  • the problem is: "is it possible to migrate traffic (due to congestion) without inflicting in order delivery?"
  • US patent 5.488.607 relates to a method for evaluating the throughput in a packet switched system (ATM). A similar method is also known from US patent 5.132.961 .
  • ETSI Spec. GSM 08.16 relates to load sharing in case of
  • the problem described above are solved according to the invention by introducing a load sharing function between the BSS and the SGSN.
  • the load sharing function is situated in the network service control sublayer, which is a sublayer of the network service layer.
  • the purpose of the load sharing function is to distribute the traffic load from the SGSN to a BSS (downlink traffic) among the available NS-VCs.
  • An NSEI identifies a group of NS-VCs.
  • the responsibility of the load sharing function is to distribute the NS SDU traffic among the available NS-VCs of the same group.
  • a requirement for the load sharing function is that it should ensure that NS SDUs with the same LSP should be sent on the same NS-VC, this to ensure that for each BVC, the in order delivery of all NS SDUs marked with the same LSP value are preserved.
  • the load sharing function is only invoked in the SGSN for downlink traffic.
  • the load sharing function has two main requirements,
  • the load sharing function When the NS user (e.g. BSSGP) sends a packet down to the NS layer, the load sharing function will be the first functionality that will be invoked in the NS layer- BSSGP will provide the NS layer with two service primitive parameters, the NSEI and the LSP, that the load sharing function will use for selecting an NS-VC.
  • the NSEI is used to select the group of NS-VCs and the LSP is used to select a particular NS-VC out of the group.
  • the load sharing function will choose an NS-VC, based on the NSEI and the LSP and then.ensure that all NS SDUs with the same set of NSEI and LSP will be transmitted on the same NS-VC.
  • Ref. [1] states that; 'For each BVC and NSEI, NS SDUs with the same LSP shall be sent on the same NS-VC'.
  • the load sharing function When the load sharing function receives an NS SDU from the NS user, it will look up in a table where it uses the LSP as the key, to find the time the last NS SDU was sent for the PTMSI (LSP) in question. If the time exceeds a specified threshold the load sharing function is free to reselect an NS-VC. If the original NS-VC was congested an NS-VC that is not congested will be chosen. Hence traffic for an MS, that for a period of time has not generated any downlink traffic, will be possible to migrate to another NS-VC.
  • the time threshold specified must be bigger than the maximum time through the Frame Relay network for an NS SDU. In this case the in order delivery ofNS SDUs to the BSS will be ensured.
  • FIG. 2 is a graphical representation of the process for transferring packets between BSS and SGSN according to the invention:
  • FIG. 3 shows the logic used at sender-side.
  • the invention will ensure that it is possible to migrate downlink traffic from a congested NS-VC to a not congested NS-VC and preserving in order delivery.
  • An NS-VC uses a frame relay PVC and hence congestion on an NS-VC implies that the there is congestion on the underlying frame relay PVC. Without the inventive arrangement all of these frame relay PVCs have to be overdimensioned in order to give acceptable performance in worst case situations. With the inventive arrangement each of the PVCs do not have to cope with the worst case situations since it is now possible to migrate traffic among them.
  • the invention is an enhancement of the ETSI specification in ref. [1]. However the invention does not inflict any deviation from this specification. Hence it can be implemented and still be compliant to the specification.
  • the solution proposed can equally well be implemented in the BSS for the uplink traffic towards SGSN.

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)
  • Communication Control (AREA)
  • Medicines Containing Antibodies Or Antigens For Use As Internal Diagnostic Agents (AREA)
  • Organic Low-Molecular-Weight Compounds And Preparation Thereof (AREA)
  • Train Traffic Observation, Control, And Security (AREA)

Abstract

The present invention relates to a method for improving the traffic handling capacity of a packet switched mobile telephone communication system. In said system there is introduced a load sharing function between the Base Station System and the Serving GPRS Switching Node. The purpose of the load sharing function is to distribute the traffic load from the SGSN to a BSS among the available Network Service Virtual Channels.

Description

  • The present invention relates to a method for improving the traffic handling capacity of a packet switched mobile telephone communication system.
    • Technical Field
  • GPRS is a new standard for packet switched mobile telephony. This invention proposes an improvement in the SGSN for the NS ETSI specification, see ref. [1], of the GPRS interface, i.e. the interface from SGSN towards BSS (downlink direction).
    • Technical background Problem
  • On the Gb-interface, see fig. 1, there are a number of links (NS-VCs) between the SGSN and the BSS. The number of links might vary from one to many hundreds. In the NS ETSI specification, see ref. [1], section 4.4.1, bullet two, it is stated that traffic related to a specific MS (LSP) should be transmitted on the same link (NS-YC). This will ensure in order delivery of packets from the SGSN to the BSS or vice-versa for one MS. Transmission capability of the different links might very well be different. The in-order delivery might be jeopardised if using multiple links for the same MS. Hence, if packet 1 is sent from the SGSN to the BSS on link 1, and then the next packet, packet 2, is sent on link 2, then we are not guaranteed that packet 1 will arrive before packet 2 at the BSS. According to ref. [1] section 4.4.1, bullet two, another link will be selected when the used link fails. In this link failure case it accepted to receive traffic out of order.
  • The specified Load sharing function in ETSI specification, ref. [1], section 4.4.1, covers the following use cases:
    • New LSP (MS) shall be allocated a NS-VC, and in order delivery of NS-SDU are preserved
    • Link failure, another link will be selected, traffic might be received out of order
    • Block/unblock of links (NS-VC), traffic shall be received in order
  • The use case: "One link is congested" is not specified for the Load Sharing function in ref. [1].
  • The problem with not being able to migrate traffic for an MS from one link to another, is that if the link currently assigned gets congested then there is no way of reducing the traffic load on the congested link. I.e. if the link gets congested the MS can not send on another link which is not congested instead, since that might inflict out of order delivery of the packets. The problem is: "is it possible to migrate traffic (due to congestion) without inflicting in order delivery?"
  • From US patent 5.649.110 , there is known a method for equalizing (by buffering) and give priority to traffic in a communication network
  • US patent 5.488.607 relates to a method for evaluating the throughput in a packet switched system (ATM). A similar method is also known from US patent 5.132.961 .
  • ETSI Spec. GSM 08.16 relates to load sharing in case of
    • New subscribers (LSP/MS)
    • A break in the channel
    • Blocking/de-blocking of channels
  • However, none of the publications mentions what should be done when a channel is congested.
    • The Invention Introduction
  • The problem described above are solved according to the invention by introducing a load sharing function between the BSS and the SGSN. The load sharing function is situated in the network service control sublayer, which is a sublayer of the network service layer. The purpose of the load sharing function is to distribute the traffic load from the SGSN to a BSS (downlink traffic) among the available NS-VCs.
  • Between the SGSN and a BSS, there will be one or more NS-VCs for each NSE.
    An NSEI identifies a group of NS-VCs. The responsibility of the load sharing function is to distribute the NS SDU traffic among the available NS-VCs of the same group.
  • A requirement for the load sharing function is that it should ensure that NS SDUs with the same LSP should be sent on the same NS-VC, this to ensure that for each BVC, the in order delivery of all NS SDUs marked with the same LSP value are preserved.
  • The load sharing function is only invoked in the SGSN for downlink traffic.
  • The scope of the present invention is as defined in the appended claims.
    • Brief description of the drawings
    • Figure 1 is a schematically picture showing the transmission plane in GPRS.
    • Figure 2 is a graphical representation of the process for selecting channel between BSS and SGSN according to the invention.
    • Figure 3 is a flow chart describing the new logic, in this patent.
    Description of the invention
  • The load sharing function has two main requirements,
    1. 1) to chose an available NS-VC from the group of NS-VCs, and
    2. 2) to ensure in order delivery ofNS SDUs.
  • When the NS user (e.g. BSSGP) sends a packet down to the NS layer, the load sharing function will be the first functionality that will be invoked in the NS layer- BSSGP will provide the NS layer with two service primitive parameters, the NSEI and the LSP, that the load sharing function will use for selecting an NS-VC. The NSEI is used to select the group of NS-VCs and the LSP is used to select a particular NS-VC out of the group.
  • In its simplest form, the load sharing function will choose an NS-VC, based on the NSEI and the LSP and then.ensure that all NS SDUs with the same set of NSEI and LSP will be transmitted on the same NS-VC.
  • Ref. [1] states that; 'For each BVC and NSEI, NS SDUs with the same LSP shall be sent on the same NS-VC'.
  • This does not take height for congestion on a NS-VC. The Frame Relay layer will in case of congestion on a PVC, and hence NS-VC, indicate this to the NS layer. According to the statement from ref- [1] above, the load sharing function would still have to transmit NS SDUs on the congested NS-VC. The only thing that could be ensured with this philosophy is that no new MSs would be allowed to start to send traffic on the congested NS-VC. I.e. there is no possibility to migrate traffic for one MS from a congested to a not congested NS-VC, after the MS has been assigned the particular NS-VC.
  • The reason for the statement above is that if traffic is to be migrated from a congested NS-VC the in-order delivery ofNS SDUs will not be guaranteed. I.e. it is not guaranteed that the last NS SDU sent on the congested NS-VC will arrive at the BSS before the NS SDU sent on an alternative NS-VC.
  • However it will be argued that migration of traffic from one NS-VC to another NS-VC is possible without compromising the in order delivery requirement. This is possible since most of the traffic sources the GPRS network will support will be bursty sources, e.g. web-browsing. This implies that for a particular MS there will be periods of time that no traffic is received by the MS. The idea is to take advantage of this fact, where for each packet sent on an NS-V C the time of transmission will be stored. Next time a NS SDU with the same LSP1
    1This implies that the LSP must be unique, this is achieved by letting the LSP be equal to the PTMSI.
    is transmitted the time the last NS SDU was transmitted is subtracted from the current time. If the resulting time is above a specified threshold the load sharing function is allowed to choose another NS-VC for this LSP, which will be done if the original NS-VC was congested.
    • Time between two NS SDUs exceeds threshold
  • When the load sharing function receives an NS SDU from the NS user, it will look up in a table where it uses the LSP as the key, to find the time the last NS SDU was sent for the PTMSI (LSP) in question. If the time exceeds a specified threshold the load sharing function is free to reselect an NS-VC. If the original NS-VC was congested an NS-VC that is not congested will be chosen. Hence traffic for an MS, that for a period of time has not generated any downlink traffic, will be possible to migrate to another NS-VC.
    The time threshold specified must be bigger than the maximum time through the Frame Relay network for an NS SDU. In this case the in order delivery ofNS SDUs to the BSS will be ensured.
    • Graphical description
  • Reference is now made to Figure 2, which is a graphical representation of the process for transferring packets between BSS and SGSN according to the invention:
    1. 1. The NS user in SGSN sends a packet to the NS layer.
    2. 2. The load sharing function in the NS layer checks the LSP attached to the incoming packet. The LSP indicates that this packet should be sent on NS-VC 1, the load sharing function checks if NS-VC 1 is congested. In this case it is assumed not to be congested, so the packet is sent towards the BSS on NS-VC1.
    3. 3. The packet is received on NS-VC 1 at the BSS.
    4. 4. The NS user sends a new packet to the NS layer time t later.
    5. 5. The load sharing function in the NS layer checks the LSP attached to the incoming packet. The LSP indicates that this packet should be sent on NS-VC 1, the load sharing function checks if NS-VC 1 is congested. In this case it is assumed to be congested. The load sharing function checks time t. If time t is bigger than the maximum time through the frame relay connection, the load sharing function is allowed to choose a new NS-VC. In this case time t is assumed to be bigger, so the load sharing function chooses to send the packet on NS-VC 2. All consecutive packets with the same NSEI and LSP will now be sent on NS-VC 2 as long as this is not congested.
    6. 6. The packet is received on NS-VC 2 at the BSS.
  • Figure 3 shows the logic used at sender-side.
    • Advantages
  • The invention will ensure that it is possible to migrate downlink traffic from a congested NS-VC to a not congested NS-VC and preserving in order delivery.
    An NS-VC uses a frame relay PVC and hence congestion on an NS-VC implies that the there is congestion on the underlying frame relay PVC. Without the inventive arrangement all of these frame relay PVCs have to be overdimensioned in order to give acceptable performance in worst case situations. With the inventive arrangement each of the PVCs do not have to cope with the worst case situations since it is now possible to migrate traffic among them.
    The invention is an enhancement of the ETSI specification in ref. [1]. However the invention does not inflict any deviation from this specification. Hence it can be implemented and still be compliant to the specification.
    • Broadening
  • The solution proposed can equally well be implemented in the BSS for the uplink traffic towards SGSN.
    • Abbreviation and Terminology
  • Abbreviation/Terminology Description
    GPRS General Packet Radio Service
    SGSN Serving GPRS Switching Node
    BSS Base Station System
    MS Mobile Station
    GPRS General Packet Radio Service
    SGSN Serving SPRS Switching Node
    BSS Base Station System
    MS Mobile Station
    P-TMSI Packet Temporary Mobile Station Identity
    NSE Network Service Element
    NSEI Network Service Element Identifier
    NS-VC Network Service Virtual Channel
    SDU Service Data Unit
    LSP Link Selector Parameter
    BSSGP BSS GPRS Protocol
    BVC BSSGP Virtual Channel
    PVC Permanent Virtual Channel
    NSC Network Service Control
    • References
    1. [1] GSM 08-16: "Digital Cellular telecommunications system (Phase 2+); General Packet Radio Service (GPRS); Serving GPRS Support Node (SGSN) interface; Network Service" v.6.2.0, April 1999.

Claims (7)

  1. Method for optimal selection of a channel for efficient transmission of packets in a packet switched mobile telephone network, which network comprises a number of Mobile Station, MS, a number of Bass Station System, BSS, a number of Serving GPRS Switching Nodes, SGSN, and a number of available Network Service Virtual Channels, NS-VC, between SGSN(s) and BSS(s),
    characterized in the following steps:
    · for each packet related to a Link Selector Parameter, LSP, store the time of transmission
    · next time a packet with the same LSP is to be sent, the time of transmission is substracted from the current time,
    · if the resulting time is above a specified threshold, and the channel is reported as congested, another channel is chose for this LSP from the number of available NS-VCs.
  2. Method according to claim 1,
    characterized in that the time of transmission is stored in a table with the LPS as the keys and when a new packet is received from the NS user, the time of transmission is looked up to find the time the last packet was sent for the LSP in question.
  3. Method according to claim 2,
    characterized in that the Packet Temporary Mobile Station Identity, PTMSI is used as LSP
  4. Load sharing function for improving the traffic handling capacity of a packet switched mobile telephone communication system, which system comprises a number of Mobile Stations, MS, a number of Base Station Systems, BSS, a number of Serving GPRS Switching Nodes, SGSN, and a number of available Network Service Virtual Channels, NS-VC, between SGSN(s) and BSS(s),
    characterized in
    that the
    load sharing function is adapted to store, the time of transmission for each packet sent towards an MS,
    and next time a packet with the same Link Selector Parameter, LSP, is transmitted, to substract the time of transmission from the current time, and
    if the resulting time is above a specified threshold, and the channel is reported as congested, to choose another channel for this LSP from the number available NS-VCs.
  5. Load sharing function according to claim 4,
    characterized in that said load sharing function comprises a table wherein is stored the time of transmission of each packet with the LSP as key.
  6. Load sharing function according to claim 5,
    characterized in that the load sharing function is adapted also to function in the other direction of transmission, i.e. when packets are sent towards the SGSN
  7. Serving GPRS Switching Node comprising a Load sharing function according to claim 4.
EP00948476A 1999-07-14 2000-07-14 Migration of downlink traffic in gprs Expired - Lifetime EP1192766B1 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
NO19993469A NO311060B1 (en) 1999-07-14 1999-07-14 Procedure for transmitting data in packet switched networks
NO993469 1999-07-14
PCT/SE2000/001498 WO2001005105A1 (en) 1999-07-14 2000-07-14 Migration of downlink traffic in gprs

Publications (2)

Publication Number Publication Date
EP1192766A1 EP1192766A1 (en) 2002-04-03
EP1192766B1 true EP1192766B1 (en) 2008-03-19

Family

ID=19903580

Family Applications (1)

Application Number Title Priority Date Filing Date
EP00948476A Expired - Lifetime EP1192766B1 (en) 1999-07-14 2000-07-14 Migration of downlink traffic in gprs

Country Status (11)

Country Link
US (1) US6778500B1 (en)
EP (1) EP1192766B1 (en)
JP (1) JP3711073B2 (en)
KR (1) KR100686432B1 (en)
CN (1) CN1188992C (en)
AT (1) ATE389996T1 (en)
AU (1) AU769782B2 (en)
DE (1) DE60038376T2 (en)
MX (1) MXPA02000239A (en)
NO (1) NO311060B1 (en)
WO (1) WO2001005105A1 (en)

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6965567B2 (en) * 2001-04-09 2005-11-15 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for selecting a link set
US6904034B2 (en) * 2001-06-29 2005-06-07 Nokia Corporation Method and system for communicating data between a mobile communications architecture and a packet switched architecture, each utilizing a different mode of communication
KR100389819B1 (en) * 2001-07-09 2003-07-02 삼성전자주식회사 Method for transmitting packet data in cdma wireless communication system
DE10200497A1 (en) * 2002-01-03 2003-07-10 Deutsche Telekom Ag Method for capture of motor vehicle movement data for pay-per- use tolling purposes, whereby a user's SIM-equipped mobile phone or terminal is used to record movements in a database log file
KR100811337B1 (en) * 2002-02-07 2008-03-07 엘지전자 주식회사 Method for setting call inter GGSN
AU2003234738A1 (en) 2002-04-15 2003-11-03 America Online, Inc. Dynamically managing and reconfiguring wireless mesh networks
US7848307B2 (en) * 2005-01-18 2010-12-07 Koninklijke Philips Electronics N.V. Method and apparatus to enforce airtime quota in service interval in a wireless LAN
CN100442764C (en) * 2005-06-06 2008-12-10 华为技术有限公司 Controlling method for SAR treatment chip transmitting congestion
CN100413253C (en) * 2005-09-01 2008-08-20 华为技术有限公司 Interface allocation method in mobile packet network
CN100407651C (en) * 2005-09-01 2008-07-30 华为技术有限公司 Interface allocation method in GPRS mobile packet network

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2648649B1 (en) 1989-06-20 1991-08-23 Cit Alcatel METHOD AND DEVICE FOR QUANTIFIED EVALUATION OF THE FLOW RATE OF VIRTUAL CIRCUITS EMPLOYING AN ASYNCHRONOUS TIME MULTIPLEXING TRANSMISSION CHANNEL
FR2648648B1 (en) * 1989-06-20 1991-08-23 Cit Alcatel METHOD AND DEVICE FOR EVALUATING THE FLOW RATE OF CIRCUITS EMPLOYING AN ASYNCHRONOUS TIMED MULTIPLEXED TRANSMISSION CHANNEL
FR2678122B1 (en) 1991-06-18 1993-09-03 Cit Alcatel DEVICE FOR MEASURING THE FLOW OF VIRTUAL CIRCUITS EMPLOYING AN ASYNCHRONOUS MULTIPLEXED COMMUNICATION CHANNEL.
FI94814C (en) * 1993-11-30 1995-10-25 Nokia Telecommunications Oy Procedure for managing congestion situations in a frame switching network and a subscriber node in a frame switching network
US5649110A (en) * 1994-11-07 1997-07-15 Ben-Nun; Michael Traffic shaping system with virtual circuit table time stamps for asynchronous transfer mode networks
DE19531611C1 (en) * 1995-08-28 1996-11-07 Siemens Ag Transmission bit rate matching method for data multiplexer
FI100158B (en) * 1995-11-09 1997-09-30 Nokia Telecommunications Oy Traffic control in a telecommunication system
JP3137037B2 (en) * 1997-06-17 2001-02-19 日本電気株式会社 Congestion control method and congestion control system
US6463055B1 (en) * 1998-06-01 2002-10-08 Telefonaktiebolaget L M Ericsson (Publ) Integrated radio telecommunications network and method of interworking an ANSI-41 network and the general packet radio service (GPRS)
US6578082B1 (en) * 1999-08-02 2003-06-10 Nortel Networks Limited Distributed flow control system and method for GPRS networks based on leaky buckets
US6633542B1 (en) * 1999-12-29 2003-10-14 3Com Corporation Method of establishing a flow in an ATM based MPOA network

Also Published As

Publication number Publication date
NO311060B1 (en) 2001-10-01
CN1360779A (en) 2002-07-24
KR20020016864A (en) 2002-03-06
MXPA02000239A (en) 2002-06-21
EP1192766A1 (en) 2002-04-03
JP3711073B2 (en) 2005-10-26
NO993469L (en) 2001-01-15
WO2001005105A1 (en) 2001-01-18
NO993469D0 (en) 1999-07-14
AU769782B2 (en) 2004-02-05
US6778500B1 (en) 2004-08-17
CN1188992C (en) 2005-02-09
JP2003504964A (en) 2003-02-04
AU6195700A (en) 2001-01-30
DE60038376D1 (en) 2008-04-30
KR100686432B1 (en) 2007-02-23
ATE389996T1 (en) 2008-04-15
DE60038376T2 (en) 2009-03-05

Similar Documents

Publication Publication Date Title
EP1236371B1 (en) Channel-type switching control
US5497504A (en) System and method for connection control in mobile communications
US7031254B2 (en) Rate control system and method for a link within a wireless communications system
US5432790A (en) Method for allocating internodal link bandwidth in a packet oriented communication network to guarantee delay quality-of-service
US6256297B1 (en) Method for transmitting information in a universal transmission network
EP1192766B1 (en) Migration of downlink traffic in gprs
US6208633B1 (en) System and method for mobile data services
US6181947B1 (en) System for the wireless transmission of a frame-synchronized signal between a radio base station and at least one mobile terminal
US20060217123A1 (en) Radio base resource allocation method and radio base station
EP1384387A1 (en) Improvements in a third generation cellular network
US8023456B2 (en) Connection reservation in a communication interface
EP1405469A1 (en) Method for adapting the bandwidth of a connection in a telecommunication network
US7327740B2 (en) Facilitating reliable connection admission control for telecommunications system using AAL2 signaling
KR100347733B1 (en) Method for controlling traffic of wireless mobile station
EP1754344A1 (en) Transmission control method, network element, base station and radio network controller
Beraldi et al. A new dynamic reservation multiple access protocol for supporting multimedia traffic in third generation cellular system
US20020128038A1 (en) Resource management in a wireless corporate communication system
Khatun et al. Performance analysis and optimization of a mobility support ATM switch
Bada et al. Performance of service disciplines in GPRS systems with heterogeneous traffic
Apostolas et al. Wireless Asynchronous Transfer Mode (ATM) in Data Networks for Mobile Systems
Bada et al. Radio Resource Management in GPRS with Quality of Service
Ariffin et al. Design and QoS provisioning in Wireless ATM Network
Ng et al. Incorporating priority scheme in IPv6 over ATM networks
Fan et al. Performance of a semi-permanent signalling protocol in the presence of channel fading for satellite multimedia communications

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

AK Designated contracting states

Kind code of ref document: A1

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

AX Request for extension of the european patent

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

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

Owner name: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)

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

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

REG Reference to a national code

Ref country code: GB

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

Country of ref document: DE

Date of ref document: 20080430

Kind code of ref document: P

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

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

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

NLV1 Nl: lapsed or annulled due to failure to fulfill the requirements of art. 29p and 29m of the patents act
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: 20080319

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

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

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

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

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

ET Fr: translation filed
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: 20080319

26N No opposition filed

Effective date: 20081222

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

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

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 NON-PAYMENT OF DUE FEES

Effective date: 20080731

Ref country code: CH

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

Effective date: 20080731

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

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

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

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

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

Ref country code: DE

Payment date: 20140729

Year of fee payment: 15

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

Ref country code: GB

Payment date: 20140729

Year of fee payment: 15

Ref country code: FR

Payment date: 20140717

Year of fee payment: 15

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 60038376

Country of ref document: DE

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20150714

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

Ref country code: DE

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

Effective date: 20160202

Ref country code: GB

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

Effective date: 20150714

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20160331

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

Ref country code: FR

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

Effective date: 20150731