EP1335535A1 - Sélection de service de réseau - Google Patents

Sélection de service de réseau Download PDF

Info

Publication number
EP1335535A1
EP1335535A1 EP02250674A EP02250674A EP1335535A1 EP 1335535 A1 EP1335535 A1 EP 1335535A1 EP 02250674 A EP02250674 A EP 02250674A EP 02250674 A EP02250674 A EP 02250674A EP 1335535 A1 EP1335535 A1 EP 1335535A1
Authority
EP
European Patent Office
Prior art keywords
service
communication
stability
network
bandwidth
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
EP02250674A
Other languages
German (de)
English (en)
Inventor
designation of the inventor has not yet been filed The
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.)
British Telecommunications PLC
Original Assignee
British Telecommunications PLC
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 British Telecommunications PLC filed Critical British Telecommunications PLC
Priority to EP02250674A priority Critical patent/EP1335535A1/fr
Priority to CA002474896A priority patent/CA2474896A1/fr
Priority to PCT/GB2003/000446 priority patent/WO2003065653A1/fr
Priority to US10/502,851 priority patent/US8260959B2/en
Priority to EP03734776A priority patent/EP1470671B1/fr
Publication of EP1335535A1 publication Critical patent/EP1335535A1/fr
Withdrawn legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q3/00—Selecting arrangements
    • H04Q3/64—Distributing or queueing
    • H04Q3/66—Traffic distributors
    • H04Q3/665—Circuit arrangements therefor
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/14—Charging, metering or billing arrangements for data wireline or wireless communications
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q3/00—Selecting arrangements
    • H04Q3/64—Distributing or queueing
    • H04Q3/66—Traffic distributors
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13039—Asymmetrical two-way transmission, e.g. ADSL, HDSL
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/1305—Software aspects
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13093—Personal computer, PC
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/1313—Metering, billing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13138—Least cost routing, LCR
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13175—Graphical user interface [GUI], WWW interface, visual indication
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13251—Restricted service, class of service
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/1329—Asynchronous transfer mode, ATM
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13332—Broadband, CATV, dynamic bandwidth allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13335—Simulation, emulation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13384—Inter-PBX traffic, PBX networks, e.g. corporate networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13389—LAN, internet
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13399—Virtual channel/circuits

Definitions

  • the present invention relates to a method of selecting network services from a plurality of network services available for a communication.
  • Conventional telephony networks offer a service which reserves 64kbits -1 of the network's capacity for the duration of a user's call.
  • This service is suitable for voice telephony, where a signal representing the voice of the user must be continuously sent across the network to the other party to the conversation.
  • a number of telephone calls are carried on the link, each having its own timeslot in a sequence of timeslots. This is known in the art as time division multiplexing.
  • computers send data in bursts (e.g. a Web server might send a page at 1 Mbits -1 for a few milliseconds once every minute on average). Reserving 1 Mbits -1 permanently for communication from a computer would be inefficient. For this reason, dedicated computer networks offer a different type of service. They do not reserve capacity for a user, but instead offer a service where the resources of the network (or at least a proportion of those resources) are shared indiscriminately between network users. This is known in the art as statistical multiplexing.
  • an Asynchronous Transfer Mode (ATM) network allows a user to choose between a constant bit-rate service type (in which an amount of bandwidth they request is allocated to them for the duration of a session), a variable bit-rate service type (in which a proportion of the available capacity is shared between a number of users controlled to substantially prevent congestion), and an unspecified bit-rate service type (in which the remaining capacity is simply shared by all users).
  • ATM Asynchronous Transfer Mode
  • a user can additionally specify the amount of bandwidth he or she wishes to have available. Note that 'service' is to be distinguished from 'service type' - a specification of a required service will include both a service type and an indication of the amount of network resources required by the user.
  • IP Internet Protocol
  • RSVP Resource Reservation Protocol
  • a best efforts service type which approximates to the unspecified bit-rate service offered by ATM networks.
  • Another service type gives packets sent by one class of users priority over packets sent by another class of user.
  • RSVP Resource Reservation Protocol
  • a user can additionally specify the amount of bandwidth he or she wishes to have available.
  • integrated networks offer their users the ability to specify the service which they wish to receive from the network (which, being an integrated network, can offer a plurality of different services).
  • This specification can be made once at the start of a communication (the normal procedure in networks offering a connection-oriented service, such as ATM networks) and / or repeatedly during a communication.
  • a method of selecting network services from a plurality of network services available for a communication comprising:
  • the present inventors have realised that a single characteristic, the desirability of stability, distinguishes the desirability of a large number of network services.
  • the present invention is useful both in situations where said selection step involves a determination of what service to request for said communication and where said selection step involves a determination of what service to provide for said communication.
  • said method further comprises the step of storing an indication of the stability in the amount of said communications resource provided for a communication by one or more services offered by said network, wherein said selection step involves determining from said service stability indication and said stability desirability data a network service for said communication.
  • said method further comprises the step of calculating, from said service stability data, a measure of the likelihood of a predetermined variation occurring in the amount of resource provided for said communication by a service at a future time during said communication.
  • said service stability data comprises data defining a probability density function defining the likelihood of a variable lying within a range of values at a time after said selection, wherein said variable determines the amount of resource provided for a communication by a service.
  • the variable might represent the amount of bandwidth available for said communication in a variable-bandwidth service or the price of a dynamically-priced service.
  • a dynamically-priced service is one where constant bit-rate reservations can be made, but for a predetermined reservation period that is shorter than the duration of many communications. Furthermore, the cost of reserving that bandwidth may change from one reservation period to the next.
  • the maximum of said probability density function is set to the value of said variable at the time of said selection. This embodies an assumption that it is more likely that the amount of resource or the price of a fixed amount of resource will stay the same than it is that any other specific variation will occur.
  • the probability density functions could reflect the time-of-day at which the communication is made.
  • said stability desirability data comprises an indication of the acceptable risk of a predetermined variation occurring; and said selection step involves disregarding said service if said likelihood is more than said acceptable risk.
  • the predetermined variation may be the variation which leads to said communication being terminated prematurely.
  • said stability desirability data comprises one or more utility accumulation rates.
  • Utility is here meant in an economic sense - i.e. the utility of a service represents the price a purchaser is prepared to pay for that service. Where a service is charged for per unit time, the utility accumulation rate may be used.
  • Utility represents a preferred measure of the importance of a service to a person requiring that network service.
  • the demand for money or money's worth from the person requiring the communication results in that person genuinely indicating the importance of the service to him or her. Where other indications of importance are used, a user may just indicate that all communications he or she requires are of high importance.
  • said stability desirability data comprises one or more utility indications each comprising a transmission rate and an associated utility accumulation rate for that rate; said likelihood calculation involves calculating measures of the likelihood of said service type providing said communication with said transmission rate at said future time; and said selection involves calculating an expectation of the surplus which would be accumulated by said communication over a predetermined period were said service type to be selected, the calculation of said expectation involving calculating the sum of the products of said likelihood, the associated utility accumulation rate and the duration of said predetermined period.
  • the predetermined period may either be:
  • variable-bandwidth services i.e. services which involve statistical multiplexing of a plurality of communications
  • constant bit-rate services i.e. services which involve statistical multiplexing of a plurality of communications
  • dynamically-priced services i.e. services which involve statistical multiplexing of a plurality of communications
  • the utility expected to be accumulated over said predetermined period
  • This enables a comparison of any of those service types with one another and the selection of the service type which best suits the requirements of the person (or his agent) requesting the communication.
  • the expected surplus additionally takes into account a penalty the user associates with moving from one transmission rate to another.
  • Penalties might only be associated with drops in bandwidth or might be associated with increases in the amount of bandwidth allocated to a communication as well.
  • the penalties may take the form of a one-off cost to be subtracted from the expected surplus.
  • a second set of embodiments concern methods of selecting a network service during a communication.
  • the method further comprises the step of identifying the service currently being provided for said communication, wherein said determination as to whether the user should continue to obtain current service takes said stability desirability data into account.
  • prediction of future availability of network resource for a communication (which availability might be affected by the price of that service and the amount the user is prepared to pay for such a service), is not necessary, but may be carried out additionally.
  • the stability is, at least in part, determined by the selection. For example, if a purchaser is paying for 300kbits -1 of reserved bandwidth prior to a selection between 100kbits -1 , 300kbits -1 and 500kbits -1 services for the next part of the communication, the data representing the stability requirement might determine whether the purchaser continues to receive 300kbits -1 or not.
  • the stability desirability data preferably comprises utility accumulation rate data. More preferably still, said stability desirability data comprises one or more utility indications each comprising a transmission rate and an associated utility accumulation rate for that transmission rate and penalty data representing a utility penalty associated with moving from one of those transmission rates to a lower one of those transmission rates; and said selection involves calculating a measure of utility of said service to the user which includes an associated penalty value where the transmission rate changes after said selection.
  • a method of sharing, between a plurality of communications, the resources of a network offering a plurality of services comprising carrying out, for each of said plurality of communications a method of selecting a network service from a plurality of network services available for a communication, said method comprising:
  • a network service selection apparatus comprising:
  • a program storage device readable by a processing apparatus, said device embodying a program of instructions executable by the processor to perform the steps of the method according to the first aspect of the present invention.
  • Figure 1 shows an internetwork comprising a content provider's local area network 100, a regional cable network 140, a regional Digital Subscriber Loop network 180, and a portion of the global Internet 120 which interconnects all three.
  • the content provider's network 100 comprises a content provider's Web server 102 and origin video server 104, an Internet router 106 and a LAN 108 interconnecting them.
  • the regional cable network is illustrated in more detail in Figure 2.
  • the regional cable network 140 comprises a hybrid fibre / co-axial (HFC) cable network 142, a regional head end 170 which connects the regional cable network to the global Internet 120, a regional fibre network 150, a caching network 144, a Layer 4 switch 148 and a Cable Modem Termination System (CMTS) 146 which interconnects the Layer 4 switch 148 and the HFC cable network 142.
  • the Layer 4 switch interconnects the regional fibre network 150, the caching network 144, and the CMTS 146.
  • a suitable CMTS is the Cisco uBR 7246 which operates in accordance with a pre-standard version of the DOCSIS (Data Over Cable Service Interface Specification) standard version 1.1.
  • the Cisco uBR 7246 also schedules IP packets which transit it in accordance with the value of the so-called Differentiated Services (DS) field in the IP packet header (see the Internet Engineering Task Force's Request For Comments (RFCs) 2474 and 2475 for details of the DS field).
  • DS Differentiated Services
  • the HFC network 142 comprises a large number of sets of user equipment (152-156), a plurality of co-axial cable networks 157 serving around 700 homes each, a fibre ring 158, and a number of fibre nodes 160, each of which connects the fibre ring 158 to one of the co-axial cable rings 157.
  • Each set of user equipment (152-156) comprises a Toshiba PCX 1100 cable modem 154 (a pre-standard DOCSIS 1.1-compliant cable modem), a Personal Computer (PC) 152, a cable 153 leading from the modem 154 to the PC 152, a cable 155 extending from each set of user equipment to a tap 156 on the co-axial cable ring 157.
  • the caching local area network 144 comprises an agent computer A1, a content file caching server C1, a shaper / marker 164, a bandwidth broker computer B1, and a Local Area Network 162 which interconnects them.
  • the Local Area Network 162 operates in accordance with the Institute of Electrical and Electronics Engineers (IEEE) 802.3 standard at a rate of 100Mbits -1 .
  • IEEE Institute of Electrical and Electronics Engineers
  • the CMTS 146 is configured as follows. Three diff-serv codepoints (say 111000, 110000, and 000000) are chosen to represent top-priority traffic, mid-priority traffic and best effort traffic respectively.
  • the CMTS / IP Router 146 is able to offer each type of traffic simple priority over traffic of the next lowest level of priority.
  • the IP router component of the head end 170 is configured to reset (to 000000) the DS fields of packets arriving over the Internet link 9 which have their DS field set to a value which is equated to any other priority level than best effort.
  • the agent computer A1 is provided with a HyperText Transfer Protocol client program which is configured to use the caching server computer C1 as a proxy (in other words, HTTP requests from the agent computer will be received by the caching server computer C1 and forwarded if the caching server computer itself cannot satisfy the request. HTTP responses to those requests will be received by the caching server computer and forwarded to the agent computer A1).
  • HTTP requests from the agent computer will be received by the caching server computer C1 and forwarded if the caching server computer itself cannot satisfy the request.
  • HTTP responses to those requests will be received by the caching server computer and forwarded to the agent computer A1).
  • the regional Digital Subscriber Loop Network ( Figure 3) comprises a user's personal computer 10, an ATM network 2, a cable 12 connecting the user's PC 10 to the ATM network 2, an Internet Service Provider's (ISP's) local area network 4, a Broadband Access Server (BAS) 6, an ATM network link 5 which connects the BAS 6 to the ATM network 2 and an ISP network link 7 which connects the BAS 6 to the ISP's local area network 4.
  • ISP's Internet Service Provider's
  • BAS Broadband Access Server
  • the ISP's local area network 4 is connected to the Internet 120 via an Internet link 9.
  • a charging server 28 is connected to the BAS 6 via a router 32 and a Local Area Network 31.
  • the ATM network 2 comprises a large number of sets of user equipment (11, 13 14), pairs of copper wires 16 extending from each set of user equipment (11, 13, 14) to a local exchange 20, exchange-housed equipment (17,18) housed in the local telephone exchange building 20 and a wide-area switched network 22 which connects a plurality of such DSLAMs 18 (there is normally one or more DSLAMs per exchange building, only one exchange building is shown in the drawing) to the BAS 6.
  • the exchange-housed equipment includes a Digital Subscriber Line Access Multiplexer (DSLAM) 18 shared between many users and, for each pair of copper wires 16, a splitter unit 17 which terminates the pairs of copper wires 16.
  • DSLAM Digital Subscriber Line Access Multiplexer
  • the splitter unit 17 is effective to send signals within the frequency range used for normal telephony to the Public Switched Telephone Network (not shown) and to send signals in higher frequency bands to the DSLAM 18.
  • Each set of user equipment (11, 13, 14) comprises a splitter unit 14 in a customer's premises which incorporates an Asymmetric Digital Subscriber Line (ADSL) modem 13.
  • the splitter unit 14 is effective to send signals within the frequency range used for normal telephony to the user's telephone 11 and to send signals in higher frequency bands to the ADSL modem 13.
  • the ADSL modem 13 represents the network termination point of the ATM network 2. Cable 12 leads from the modem 13 to the PC 10.
  • the ISP's local area network 4 comprises an IP router 24, a cache computer C2, an agent computer A2, a bandwidth broker computer B2, and a Local Area Network 30 which interconnects them.
  • the previously mentioned Internet link 9 is connected to the IP router 24.
  • the Local Area Network 30 operates in accordance with the Institute of Electrical and Electronics Engineers (IEEE) 802.3 standard at a rate of 100Mbits -1 .
  • the capacity of the ISP link 7 and the ATM network 2 is sufficient to ensure that the rate of transmission of a stream of packets between the caching computer C2 and the personal computer 10 is determined by the BAS 6.
  • each of the elements of the internetwork operates in accordance with version 6 of the Internet Protocol (IP).
  • IP Internet Protocol
  • the caching computer C2 offers the differentiated services extensions to the UNIX sockets interface, or any other programming interface that enables the setting of the Differentiated Services (DS) field in the IP packet header.
  • DS Differentiated Services
  • the ATM network ( Figure 3) is configured by the ATM network operator as follows. Firstly, an ATM permanent virtual circuit (PVC) is configured between the BAS 6 and each of the modems it serves.
  • the PVC is a constant bit rate (CBR) connection whose peak cell-rate is set to 2Mbits -1 .
  • CBR constant bit rate
  • the ATM network operator also configures each PC 10 with an IP address. Thereafter a table associating the IP address of each PC with a label that identifies the PVC which leads to that PC 10 is created in the BAS 6 by manual or automatic methods that are well-known to those skilled in the art.
  • the BAS 6 receives a frame constructed in accordance with the link-layer protocol used over the ISP link 7.
  • the link-layer header and/or trailer is then removed from the frame to leave a packet constructed in accordance with the Internet Protocol.
  • the BAS 6 forwards the packet in a manner which depends upon the DS field of the IP packet header.
  • a packet may be provided with a constant bit-rate service (where a given amount of bandwidth is reserved for the delivery of the content file), or a best efforts service.
  • a (Point-to-Point Protocol) PPP link-layer interface header and trailer are added a frame constructed in accordance with the PPP link-layer protocol.
  • the frame thus constructed is then passed through the ATM Adaptation Layer 5 (AAL5) segmentation process in which it is split into ATM cells and sent onto the ATM PVC connection.
  • ATM Adaptation Layer 5 ATM Adaptation Layer 5
  • the router 24 is configured to reset (to 000000) the DS fields of all packets arriving over the Internet link 9.
  • the content provider's Web server computer 102 is provided with a web server program, and a program for preparing delivery policies for content files.
  • the web server program controls the Web server computer 102 to send web-pages requested by a user to that user and to gather information about users in order to enable the quality of the delivery provided to a user to depend upon the user's identity. In the present embodiment, this is achieved by asking users to fill in a HyperText Mark Up Language (HTML) form in order to register with the web-site.
  • HTML HyperText Mark Up Language
  • the form asks the user for a user name and password and various other data such as the user's age, gender, nationality and occupation category.
  • the information provided is used to assign a user to a user class.
  • a table giving the class of each user is stored at the Web server 102. Those skilled in the art would be able to write a suitable Web server program.
  • the content provider uses the program for preparing delivery policies for content files to create a delivery policy ( Figure 4) for each content file.
  • the program asks the content provider to indicate:
  • the user inputs parameters for three indicated services , namely - 400kbits -1 , 250kbits -1 and 100kbits -1 .
  • the delivery policy generation program then produces a data structure containing the data seen in Figure 4 - the penalties associated with a drop through more than one indicated service are calculated by the delivery policy generation program from the penalties supplied by the content provider.
  • the content provider stores the delivery policy at a URL having a predetermined relationship to the content file's name - for example the content provider owning the domain name cp.com might store its delivery policy file for the content file www.cp.com/latest/gladiator.rm at:
  • the content provider then includes the URLs pointing to its delivery policy files in the list of files which it wishes to be copied to caching servers such as caching server C1 in the regional cable network ( Figure 2) and caching server C2 in the DSL regional network ( Figure 3).
  • caching servers such as caching server C1 in the regional cable network ( Figure 2) and caching server C2 in the DSL regional network ( Figure 3).
  • content distributors offer a service in which they copy specified files from an origin server to caches around the world. In the present embodiment, use of such a service results in the content files stored on origin video server computer 104 being copied to the caching servers C1 and C2, together with the content provider's delivery policy files associated with those content files.
  • Figures 5, 6, 7 and 8 illustrate the operations carried out by the customer's PC 152, the content provider's origin Web server O, and the cable network's ( Figure 3) agent computer A1, caching server C1 and bandwidth broker B1 in carrying out the method of the present embodiment.
  • the steps carried out by the personal computer 152 are carried out under the control of a conventional browser program such as Netscape's Navigator version 4.
  • FIG. 5 shows the steps involved when a previously registered user at PC 152 browses the home page of the content provider.
  • the home page includes a form as provided for by HyperText Mark Up Languages HTML 2.0 and above.
  • HTML 2.0 HyperText Mark Up Languages HTML 2.0 and above.
  • the form as presented to the user has text fields into which the user must enter his user name, and a submit button.
  • the HTML file representing the web-page will also contain a URL which points to a Common Gateway Interface script (i.e. an executable program) and a further indication parameter not displayed to the user that indicates the web-page has been generated for a registered client of the caching server operator.
  • Common Gateway Interface script i.e. an executable program
  • the browser program running on the PC 152 sets up a Transmission Control Protocol (TCP) connection to the Layer 4 switch 148 and sends a HyperText Transfer Protocol (HTTP) GET request across that TCP connection (step 1).
  • TCP Transmission Control Protocol
  • HTTP HyperText Transfer Protocol
  • the layer 4 switch 148 is configured to redirect all requests destined for the default ports used for each content file type to the cache (e.g. port 80 for http and port 554 for rtsp). This avoids the browser program stored on the PC 152 having to be configured to point to the caching computer C1.
  • the GET request is accompanied by the user name and the indication parameter.
  • the Layer 4 switch 148 recognises the TCP port value in the GET request and hence forwards the request to the caching server C1.
  • the origin Web server O receives the GET message and the appended user name, client indication, and agent identifier. In response, it runs the associated CGI script which causes it to:
  • the agent computer A1 On receiving the user class message, the agent computer A1 stores the user class along with the user's current IP address.
  • the user's PC 152 presents the HTML file as a registered user menu page on the screen of the PC 152.
  • the registered user menu page includes one or more hyperlinks which are associated with content files stored on the caching server C1.
  • an RTSP SETUP request is sent to the Layer 4 switch 148.
  • the HTML file includes a HTML form which causes a further registered client indication to be included in the SETUP request.
  • the Layer 4 switch 148 recognises the TCP port in the request and hence forwards the request to the caching server C1 (step 5).
  • the plug-in program at the caching server C1 responds to the presence of the further registered client indication by controlling the caching server C1 to send a content file transfer parameters message to the agent computer A1 which includes the URL of the requested content file, values of the user's TCP port and IP address, and the origin server's TCP port and IP address (step 6).
  • the agent computer A1 fetches the delivery policy ( Figure 4) associated with the content file identified in the content file transfer parameters message (step 7).
  • the agent computer A1 looks up the stored user class (which it received in step 3) associated with the IP address received in the content file transfer parameters message (received in step 6).
  • the agent computer A1 selects the set of class-specific quality of delivery parameters which corresponds to the stored user class from the delivery policy file received in step 7.
  • the selected set is then incorporated in a quality of delivery specification for this specific User/Content-File combination ( Figure 7) which is forwarded ( Figure 8 - step 8) to the bandwidth broking computer B1.
  • p n ( b ) C b 2 ⁇ kT e -( b - b i ) 2 kT C is chosen so that:
  • the value k in the above expression is a volatility index which expresses the volatility in the amount of bandwidth the service offering supplies to a user - higher values of k represent greater volatility.
  • Figure 9 illustrates the form of the above probability density function which represents the likelihood of a bandwidth b being offered at a time T after an amount of bandwidth b i was offered.
  • the area under the curve up until the line labelled b m represents the probability that less bandwidth than b m is available at time T.
  • the 'width' of the peak of the distribution grows as the square root of time.
  • An analogous probability density function can be used to model the variation of price in a dynamically-priced service offering.
  • Figure 10 shows such a probability density function, including examples of so-called marginal prices at which the content provider (or other purchaser) would choose to move between services indicated in the quality of delivery policy (Figure 4).
  • 2 represents the price below which the purchaser would choose the highest of three indicated services in preference to the other indicated services and just above which the purchaser would choose the second highest indicated service.
  • Figure 10 represents a simple situation.
  • the lowest marginal price is that at which the indicated service obtained by the purchaser drops from the highest indicated service to the next highest indicated service. That behaviour is seen when the unit value of bandwidth decreases with increasing bandwidth - however, in some indications a purchaser may place an increasing value on a unit of bandwidth as bandwidth increases.
  • the bandwidth broking computer B1 stores network data (Figure 11A) specific to the regional cable network.
  • the network data indicates the different service offerings (first row) which are available in the cable network, and the bandwidth currently available to a user of each service offerings (fifth row), together with the price of bandwidth (fourth row) in each service. Also indicated is the type of each of the service offerings (third row). A service offering number is associated with each of the services (second row). Finally, the value of the volatility index to be used in obtaining the probability density function which describes the amount of bandwidth at a time T after bandwidth b i was available is given for each of the service offerings (sixth row).
  • the data indicate that the cable network offers a high-priority (Priority 1) service offering, a mid-priority (Priority 2) service type and a best-effort service type. All three services are variable-bandwidth services - the volatility of the services increasing in the above order.
  • the network data ( Figure 11B) stored at the bandwidth broker computer B2 of the DSL network ( Figure 3) indicates that the DSL network offers two service offerings, the first being of the constant bit-rate type and the second being of the dynamically-priced type.
  • the price of bandwidth and the amount of bandwidth available to a user are given. Also given is the volatility of the price of the dynamically-priced service offering.
  • Figures 12 to 23 are flow charts illustrating the operation of a computer under the control of a 'generic' network service purchasing agent program - the program is 'generic' in the sense that it can select between constant bit-rate, variable bandwidth and dynamically-priced services.
  • the program is executed by a network's bandwidth broker computer (B1 or B2) when that computer receives a quality of delivery specification from the local agent computer (A1 or A2).
  • the bandwidth broker computer On receiving the quality of delivery specification ( Figure 7) for this content file / user combination ( Figure 8, step 8) the bandwidth broker computer generates a blacklist of those service offerings available from the network which do not meet the acceptable risk requirement as out in the quality of delivery specification.
  • the generation of the blacklist begins with the setting out of the list of known network service types (step 220).
  • the process then enters a loop of instructions (step 224 to step 246), each iteration of that loop involving the carrying out of a service offering evaluation process.
  • the service offering valuation process begins with a check to find whether the nth service offering by the network is of a recognised type (step 226). If it is not included in the service type list generated in step 220 then the bandwidth broker computer (B1 or B2) reports the presence of an unknown service type (step 228). If the service type is recognised then a test (step 230) is carried out to find whether the service is of a constant bit rate type. If it is, then the process proceeds to the next iteration of the loop (if any). If the nth service is not of a constant bit rate service type then a further test is carried out to find whether it is a dynamically-priced service offering (step 232).
  • step 234 If it is a dynamically-priced service offering then a process (step 234) is followed to calculate the probability of the delivery of the content file ceasing prematurely. If the nth service offering is not dynamically priced then a test is carried out (step 236) to find whether the service offering is a variable bandwidth service offering. If the service offering is a variable bandwidth service offering then a process (step 238) is carried out to find the probability of the delivery of the content file ceasing prematurely if that service offering were to be used in delivering the content file.
  • a test is carried out to find whether that probability is greater than the acceptable risk set out in the quality of delivery specification received from the agent computer. If the risk is higher than the maximum acceptable risk then the nth service offerng is added to a blacklist of services which present a greater risk of premature delivery cessation than the purchaser is prepared to countenance (step 242). If the risk is less then the maximum acceptable risk then the next iteration of the loop (if any) is carried out.
  • the process for calculation the probability of premature cessation of delivery when a variable bandwidth offering service is used begins with a check (step 250) to find whether the level of bandwidth currently available (b n ) from this (nth) service offering for a delivery is less than the lowest non zero indicated service in the quality of delivery specification (figure 7). If the currently available amount of bandwidth for the delivery is less than the lowest non zero indicated service then the probability of the delivery ceasing prematurely is set to one (step 252). If, on the other hand, the amount of bandwidth currently available for a delivery is greater than the lowest non zero indicated service then a calculation of the probability of premature cessation of the delivery is made (step 253).
  • That calculation begins with the setting of the value k in the probability distribution function given above to the value found in the network data (figures 11A and 11B) and the setting of the parameter T in the function to the duration D of the delivery as given in the quality of delivery specification.
  • the multiplying factor C is then calculated to ensure that the integral of the function over the all possible values of available bandwidth is equal to one. Having substituted the multiplication factor C, the volatility k, and the duration D into the probability density function given above, the resulting function is integrated between a bandwidth of zero and the lowest non zero indicated service in the quality of delivery specification to find the probability of premature delivery cessation. Once the probability of premature delivery cessation has been found then the process (figure 13A) ends.
  • surplus accumulation rate utility accumulation rate - price of reserved bandwidth
  • surplus accumulation rate utility accumulation rate - price of reserved bandwidth
  • the highest indicated bandwidth represents the highest unit value of bandwidth to the purchaser
  • the highest surplus will be obtained from receiving the highest level of indicated bandwidth until the price rises above the unit value of bandwidth at that highest level, at which point the other indicated bandwidths will offer a negative surplus.
  • the bandwidth reserved for the purchaser will fall in one step from the highest level of bandwidth to nothing in one step as the price of bandwidth rises.
  • the maximum unit value discovery instructions begin with the calculation of the unit value associated with the mth level of indicated service (step 256). Once this has been done, a test (step 257) is carried out to find whether that unit value is greater than the maximum unit value so far discovered. If the value is not greater than the maximum unit value yet discovered then the next iteration of the loop is carried out. However, if that value is greater than the maximum unit value yet discovered, the maximum unit value is updated to equal the unit value just calculated (step 258) and a variable m apex is set to the current value of m (step 259). Once the above loop of instructions has been carried out as many times as there are indicated services the maximum marginal price is calculated (step 262).
  • the maximum marginal price is the price above which the current delivery will not receive any bandwidth from the dynamically- priced service offering. This price is calculated as for a conventional marginal price (that being the price at which the unit cost exceeds the maximum unit value to the purchaser) but is here adjusted to take account of the fact that a purchaser will be prepared to pay a premium to continue the delivery as the delivery nears its end.
  • the adjusted maximum marginal price is therefore calculated as (U(b m apex ) - ( ⁇ S m apex ,O / ⁇ )) / b m apex , where ⁇ is the time-period for which the dynamically-priced service offers reservations and ⁇ S m apex is the penalty associated with the amount of bandwidth provided to the delivery moving from the indicated service which offers the highest unit value to zero bandwidth. This penalty is found in the quality of delivery specification ( Figure 7). It will be understood that the adjustment to the maximum marginal price is that which would occur in the very last reservation period of duration ⁇ required to complete the delivery of the content file.
  • a test is carried out to find whether the current price of bandwidth in the dynamically priced service offering being investigated is greater. If it is greater the delivery will necessarily fail and the probability of premature cessation is set to one (step 264). If, on the other hand, the current price is less than the calculated maximum marginal price then a calculation of the probability premature delivery cessation is made (step 265).
  • the calculation begins with the substitution of the volatility index k, the duration of the content file D into the probability density distribution given in equation 1 above (but with the random variable being price instead of bandwidth).
  • k and Dare obtained from the network data (figure 11B) and quality of delivery specification (figure 7) respectively.
  • the value of C which causes the integral of the probability density function over all possible prices to equal one is calculated. Once that has been calculated, the resulting function is integrated from the maximum marginal price calculated in step 262 up to infinity. The result of that integration is the probability of the delivery ceasing prematurely if this dynamically-priced service offering is used.
  • the bandwidth broker computer further refines its selection of which service to use for a communication. This is done by predicting, for each service which is not blacklisted, the surplus that is likely to be accrued over the duration of the communication. The process will be described below with reference to figures 14 to 22.
  • the process for selecting the service to be used at the start of the delivery (figure 14) is similar to the process for blacklisting certain services in its top level structure. As with the process for creating the blacklist, a loop of instructions (step 274 to step 290) is followed which considers each service offering in turn, but rather than calculating the probability of premature delivery cessation if that service should be selected, the session surplus that is likely to be accrued over the duration of the delivery is calculated instead.
  • a selected service array variable is initialised.
  • This array variable has three fields corresponding to an indicated service number (m), the number of the service offering being considered in the current iteration of the loop (this number being the service offering number given in the network data ( Figures 11A and 11B)), and a maximum session surplus variable. These variables are initialised to values zero, nil, and zero respectively.
  • the service selection process calculates the expected session surplus gained when taking each indicated service from each service offering and updates the selected service array variable when a service (i.e. a given indicated service from a given service offering) is found which offers a session surplus which is greater than the highest session surplus for all the services which have previously been considered.
  • a service i.e. a given indicated service from a given service offering
  • the number of the service offering and the number of the indicated service stored in the selected service array variable are updated to reflect the values associated with the newly favoured service.
  • the selected service array variable contains an indication of the service to be used at the start of the delivery together with an indication of the session surplus that is likely to be accrued from the use of that service to make the delivery.
  • a test is carried out to find whether the service offering currently being considered is on the blacklist created in accordance with the process described above. If the service is on that blacklist then the current iteration ends and the next service offering (if any) is considered. In this way, it is ensured that the service represented in the selected service array variable at the end of the initial service selection process (figure 14) will not be a service provided by a blacklisted service offering.
  • step 280 a calculation of the session surplus to be expected from each indicated service when taken from a constant bit-rate service offering over the duration of the delivery is calculated in step 282. This calculation will now be explained in more detail with reference to figure 15.
  • the calculation of session surplus for a constant bit rate service offering is carried out for each of the indicated services in the quality of delivery specification in turn.
  • the rate of surplus accumulation (which equals the rate of utility accumulation minus the rate of expenditure) is multiplied by the duration of the content file as given in the quality of delivery specification (step 302).
  • a test is then carried out to find whether the session surplus calculated is greater than the maximum session surplus so far found (step 304). If the session surplus is the greatest so far found then the selected service array variable is updated accordingly (step 306). If, on the other hand, the session surplus is less than that found for a previously considered service then a further iteration of the loop is carried out for each of the remaining as yet unconsidered indicated services.
  • the proposed service selection would have to calculate probabilities of service changes that might take place three quarters of the way through the delivery and those probabilities would in turn depend on probabilities of various service changes seven eights of the way through the delivery and so on.
  • the inventors have overcome this problem by assuming that the mid-way point service selection will be made on different criteria - the criteria used is that the service which maximises the instantaneous surplus accumulation rate at that time will be chosen (a penalty is also taken into account here - this is explained below).
  • the service will be maintained throughout the second half of the session - so an equivalent assumption is that the service which maximises the penalised second half surplus will be chosen.
  • the penalised surplus is considered rather than the surplus itself.
  • the penalised surplus is a surplus value which includes a utility penalty if the indicated service chosen for the second half differs from that chosen for the first half.
  • That expected penalised second half surplus is found by assuming that the indicated service which maximises the penalised second half surplus will be chosen for the second half of the delivery.
  • the problem then is that the surplus for the different services cannot be found directly since the price of a dynamically-priced service offering or the bandwidth available from a variable-bandwidth service offering at the mid-way point cannot be known at the start of the delivery.
  • the inventors have overcome that problem by calculating 5 for any variable bandwidth offering, the ranges of available bandwidth which would lead to a given service providing the maximum penalised second half surplus (i.e. which would lead to that service being selected for the second-half).
  • the probability of the bandwidth then being in that range can be found from the above probability density function.
  • an expected second half surplus for the variable-bandwidth service offering is obtained.
  • the session surplus was predicted by a series of service change points at 30 second intervals, then the number of possible combinations of services used in a delivery lasting for a number (P, say) of 30 second reservation periods would be 81 P . For most deliveries this leads to an astronomical number of combinations to be 30 considered - hence the problem of predicting the session surplus might be thought intractable.
  • the problem increases in the case of variable bandwidth services where the bandwidth supplied to a delivery may vary in a time period of a similar length to the time taken to send a packet at the transmission rate of the link that leads from the store where the packet is held.
  • the calculation of the expected session surplus where a dynamically-priced service offering is used (figure 16 - which corresponds to step 285 in Figure 14) carries out a loop of instructions (steps 324 to 335) for each of the indicated services in the quality of delivery specification (figure 7).
  • the loop of instructions begins with the calculation of the surplus which results from the mth indicated service being provided to the purchaser for the first half of the delivery (step 324).
  • $ n,0 refers to the price of bandwidth in the nth service offering at the start of the delivery.
  • the subscript i in the expression S i (m,n) indicates that the surplus calculated in step 324 relates to the initial half of the delivery.
  • step 326 is carried out to find the expected penalised second half surplus that will be obtained in the second half of the delivery. Note that the caret above the 'S' indicates penalisation. Penalisation will be explained in more detail below with reference to figure 18.
  • the two are added together to give the expected session surplus if the mth indicated service is taken from the nth service offering. Once this sum has been calculated, it is compared to the maximum session surplus found so far (step 330). If the expected session surplus is greater than the maximum session surplus so far found then the selected service array variable is updated with the service (m,n) currently being considered, and the associated expected session surplus (step 332). The loop of instructions is then repeated for any indicated services that have not yet been considered. Once all the indicated services have been considered then the consideration of the dynamically-priced service offering currently being considered ends (step 336).
  • the process for calculating the expected session surplus (Figure 17) performed by the bandwidth broker computer (figure 16B) is identical to the process for calculating the expected session surplus where a dynamically-priced service offering is being considered save for one extra processing step.
  • This extra processing step is the introduction of a test (step 332) at the start of each iteration of the loop of instructions which finds whether the currently selected variable bandwidth service offering is offering sufficient bandwidth to support the indicated service being considered in the current iteration of the loop of instructions (steps 322 to 335). If the service offering would not be able to provide a service with a level of bandwidth as great as that needed for the currently indicated service then the possibility of using that service is in effect discounted by jumping to the next iteration of the loop of instructions (steps 322 to 335).
  • the calculation of expected penalised second half surplus consists of the steps shown in figure 18.
  • m' and n' in the Figures refer respectively to the indicated service and service offering chosen for the second half of the delivery.
  • the process comprises the repeated iteration of a loop of instructions (steps 344 to 361), once for each of the service offerings which might be used to provide service for the delivery during the second half of that delivery.
  • the consideration of each service offering involves the consideration of each indicated service when provided by that service offering.
  • the loop of instructions comprises a first part in which the expected penalised second half surplus is calculated for the service offering currently being considered (steps 344 to 354), and a second half (steps 356 and 358) in which the maximum of the expected penalised second half surpluses calculated so far is found.
  • Figure 19A illustrates the process carried out by the bandwidth broker computer to determine the expected penalised second half surplus where a dynamically-priced service offering is used for the second half of the delivery.
  • a block of instructions (step 372 to 380) is carried out for each of the indicated services taken from the n'th dynamically-priced service offering. That block of instructions (step 372 to 380) begins with the calculation with the probability of the m'th indicated service being selected given assuming that the n'th dynamically-priced service offering is used for the second half of the delivery. This step (372) will now be explained in more detail with reference to figures 19B and 19C below.
  • a process for calculating a price reaction service sequence begins with the initialisation of a price reaction service sequence array (which has a number of elements which is equal to the number of indicated services within the dynamically-priced service offering currently being considered (including the 'zero' indicated service)) such that each of the elements is set to zero except for the first which is set to the number of indicated services (step 190). This is followed by the initialisation of a step count variable to one (step 192).
  • the indicated service which offered the highest instantaneous surplus would necessarily be that associated with the highest bandwidth.
  • the first element of the array is set to the number of the highest indicated service. The reaction to a rising price will then pass through one or more of the other indicated services until the price reaches such a level (this was calculated as $apex earlier) that the purchaser chooses the zeroth indicated service. It is this sequence of steps that the buyer array intends to record.
  • a step_start variable is set equal to the number of the highest indicated service and a step_finish variable is set to the second highest indicated service (step 194).
  • step 196 the unit value of the indicated service with the highest bandwidth is calculated (step 196). It is to be noted that the unit value rises and falls with the instantaneous surplus accumulation rate in the present case since the price of the variable-bandwidth service is fixed.
  • step 198 the unit value associated with the indicated service having the current value of the step_finish variable as an index number is found (step 198).
  • a test is then carried out to find out whether the unit value at the step_finish is less than the unit value at the step_start (step 200). If it is, then a purchaser operating at the m'th indicated service would not choose to use the (m'-1)th indicated service since he or she would prefer the m'th indicated service. If, however, the opposite is true then a rising price will cause the purchaser to purchase the (m'-1)th indicated service in preference to the mth indicated service. In that case, a step update block of instructions (step 202 to step 208) is carried out.
  • That block of instructions begins with the incrementing of the step count variable to indicate that another step in the purchasers price reaction sequence has been found (step 202). This is followed by an entry being made in the buy array to indicate that the (m'-1)th indicated service would be visited by a purchaser in reaction to a rising price (step 204). Thereafter, the marginal price at which the purchaser would move from the mth indicated service to the (m'-1)th indicated service is found (step 206). As when calculating $apex, account may be taken of the undesirability of changing indicated service if only a short period of the delivery remains.
  • step 198 to step 208 The block of instructions finishes with the setting of the step_start variable to the current value of step_finish (step 208) thereby causing the following iteration of the loop to relate to the next step in the users price reaction sequence.
  • the loop of instructions (step 198 to step 208) is then repeated until the step considered is that which causes the purchaser to cease purchasing bandwidth altogether.
  • a loop of instructions (step 394 to step 402) is then entered which is repeated as many times as there are steps in the purchaser's price reaction sequence.
  • the probability of selecting the member of the purchasers price reaction sequence currently being considered is found. This is calculated by substituting half the duration of the delivery as the time variable in the probability density function which represents the price in the n'th service offering and then integrating that function between the marginal price which causes a purchaser (seeking to maximise the penalised second half surplus) to drop to the indicated service currently being considered and the marginal price which causes the purchaser to drop from the indicated service currently being considered (step 396). This calculation is immediately followed by a calculation of the likely price of the n'th service offering given that the price has caused the purchaser to move to the indicated service currently being considered (step 398).
  • a test is carried out to find out whether the indicated service currently being considered would be adopted by a purchaser in any circumstance. If it would not then the process continues to the next iteration of the loop (if any). If, on the other hand, the m'th indicated service is included within the purchasers price reaction sequence then the expected second half surplus is calculated (step 376) and then modified by the addition of the product of the probability of the m'th indicated service being selected and the penalised second half surplus gained were that indicated service to be provided for the duration of the second half (step 380).
  • the price used in this calculation is the expected price given that price changes have caused the purchaser to select the m'th indicated service as calculated above ( Figure 19C). The above process is then repeated for each of the M'th services until an expected penalised second half surplus has been calculated.
  • variable bandwidth service offering (figures 20A, 20B and 20C) is similar to that set out above for the dynamically-priced service.
  • the reaction sequence found in this case is a reaction to increasing bandwidth rather than a reaction to increasing price. Note that in the Figures $ n' refers to the price of bandwidth in the service offering being considered for the second half of the delivery.
  • the bandwidth broker computer is able to select that service which maximises the expected session surplus. Because of the penalties incurred for choosing a lower indicated service at the half-way point, an initial service which matches the users combined requirements for stability and rate as represented by the utility penalties and the utility of the indicated services is selected.
  • an in-delivery service selection is carried out. This service selection is carried out identically to the initial service selection described above save for a penalty being added (in step 462 in Figure 22) to those subsequent service selections in accordance with the penalty set out by the purchaser in the quality of delivery specification (figure 7) and the calculations involving the duration of the delivery in the initial service selection being replaced with calculations involving the duration of the remainder of the delivery in subsequent service selections.
  • the agent computer A1 sends (step 8) a message indicating the source and destination IP addresses and TCP ports of the content file transfer and the Diff-Serv marking associated with the selected indicated service to the marker 164.
  • the caching server C1 sets up a streaming session with the user's PC 152.
  • the caching server divides the content file into packets and starts sending (step 10) those packets to the user's PC 152 via the marker 164.
  • the marker 164 Once the marker 164 has received the Diff-Serv marking message from the bandwidth broker computer B1, it recognises packets belonging to the content file transfer (the IP address and User Datagram Protocol (UDP) port in the marking instruction will match the corresponding parameters in packets belonging to the content file transfer - note that, since it is operating as a transparent cache, the caching server operates to use the origin server's address as the source address of the packets).
  • the marker marks packets so recognised with a Diff-Serv codepoint that corresponds to the selected bandwidth.
  • the marked packets are forwarded to the CMTS 146 which will schedule the packets sent from it in accordance with the diff-serv codepoints they contain.
  • the bandwidth broker computer B2 of the DSL network running the process explained above is able to select a service from either the variable price service offering or the constant bit-rate service offering.
  • the same process carried out by the bandwidth broker computer B1 of the cable network is, on the basis of the same quality of delivery specification, able to choose an indicated service from one of the three variable bandwidth service offerings.
  • the formula may be specified (in addition to the specification of any parameters such as a and/or b).
  • the formula may be stored with curves used to determine the values of a brm and b brm ;
EP02250674A 2002-01-31 2002-01-31 Sélection de service de réseau Withdrawn EP1335535A1 (fr)

Priority Applications (5)

Application Number Priority Date Filing Date Title
EP02250674A EP1335535A1 (fr) 2002-01-31 2002-01-31 Sélection de service de réseau
CA002474896A CA2474896A1 (fr) 2002-01-31 2003-01-31 Selection de service de reseau
PCT/GB2003/000446 WO2003065653A1 (fr) 2002-01-31 2003-01-31 Sélection de service de réseau
US10/502,851 US8260959B2 (en) 2002-01-31 2003-01-31 Network service selection
EP03734776A EP1470671B1 (fr) 2002-01-31 2003-01-31 Selection de service de reseau

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
EP02250674A EP1335535A1 (fr) 2002-01-31 2002-01-31 Sélection de service de réseau

Publications (1)

Publication Number Publication Date
EP1335535A1 true EP1335535A1 (fr) 2003-08-13

Family

ID=27589159

Family Applications (2)

Application Number Title Priority Date Filing Date
EP02250674A Withdrawn EP1335535A1 (fr) 2002-01-31 2002-01-31 Sélection de service de réseau
EP03734776A Expired - Lifetime EP1470671B1 (fr) 2002-01-31 2003-01-31 Selection de service de reseau

Family Applications After (1)

Application Number Title Priority Date Filing Date
EP03734776A Expired - Lifetime EP1470671B1 (fr) 2002-01-31 2003-01-31 Selection de service de reseau

Country Status (4)

Country Link
US (1) US8260959B2 (fr)
EP (2) EP1335535A1 (fr)
CA (1) CA2474896A1 (fr)
WO (1) WO2003065653A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8019878B1 (en) 2010-03-05 2011-09-13 Brass Monkey, Inc. System and method for two way communication and controlling content in a web browser

Families Citing this family (41)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1239635A1 (fr) * 2001-03-07 2002-09-11 BRITISH TELECOMMUNICATIONS public limited company Procédé pour mettre à la disposition des classes de service dans un réseau de paquets
EP1251669A1 (fr) * 2001-04-19 2002-10-23 BRITISH TELECOMMUNICATIONS public limited company Réseau de communication
JP4217518B2 (ja) * 2003-04-10 2009-02-04 株式会社エヌ・ティ・ティ・ドコモ 移動通信制御方法、制御システム及び移動端末
US7752550B2 (en) * 2003-09-23 2010-07-06 At&T Intellectual Property I, Lp System and method for providing managed point to point services
JP2005149131A (ja) * 2003-11-14 2005-06-09 Toshiba Corp 情報処理装置、方法及びプログラム
WO2006014504A2 (fr) * 2004-07-07 2006-02-09 Sciencelogic, Llc Systeme de gestion de reseau a configuration autonome
US20060167871A1 (en) * 2004-12-17 2006-07-27 James Lee Sorenson Method and system for blocking specific network resources
US20090168752A1 (en) 2007-12-31 2009-07-02 Jonathan Segel Method and apparatus for distributing content
US9538141B2 (en) 2007-12-31 2017-01-03 Alcatel Lucent Method and apparatus for controlling presentation of content at a user terminal
DE202008017174U1 (de) * 2008-12-29 2009-07-30 Telefonaktiebolaget Lm Ericsson (Publ) Vorrichtung zur Datendienstbereitstellung
WO2011056103A1 (fr) * 2009-11-05 2011-05-12 Telefonaktiebolaget Lm Ericsson (Publ) Procédé et agencement permettant une gestion de ressources de réseau
EP2365665A1 (fr) * 2010-03-09 2011-09-14 British Telecommunications PLC Adaptation de capacité entre des classes de service dans un réseau de paquets
JP5768983B2 (ja) * 2010-06-09 2015-08-26 日本電気株式会社 契約違反予測システム、契約違反予測方法および契約違反予測プログラム
US9020830B2 (en) 2011-03-08 2015-04-28 Apptio, Inc. Hierarchy based dependent object relationships
US9275050B2 (en) 2011-10-24 2016-03-01 Apptio, Inc. Global dictionaries using universal primitives
JP2014082756A (ja) * 2012-09-25 2014-05-08 Toshiba Corp 無線通信装置及び方法
US20140136295A1 (en) * 2012-11-13 2014-05-15 Apptio, Inc. Dynamic recommendations taken over time for reservations of information technology resources
US8964953B2 (en) 2013-01-10 2015-02-24 Microsoft Corporation Incremental valuation based network capacity allocation
US9635102B2 (en) * 2013-03-12 2017-04-25 Google Inc. Broker module for managing and monitoring resources between internet service providers
US20140278807A1 (en) * 2013-03-15 2014-09-18 Cloudamize, Inc. Cloud service optimization for cost, performance and configuration
US10417591B2 (en) 2013-07-03 2019-09-17 Apptio, Inc. Recursive processing of object allocation rules
US20150081400A1 (en) * 2013-09-19 2015-03-19 Infosys Limited Watching ARM
US10325232B2 (en) 2013-09-20 2019-06-18 Apptio, Inc. Allocating heritage information in data models
US11244364B2 (en) 2014-02-13 2022-02-08 Apptio, Inc. Unified modeling of technology towers
US9888274B2 (en) 2015-04-21 2018-02-06 Edge2020, Llc Price driven multimedia content reception
US9350561B1 (en) 2015-05-27 2016-05-24 Apptio, Inc. Visualizing the flow of resources in an allocation model
US11151493B2 (en) 2015-06-30 2021-10-19 Apptio, Inc. Infrastructure benchmarking based on dynamic cost modeling
US10268979B2 (en) 2015-09-28 2019-04-23 Apptio, Inc. Intermediate resource allocation tracking in data models
US10387815B2 (en) 2015-09-29 2019-08-20 Apptio, Inc. Continuously variable resolution of resource allocation
US9384511B1 (en) 2015-12-16 2016-07-05 Apptio, Inc. Version control for resource allocation modeling
US9529863B1 (en) 2015-12-21 2016-12-27 Apptio, Inc. Normalizing ingested data sets based on fuzzy comparisons to known data sets
US10726367B2 (en) 2015-12-28 2020-07-28 Apptio, Inc. Resource allocation forecasting
CN105897888B (zh) * 2016-04-08 2020-09-22 腾讯科技（深圳）有限公司 一种客户端连接方法及系统
US10474974B2 (en) 2016-09-08 2019-11-12 Apptio, Inc. Reciprocal models for resource allocation
US10936978B2 (en) 2016-09-20 2021-03-02 Apptio, Inc. Models for visualizing resource allocation
US10482407B2 (en) 2016-11-14 2019-11-19 Apptio, Inc. Identifying resource allocation discrepancies
US10157356B2 (en) 2016-12-14 2018-12-18 Apptio, Inc. Activity based resource allocation modeling
US10268980B1 (en) 2017-12-29 2019-04-23 Apptio, Inc. Report generation based on user responsibility
US11775552B2 (en) 2017-12-29 2023-10-03 Apptio, Inc. Binding annotations to data objects
US10324951B1 (en) 2017-12-29 2019-06-18 Apptio, Inc. Tracking and viewing model changes based on time
US11704617B2 (en) * 2019-06-20 2023-07-18 Stripe, Inc. Systems and methods for modeling and analysis of infrastructure services provided by cloud services provider systems

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0848560A2 (fr) * 1996-12-13 1998-06-17 Siemens Business Communication Systems, Inc. Procédé avec système pour l'augmentation de qualité du service à ou sous une limite de dépense
WO2000013390A1 (fr) * 1998-08-27 2000-03-09 Motorola Limited Prestation d'un service dans un systeme de communication
WO2000014919A2 (fr) * 1998-09-02 2000-03-16 N.C.C. Export Systems 1995 Ltd. Systeme et procede pour connecter un utilisateur de reseau a un fournisseur de service de reseau
US6104720A (en) * 1997-04-28 2000-08-15 Intel Corporation Dynamic communication path selection for data transmission between computers
US6243754B1 (en) * 1999-01-08 2001-06-05 International Business Machines Corporation Dynamic selection of network providers
EP1113629A2 (fr) * 1999-12-30 2001-07-04 At&T Wireless Services, Inc. Dispositif et procédé d'enregistrement à une session

Family Cites Families (100)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI92362C (fi) 1992-12-14 1994-10-25 Nokia Telecommunications Oy Menetelmä kehysvälitysverkon ylikuormitustilanteiden hallitsemiseksi sekä kehysvälitysverkon solmu
US5408465A (en) 1993-06-21 1995-04-18 Hewlett-Packard Company Flexible scheme for admission control of multimedia streams on integrated networks
US5367523A (en) 1993-08-26 1994-11-22 International Business Machines Corporation Adaptive rate-based congestion and flow control in packet communications networks
US5446730A (en) 1993-09-20 1995-08-29 Motorola, Inc. Method for dynamic connection management in integrated communication networks
EP0660569A1 (fr) 1993-12-22 1995-06-28 International Business Machines Corporation Procédé et système pour améliorer le temps de traitement de la sélection de route dans un réseau de commutation de paquets à grande vitesse
WO1995033322A1 (fr) 1994-05-27 1995-12-07 British Telecommunications Public Limited Company Systeme de transmission de donnees dote d'un dispositif de commutation de canaux
US7362775B1 (en) 1996-07-02 2008-04-22 Wistaria Trading, Inc. Exchange mechanisms for digital information packages with bandwidth securitization, multichannel digital watermarks, and key management
GB9508283D0 (en) * 1995-02-07 1995-06-14 British Telecomm Information services provision and management
CA2168484C (fr) 1995-03-13 2000-12-05 Mehmet Reha Civanlar Architecture client-serveur utilisant internet et les reseaux commutes publics
US6775519B1 (en) 1995-06-07 2004-08-10 Globalstar L.P. Method and apparatus for accounting for user terminal session-based connection to a satellite communication system
JP3613863B2 (ja) * 1995-07-19 2005-01-26 株式会社日立製作所 ネットワーク接続システム及び並列ネットワーク接続方法
US5917822A (en) 1995-11-15 1999-06-29 Xerox Corporation Method for providing integrated packet services over a shared-media network
GB2311439A (en) 1996-03-21 1997-09-24 Northern Telecom Ltd Data communication network
US5991306A (en) 1996-08-26 1999-11-23 Microsoft Corporation Pull based, intelligent caching system and method for delivering data over a network
GB9624419D0 (en) 1996-11-23 1997-01-08 Inmedia Investment Ltd Communication system for delivery of content over electronic networks
US5875175A (en) 1997-05-01 1999-02-23 3Com Corporation Method and apparatus for time-based download control
JP3213697B2 (ja) 1997-01-14 2001-10-02 株式会社ディジタル・ビジョン・ラボラトリーズ 中継ノードシステム及び同システムにおける中継制御方法
US6041039A (en) 1997-03-20 2000-03-21 Nokia Telecommunications, Oy System and method for determining network bandwidth availability using priority level feedback
US6345300B1 (en) 1997-03-25 2002-02-05 Intel Corporation Method and apparatus for detecting a user-controlled parameter from a client device behind a proxy
US5982736A (en) 1997-05-15 1999-11-09 Pierson; Gerald A. Trading card optical compact disc and methods of using and forming same
US5991810A (en) 1997-08-01 1999-11-23 Novell, Inc. User name authentication for gateway clients accessing a proxy cache server
US6295294B1 (en) 1997-08-07 2001-09-25 At&T Corp. Technique for limiting network congestion
US6108306A (en) * 1997-08-08 2000-08-22 Advanced Micro Devices, Inc. Apparatus and method in a network switch for dynamically allocating bandwidth in ethernet workgroup switches
AU9084398A (en) 1997-09-09 1999-03-29 British Telecommunications Public Limited Company Packet network
US6029203A (en) 1997-09-26 2000-02-22 3Com Corporation Apparatus and methods for use therein for an ISDN LAN modem that provides enhanced network activity
JPH11110324A (ja) 1997-10-07 1999-04-23 Hitachi Ltd 代理サーバ選択装置および代理サーバ
US6078919A (en) 1997-10-23 2000-06-20 Lucent Technologies Inc. Method and apparatus for delivery of data over a network based on determination of network parameters
US6108307A (en) 1997-12-12 2000-08-22 Newbridge Networks Corporation Frame relay priority queses to offer multiple service classes
US6775670B2 (en) 1998-05-29 2004-08-10 Luc Bessette Method and apparatus for the management of data files
US20020055906A1 (en) * 1998-03-11 2002-05-09 Katz Ronald A. Methods and apparatus for intelligent selection of goods and services in telephonic and electronic commerce
US6691148B1 (en) 1998-03-13 2004-02-10 Verizon Corporate Services Group Inc. Framework for providing quality of service requirements in a distributed object-oriented computer system
US6073175A (en) 1998-04-27 2000-06-06 International Business Machines Corporation Method for supporting different service levels in a network using web page content information
US6144996A (en) 1998-05-13 2000-11-07 Compaq Computer Corporation Method and apparatus for providing a guaranteed minimum level of performance for content delivery over a network
US6154778A (en) 1998-05-19 2000-11-28 Hewlett-Packard Company Utility-based multi-category quality-of-service negotiation in distributed systems
US6229788B1 (en) 1998-05-27 2001-05-08 Nortel Networks Limited Method and apparatus for traffic shaping in a broadband fiber-based access system
DE69934898T2 (de) 1998-06-05 2007-11-15 British Telecommunications P.L.C. Abrechnung in einem kommunikationsnetz
FI105749B (fi) 1998-06-12 2000-09-29 Ericsson Telefon Ab L M Dataverkkoliikennöinti
US7515583B2 (en) * 1998-06-19 2009-04-07 Nortel Networks Limited Method and apparatus for providing a configurable quality of service threshold for voice over internet protocol
US6594246B1 (en) 1998-07-10 2003-07-15 Malibu Networks, Inc. IP-flow identification in a wireless point to multi-point transmission system
US6690929B1 (en) * 1998-08-03 2004-02-10 Lucent Technologies Inc. Dynamic quality-of-service and pricing in communication system
GB9822550D0 (en) 1998-10-15 1998-12-09 British Telecomm Computer communications
US6999421B1 (en) 1998-10-26 2006-02-14 Fujitsu Limited Adjustable connection admission control method and device for packet-based switch
US6654374B1 (en) * 1998-11-10 2003-11-25 Extreme Networks Method and apparatus to reduce Jitter in packet switched networks
US6522875B1 (en) 1998-11-17 2003-02-18 Eric Morgan Dowling Geographical web browser, methods, apparatus and systems
US6608816B1 (en) 1998-11-18 2003-08-19 Nortel Networks Limited Method and apparatus for providing differentiated services using a multi-level queuing mechanism
WO2000035130A1 (fr) 1998-12-04 2000-06-15 Ukiah Software, Inc. Instrument de gestion de politique valide par repertoire dans la gestion intelligente du trafic
US6483805B1 (en) 1998-12-28 2002-11-19 Nortel Networks Limited Internet differentiated services service for transaction applications
US6449650B1 (en) 1999-02-01 2002-09-10 Redback Networks Inc. Methods and apparatus for deploying quality of service policies on a data communication network
US6668046B1 (en) * 1999-05-18 2003-12-23 Motorola, Inc. Method and system for generating a user's telecommunications bill
US7006530B2 (en) * 2000-12-22 2006-02-28 Wi-Lan, Inc. Method and system for adaptively obtaining bandwidth allocation requests
US6631122B1 (en) * 1999-06-11 2003-10-07 Nortel Networks Limited Method and system for wireless QOS agent for all-IP network
US6957255B1 (en) 1999-06-28 2005-10-18 Amdocs (Israel) Ltd. Method and apparatus for session reconstruction and accounting involving VoIP calls
US6556998B1 (en) 2000-05-04 2003-04-29 Matsushita Electric Industrial Co., Ltd. Real-time distributed file system
US6539425B1 (en) 1999-07-07 2003-03-25 Avaya Technology Corp. Policy-enabled communications networks
US6621895B1 (en) * 1999-08-31 2003-09-16 Nortel Networks Limited Enhanced communication services for data networks
US7054267B2 (en) * 1999-09-10 2006-05-30 Lucent Technologies Inc. Method and apparatus for scheduling traffic to meet quality of service requirements in a communication network
US6801501B1 (en) * 1999-09-14 2004-10-05 Nokia Corporation Method and apparatus for performing measurement-based admission control using peak rate envelopes
AU2752201A (en) * 1999-11-08 2001-06-06 Megaxess, Inc. Quality of service (qos) negotiation procedure for multi-transport protocol access for supporting multi-media applications with qos assurance
US7130807B1 (en) * 1999-11-22 2006-10-31 Accenture Llp Technology sharing during demand and supply planning in a network-based supply chain environment
US6744767B1 (en) 1999-12-30 2004-06-01 At&T Corp. Method and apparatus for provisioning and monitoring internet protocol quality of service
EP1249102A2 (fr) 2000-01-14 2002-10-16 Qariba Limited Attribution de ressources
US6816456B1 (en) 2000-02-04 2004-11-09 At&T Corp. Methods and apparatus for network use optimization
EP1256210A2 (fr) * 2000-02-04 2002-11-13 HRL Laboratories, LLC Systeme de controle de la qualite du service en fonction du prix au sein de reseaux
US20030093414A1 (en) * 2000-11-14 2003-05-15 Steve Litzow System and method for dynamic price setting and facilitation of commercial transactions
US6842783B1 (en) 2000-02-18 2005-01-11 International Business Machines Corporation System and method for enforcing communications bandwidth based service level agreements to plurality of customers hosted on a clustered web server
US6834341B1 (en) 2000-02-22 2004-12-21 Microsoft Corporation Authentication methods and systems for accessing networks, authentication methods and systems for accessing the internet
US20020152305A1 (en) 2000-03-03 2002-10-17 Jackson Gregory J. Systems and methods for resource utilization analysis in information management environments
JP3617406B2 (ja) * 2000-03-30 2005-02-02 日本電気株式会社 マルチドメインに対応した品質保証型通信サービス提供方式およびサービス提供方法並びにサービス仲介装置
US6772214B1 (en) 2000-04-27 2004-08-03 Novell, Inc. System and method for filtering of web-based content stored on a proxy cache server
US7299284B2 (en) * 2000-05-19 2007-11-20 Scientific-Atlanta, Inc. Solicitations for allocations of access across a shared communications medium
US6611863B1 (en) 2000-06-05 2003-08-26 Intel Corporation Automatic device assignment through programmable device discovery for policy based network management
US20020099613A1 (en) * 2000-06-14 2002-07-25 Garret Swart Method for forming and expressing reservables and engagements in a database for a transaction service
US20070038523A1 (en) * 2000-06-19 2007-02-15 E4X Inc. System and method for transactional hedging
EP1295454B1 (fr) * 2000-06-30 2005-05-11 BRITISH TELECOMMUNICATIONS public limited company Communication de donnees paquet
US7020086B2 (en) * 2000-07-03 2006-03-28 Telefonaktiebolaget Lm Ericsson (Publ) Lagrange quality of service routing
US6725265B1 (en) 2000-07-26 2004-04-20 International Business Machines Corporation Method and system for caching customized information
US7321932B1 (en) * 2000-08-15 2008-01-22 Nortel Networks Limited System, device, and method for managing connection establishment and related services in an optical communication system
US7412514B2 (en) 2000-08-17 2008-08-12 Hoshiko Llc Method and apparatus for improving bandwidth efficiency in a computer network
US6678793B1 (en) 2000-09-27 2004-01-13 International Business Machines Corporation User-based selective cache content replacement technique
US6822940B1 (en) 2000-09-29 2004-11-23 Cisco Technology, Inc. Method and apparatus for adapting enforcement of network quality of service policies based on feedback about network conditions
US6567893B1 (en) 2000-11-17 2003-05-20 International Business Machines Corporation System and method for distributed caching of objects using a publish and subscribe paradigm
US6914883B2 (en) * 2000-12-28 2005-07-05 Alcatel QoS monitoring system and method for a high-speed DiffServ-capable network element
EP1239635A1 (fr) 2001-03-07 2002-09-11 BRITISH TELECOMMUNICATIONS public limited company Procédé pour mettre à la disposition des classes de service dans un réseau de paquets
US7433311B1 (en) * 2001-03-19 2008-10-07 Cisco Technology, Inc. Methods and apparatus for allocating resources in a communications system
US7116682B1 (en) 2001-03-19 2006-10-03 Cisco Technology, Inc. Methods and apparatus for dynamic bandwidth adjustment
US20030115480A1 (en) * 2001-12-17 2003-06-19 Worldcom, Inc. System, method and apparatus that employ virtual private networks to resist IP QoS denial of service attacks
US6778498B2 (en) * 2001-03-20 2004-08-17 Mci, Inc. Virtual private network (VPN)-aware customer premises equipment (CPE) edge router
US7796608B2 (en) * 2001-03-20 2010-09-14 Verizon Business Global Llc Edge-based per-flow QoS admission control in a data network
US7085737B2 (en) 2001-03-22 2006-08-01 International Business Machines Corporation Method and apparatus for meta-shopping and dynamic setup of B2B eCommerce
US7269157B2 (en) * 2001-04-10 2007-09-11 Internap Network Services Corporation System and method to assure network service levels with intelligent routing
EP1251669A1 (fr) 2001-04-19 2002-10-23 BRITISH TELECOMMUNICATIONS public limited company Réseau de communication
US7227842B1 (en) * 2001-04-24 2007-06-05 Tensilica, Inc. Fast IP packet classification with configurable processor
US6662024B2 (en) * 2001-05-16 2003-12-09 Qualcomm Incorporated Method and apparatus for allocating downlink resources in a multiple-input multiple-output (MIMO) communication system
EP1407406A1 (fr) 2001-07-17 2004-04-14 BRITISH TELECOMMUNICATIONS public limited company Reseau de communication
US7222190B2 (en) * 2001-11-02 2007-05-22 Internap Network Services Corporation System and method to provide routing control of information over data networks
US7453801B2 (en) * 2001-11-08 2008-11-18 Qualcomm Incorporated Admission control and resource allocation in a communication system supporting application flows having quality of service requirements
US6724727B2 (en) * 2001-12-03 2004-04-20 Nokia Corporation Policy-based forward error correction in packet networks
US20030135609A1 (en) * 2002-01-16 2003-07-17 Sun Microsystems, Inc. Method, system, and program for determining a modification of a system resource configuration
US7539756B2 (en) * 2002-01-31 2009-05-26 Darby & Mohaine, L.L.C. Method and system of data packet transmission timing for controlling bandwidth
US20030152039A1 (en) 2002-02-08 2003-08-14 Timothy Roberts Customer billing in a communications network

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0848560A2 (fr) * 1996-12-13 1998-06-17 Siemens Business Communication Systems, Inc. Procédé avec système pour l'augmentation de qualité du service à ou sous une limite de dépense
US6104720A (en) * 1997-04-28 2000-08-15 Intel Corporation Dynamic communication path selection for data transmission between computers
WO2000013390A1 (fr) * 1998-08-27 2000-03-09 Motorola Limited Prestation d'un service dans un systeme de communication
WO2000014919A2 (fr) * 1998-09-02 2000-03-16 N.C.C. Export Systems 1995 Ltd. Systeme et procede pour connecter un utilisateur de reseau a un fournisseur de service de reseau
US6243754B1 (en) * 1999-01-08 2001-06-05 International Business Machines Corporation Dynamic selection of network providers
EP1113629A2 (fr) * 1999-12-30 2001-07-04 At&T Wireless Services, Inc. Dispositif et procédé d'enregistrement à une session

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8019878B1 (en) 2010-03-05 2011-09-13 Brass Monkey, Inc. System and method for two way communication and controlling content in a web browser
US8019867B1 (en) 2010-03-05 2011-09-13 Brass Monkey Inc. System and method for two way communication and controlling a remote apparatus
US8024469B1 (en) 2010-03-05 2011-09-20 Brass Monkey Inc. System and method for connecting network sockets between applications
US8166181B2 (en) 2010-03-05 2012-04-24 Brass Monkey, Inc. System and method for two way communication and controlling content on a display screen
US8171145B2 (en) 2010-03-05 2012-05-01 Brass Monkey, Inc. System and method for two way communication and controlling content in a game

Also Published As

Publication number Publication date
US20060149854A1 (en) 2006-07-06
EP1470671B1 (fr) 2011-12-21
WO2003065653A1 (fr) 2003-08-07
CA2474896A1 (fr) 2003-08-07
US8260959B2 (en) 2012-09-04
EP1470671A1 (fr) 2004-10-27

Similar Documents

Publication Publication Date Title
EP1470671B1 (fr) Selection de service de reseau
US6134589A (en) Dynamic quality control network routing
US6975594B1 (en) System and method for providing controlled broadband access bandwidth
KR100717941B1 (ko) 인터넷망에서 과금을 위한 종량제 과금 장치 및 그 방법
US20040010592A1 (en) Resource allocation
US6671285B1 (en) Method for charging in a data communication network
Ganesh et al. Congestion pricing and user adaptation
JP2002526978A (ja) 電気通信リソースのネゴシエーションのための方法およびシステム
Garg et al. A SLA framework for QoS provisioning and dynamic capacity allocation
CA2453645A1 (fr) Reseau de communication
US6385169B1 (en) Allocation of bandwidth in a packet switched network among subscribers of a service provider
CA2264407A1 (fr) Methode et systeme pour negocier des ressources de telecommunications
Walker et al. Tariffing in the new IP/ATM environment
Courcoubetis et al. Providing bandwidth guarantees over a best-effort network: call-admission and pricing
Chang et al. A survey of pricing for integrated service networks
Wang et al. Comparative study of two congestion pricing schemes: auction and tâtonnement
Baglietto et al. A proposal of new price-based call admission control rules for guaranteed performance services multiplexed with best effort traffic
CN101610493B (zh) 下一代网络中基于用户体验质量策略的计费方法
Almay Pricing in the Internet
Evlogimenou et al. Programmable accounting management for virtual private networks
Baglietto et al. Integration of pricing models between best-effort and guaranteed performance services in telecommunication networks
Courcoubetis et al. Charging issues for services in broadband networks
Graber Internet pricing: economic approaches to transport services and infrastructure
Wang Scalable network architectures, protocols and measurements for adaptive quality of service
Altmann et al. Managing usage-based pricing in a future telecommunication market

Legal Events

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

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

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

AX Request for extension of the european patent

Extension state: AL LT LV MK RO SI

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