JP2004503958A - Bidding mechanism for determining preferred network connection - Google Patents

Abstract

A computer network is provided wherein a connection is established and bandwidth is allocated to the user according to the price of the connection requested by the user.
In other words, the network conducts an auction in which a user who has applied for a higher payment for a connection has a higher priority in obtaining network bandwidth than a user who has applied for a lower fee. Make sure the order is given.

Description

[0001]
TECHNICAL FIELD OF THE INVENTION
The present invention relates generally to the field of communication networks, and more particularly, to controlling bit rates and connection times in prioritized and cost-controlled communications.
[0002]
[Prior art]
Many communication networks use mechanisms to reduce costs. For example, the "minimum toll route selection", "automatic route selection" and "automatic detour route selection" (LCR / ARS / AAR) mechanisms track the operator's fees and modify the routing table accordingly. The mechanism then examines the connection attempt and determines which operator is the most economically advantageous choice for that connection. If the connection fails, the mechanism can use the default operator.
[0003]
The connection route can also be selected according to the bidding process between the involved operators. See U.S. Patent Nos. 5,606,602 and 5,995,602. In that patent, each operator informs an auction intermediary of the fees that they would like to charge for service between two specific points in the network. The "bid" fee may be lower than the established fee for a number of reasons, such as the operator having excessive bandwidth capacity on the route at that time. The operator can change the bid price as desired within the day as the traffic pattern changes. The mediator collects the bid information and sends the information to the user. Thereafter, each user can select a business operator based on the lowest fee.
[0004]
U.S. Pat. No. 5,371,780 describes a bidding mechanism for resource allocation in a cellular network with a large number of fast moving users and a high traffic volume. Resources such as carrier frequencies, time slots or specific code division multiple access sequences are auctioned to competing users according to the priority assigned to each user. The priority may be based on the quality of service or the user's specific needs during the time when the users are competing for resource reservation, eg, when the user's request for resources may be increased by the need to perform a handoff. May be based on gender.
[0005]
In that case, the resource allocation includes a bidding time at which a determination is made as to which user of the group of competing users has the highest priority. The quota is then used for the quota when the available communication resources are actually assigned to the user with the highest priority. Thereafter, the bidding and quota time is repeated for the remaining competing users until no competing users are left or all available resources are exhausted.
[0006]
In computer networks such as the Internet, another allocable resource is bandwidth. Bandwidth is the bit rate used to transmit a message. RSVP (Resource Reservation Protocol), working at the Internet Engineering Task Force (IETF), allows users to specify the minimum bandwidth they need when establishing a connection. Generally, bandwidth is allocated to connections based on a first come, first served basis. Therefore, there may be a case where a connection cannot be established at a desired bit rate due to lack of bandwidth. In an emergency, this can cause serious problems.
[0007]
Under RSVP, a user can establish an RSVP connection that is guaranteed a minimum amount of bandwidth in advance and anticipates the need for future emergency connections. However, this creates a situation where if an emergency should not occur, excess bandwidth is reserved but unused. In the worst case, many users will reserve bandwidth and the required bandwidth will always exceed the total bandwidth of the network.
[0008]
[Problems to be solved by the invention]
Therefore, there is a need to allocate network bandwidth to users in other ways than on a first-come, first-served basis. It is further desirable to allocate bandwidth based on priority so that emergency calls can be handled in a fair manner. Further, it is desirable to establish a connection within a predetermined maximum time.
[0009]
[Means for Solving the Problems]
The present invention provides a computer network in which a connection is established and bandwidth is allocated to the user according to the price of the connection requested by the user. In other words, the network conducts an auction such that users who apply for higher payments for a connection are given a higher priority in obtaining bandwidth than users who apply for lower rates. To
[0010]
The present invention has the following advantages. Users who need to transmit urgent messages can secure the required bandwidth in high priority by applying for a higher price, even when the network is near maximum capacity. At the same time, the network can prevent the user from reserving unused bandwidth or reserving high bit rates for non-critical applications.
[0011]
More specifically, the present invention provides a communication network including user equipment and a router connected by a communication link. Each source user device includes a connection request device, and each router includes a connection control device. The connection request device generates a connection request message including a minimum bit rate and a unit price, and a bidding process. Optionally, the message may also include a maximum time to connect. The connection controller is configured to establish a connection between the source user device and the destination user device according to the bit rate, the unit price, the bidding process and the optional maximum connection time.
[0012]
The connection request device determines an initial route for the connection, and transmits a connection request message to the first router along the route. The connection control device of the router further comprises an input and an output connected by the switching mechanism. The memory stores a connection management table as data, a connection time interval table for each output link, and a time interval parameter, stores a connection management device and a plurality of connection agents as software, Is configured so that there is one connection agent.
[0013]
The connection management device registers and deletes a connection record in the connection management table. Each record contains a unique connection identification for each router, the source identification of the source user equipment, the source user identification, the destination identification of the destination user equipment, the destination user identification, and the connection It comprises a plurality of fields including an input link, an output link of the connection, a priority indication, a bit rate, and a unit price.
[0014]
Connection management apparatus, at the start of each update interval T _i, is initialized to record the connect time interval table. When the connection time interval table includes a record having fields, the fields include a connection identification, a unit price, a bit rate, and a desired maximum connection time.
[0015]
When a bit rate B per time interval T is required, the router transmits at least n messages per time interval T. Here, n is the smallest integer that satisfies the formula n * (S / T) ≧ B, and S is the bit length of each message.
[0016]
BEST MODE FOR CARRYING OUT THE INVENTION
System Overview FIG. 1 shows a communication network 100 according to the present invention. Network 100 comprises a number of network routers 101 and user equipment (UD) 102 connected to each other by a network link 103. The network 100 can use the Internet or other similar public, wireless, or private networks. As an important feature, the connections on the network can have an assignable bit rate. The user device can be a computer, terminal, or other communication device, such as a wireless telephone device.
[0017]
The invention allows the user to bid on the lowest bit rate and the maximum time to connect. For example, a user who wants to send and receive relatively long messages, e.g., send and receive video that lasts 2 hours, waits 5-10 minutes to obtain a high bit rate connection at the lowest possible cost. Will be willing to do that. In contrast, users who need to send relatively short urgent messages will pay a higher than normal price to get a connection as soon as possible, even if the connection has a reduced bit rate. You may be willing to do so.
[0018]
According to the present invention, each router includes a connection control device 104, and each user device 102 includes a connection request device 105. These will be described in more detail below.
[0019]
Overview of Operation During operation of the network 100, a user of a source user device can use the connection request device 105 to request a connection to a destination user device. In particular, users of the present invention desire a priority connection with a minimum guaranteed bandwidth and / or maximum connection time. Minimum bandwidth means that the network guarantees that the bit rate is above the minimum speed. The maximum connection time means that the time for connection is shorter than the maximum time. In practice, the user may wish to apply for a higher than normal fee for this priority connection. When a user requests such a connection, the originating user equipment generates a connection request message 110. This message includes a minimum bit rate 111, a unit price 112, a maximum option time 113, and a bidding process 114.
[0020]
Bit rate 111 specifies the minimum desired bandwidth for the connection. Unit price 112 is the fee that the user will or will pay per unit time to use the connection. The maximum time 113 specifies the maximum time it takes to establish the connection, and the bidding process 114 defines a method for establishing the connection according to the expected unit price and maximum time requirements.
[0021]
Thereafter, the connection requesting device 105 can determine an initial route for the desired connection using the existing routing table. The route is a series of routes between the source user device and the destination user device. Thereafter, the connection request device transmits a connection request message 110 to the first router along the route.
[0022]
Overview of Router Structure FIG. 2 shows a router 200 according to the present invention, which will be described in detail below. The router 200 includes an input link 211 and an output link 212. The router also includes an exchange mechanism 213, for example, a crossbar exchange mechanism or a similar exchange mechanism. These components can be conventional.
[0023]
The connection control device 104 includes a connection management device 214, a connection management table (CMT) 300, a connection time interval table (CIT) 400 for each output link, a time interval parameter (T) 217, And a plurality of connection agents (A) 218 so that one connection agent exists. The tables and parameters can be stored as data in router memory. The connection management device and the agent can also be stored in memory as software for execution on the processor of the router.
[0024]
The router operation message is received by the router 200 via the input link 211. All connections passing through the router 200 are registered in the connection management table 300. From there, the message passes through switching mechanism 213 and reaches output link 212. The switching mechanism refers to the connection management table to determine which output link will be selected for a particular outgoing message. The router schedules the transmission of the message to satisfy the parameters in the request message 110.
[0025]
In other words, if a minimum bandwidth of B bits per time interval T is required, the switching mechanism transfers at least n messages per interval T. Here, n is the smallest integer that satisfies the formula n * (S / T) ≧ B, and S is the bit length of the message.
[0026]
As shown in FIG. 3, the connection management device registers and deletes a connection record (a record (row) for a field (column) of the table) in the connection management table 300. Each record 301 includes a number of fields 302. The fields include a connection identification (CID) 311, unique to each router, a source identification (SID) 312 of the source user equipment, a source user identification (SUID) 313, a destination identification (DID) 314, Destination user identification (DUID) 315, input link (IL) 316 and output link (OL) 317 for the connection, priority indication (P) 318, and the user has applied for a priority connection Bandwidth (B) 319 and unit price 320. The priority indicator indicates whether a priority connection according to the present invention will be established. If not, a conventional connection can be established. The minimum bandwidth field is optional and the maximum time to connect can also be stored as a parameter.
[0027]
Each connection has an associated connection agent 218. The connection agent is responsible for obtaining the required bandwidth, possibly in the shortest possible time. The bandwidth is obtained by performing negotiation with the connection management device 214. As a result of this negotiation, some connections may gain bandwidth, while other connections may have reduced bandwidth. The connection management device updates the contents of the connection management table 300 based on the result of the negotiation. The updated table is accessed by the switching mechanism to determine the input-output connection network.
[0028]
The connection manager updates the bandwidth allocation at each time interval T. Here, allocation refers to the distribution of bandwidth over all connections by a particular output link. Allocation of bandwidth for the next time interval T _{(i + 1)} is executed before the update time in the interval T _i. However, the interval has a time equal to the time interval parameter T217.
[0029]
As further shown in detail in FIG. 4, the connection management apparatus, at the start of each update interval T _i, initializes the contents of connection time interval table 400. The table 400 includes a record 401 having a field 402. The fields include a connection identification (CID) 411, a unit price 412, a bandwidth (B) 413 and an optional maximum connection time. As described below, the records 401 are arranged in the order in which the unit price 412 is decreasing (descending order).
[0030]
During each update time interval T _i, each connection agent 218, according to the following registration rules, the connect time interval table 400, it is possible to register a record for that connection.
[0031]
Registration rules 1. The connection agent registers exactly one record for the connection. 2. When registering a new record or changing a registered record, the connection agent arranges the records in the table in order of decreasing unit price.
3. When there are two or more records having the same unit price, the record registered first is arranged before the record registered later.
4. If the total bandwidth of all records in the table exceeds the total bandwidth available on the output link after registration, or during a record change, the record with the lowest unit price is deleted. Deleting a record for a connection basically means that the connection will have a non-priority communication at that time as before. This rule is repeated until the total bandwidth is less than or equal to the bandwidth available on the output link. Note that a user who has refused or lost a preferred connection can always generate another connection request message, possibly bidding for a higher price.
5. When the time interval _Ti is completed, the connection management device ends the registration, and the connection management table 300 is updated according to the contents of the connection interval table at that time.
[0032]
Note that the present invention can be implemented with any bidding process as long as the above registration rules are implemented.
[0033]
Bidding Process FIG. 5 shows one possible bidding process 500 that can be used. Other bidding processes can be implemented in a similar manner.
[0034]
Step 510 indicates the start of the update time interval _{T i.} In step 520, the next connection time interval table 400 is referred to. In step 530, each connection agent 218, while performing the above registration rules, during the update interval T _i according to the bidding process, attempts to register the connection to the next connection time interval table. Step 540 ends the registration at the end of the update interval.
[0035]
Step 550, at the end of the update interval T _i to determine whether or not the connection is registered in the interval table.
[0036]
If the registration is successful, at step 560, the connection agent remains at the router. Optionally, the connection agent can inform a subsequent connection agent for the same connection of the success of the connection establishment and the last applied unit price along its path. This notification may depend on the bidding process used by the connection agent. Thereafter, the process may proceed to the next time interval T _{i + 1} at step 570.
[0037]
If the connection is not registered in the interval table at the end of the update interval T _i , in other words, if the agent fails to establish a connection or maintain the established connection, the connection agent Chooses to stay at the router or try to move to another router. This can be specified by the user as part of the bidding process.
[0038]
If the agent chooses to stay, at step 560 the connection agent may optionally notify other connection agents for the same connection along the path of the failure or abortion of the connection. it can. Whether this notification is required may again depend on the bidding process used by the connection agent.
[0039]
If the agent chooses to move to another router, then in step 590, the connection agent, on the partial route, tells another connection agent for the same connection, " Send a "retry" message. Thereafter, in step 599, the agent begins the process for retry.
[0040]
【The invention's effect】
An advantage of the present invention is that it allows a user to bid on a minimum bit rate and a maximum connection time. Users who want to send and receive relatively long messages, such as streaming video, may be willing to wait until a relatively low price, high bit rate connection is obtained. In contrast, a user who needs to send a short emergency message may be willing to apply for a higher than normal price to gain that privilege. Another advantage of the present invention is that excess bandwidth reservation is minimized and the likelihood of exceeding network bandwidth is reduced. In other words, the invention allows the network to operate on market principles determined by published competition.
[0041]
Although the present invention has been described using examples of preferred embodiments, it should be understood that various other adaptations and modifications can be made within the spirit and scope of the invention. Therefore, it is the object of the appended claims to cover all such changes and modifications as fall within the true spirit and scope of the invention.
[Brief description of the drawings]
FIG. 1 is a block diagram of a network according to the present invention.
FIG. 2 is a block diagram of a router used in the network of FIG.
FIG. 3 is a block diagram of a connection management table held in the router of FIG. 2;
FIG. 4 is a block diagram of a connection time interval table of the router of FIG. 2;
FIG. 5 is a flow chart of a process used in the connection agent of the router of FIG. 2;

Claims (22)

A communication network including a plurality of user devices and a router connected to each other by a communication link,
A connection requesting device at the source user device, the connection requesting device generating a connection request message including a minimum bit rate, a unit price, and a bidding process;
A connection control device in a router, the connection control being configured to establish a connection between the source user device and the destination user device according to the lowest bit rate, the unit price, and the bidding process. A communication network comprising a device. The connection request message further includes a maximum connection time,
The communication network according to claim 1, wherein the connection control device establishes the connection according to the maximum connection time. The communication network according to claim 1, wherein the connection request device determines an initial route for the connection, and transmits the connection request message to a first router along the initial route. The router further comprises:
A plurality of input links, one of the plurality of input links being connected to the source user equipment;
A plurality of output links, one of the plurality of output links being connected to the destination user equipment;
2. A communication network according to claim 1, further comprising: a switching mechanism for connecting said plurality of input links to said plurality of output links. The connection control device further includes:
A connection management table, one connection time interval table for each output link, and a time interval parameter are stored as data. A connection management device and a plurality of connection agents are stored as software. Communication network according to claim 1, comprising a memory configured for one connection agent to exist. The connection management device registers and deletes a connection record in the connection management table, wherein each record includes a plurality of fields, wherein the plurality of fields include a unique connection identification for each router, and the source user. A source identification of the device, a source user identification, a destination identification of the destination user device, a destination user identification, an input link of the connection, an output link of the connection, a priority indication, and 6. The communication network according to claim 5, including a minimum bit rate and the unit price. The connection management apparatus, a communication network according to claim 5, wherein initializing the record of the connection time interval table at the beginning of each update interval T _i. The connection time interval table includes a plurality of fields,
The communication network according to claim 5, wherein the plurality of fields include the connection identification, the unit price, and the minimum bit rate. The minimum bit rate B per time interval T is required so that the router transmits at least n messages per time interval T, where n is the smallest integer that satisfies the formula n * (S / T) ≧ B 6. The communication network according to claim 5, wherein S is the bit length of each message. Each connection agent registers exactly one record for one connection in the connection time interval table during the time interval T, and the records in the connection time interval table are in descending order of the unit price. If there are two or more records that are arranged and have the same unit price, the first registered record is arranged before the second registered record, and the sum of all the records in the connection time interval table The minimum bit rate exceeds the total bit rate available on the associated output link after registration, or during a record change, the record with the lowest unit price is deleted from the connection time interval table. The communication network according to claim 9. The communication network according to claim 10, wherein the connection management device updates the connection management table at the end of the time interval T according to the connection time interval table. A method for establishing a connection of a communication network comprising a plurality of user devices and a router connected by a communication link,
At the connection requesting device of the originating user device, generating a connection request message including a minimum bit rate, a unit price, and a bidding process;
Establishing a connection between the source user device and the destination user device according to the minimum bit rate, the unit price, and the bidding process. How to establish. The connection request message further includes a maximum connection time,
The method according to claim 12, wherein the connection controller establishes the connection according to the maximum connection time. 13. The method of claim 12, wherein the connection requesting device determines an initial route for the connection and transmits the connection request message to a first router along the initial route. The router further comprises:
13. The method of establishing a connection in a communication network according to claim 12, comprising connecting a plurality of input links to a plurality of output links via a switching mechanism. The connection control device has a memory,
Storing, as data, a connection management table, a connection time interval table for each output link, and a time interval parameter;
13. Establishing a connection in a communication network according to claim 12, comprising storing, as software in said memory, a connection management device and a plurality of connection agents, one connection agent for each connection. how to. The connection management device registers and deletes a connection record in the connection management table, each record including a plurality of fields, wherein the plurality of fields include a unique connection identification for each router, and the source user. A source identification of the device, a source user identification, a destination identification of the destination user device, a destination user identification, an input link of the connection, an output link of the connection, a priority indication, and 17. The method for establishing a connection in a communication network according to claim 16, comprising a minimum bit rate and said unit price. The connection management apparatus, a method of establishing a connection of the communication network of claim 16 wherein initializing the record of the connection time interval table at the beginning of each update interval T _i. The connection time interval table includes a plurality of fields,
17. The method of claim 16, wherein the plurality of fields include the connection identification, the unit price, and the minimum bit rate. The minimum bit rate B per time interval T is required so that the router transmits at least n messages per time interval T, where n is the smallest integer that satisfies the formula n * (S / T) ≧ B 17. The method of claim 16, wherein S is the bit length of each message. Registering exactly one record for one connection in said connection time interval table during said time interval T;
Arranging the records in the connection time interval table in descending order of the unit price, wherein when two or more records having the same unit price exist, the previously registered record is registered later. If the minimum bit rate of the sum of all the records in the connection time interval table exceeds the total bit rate available on the associated output link after registration, or During the change, the record having the lowest unit price is deleted from the connection time interval table. 22. The method according to claim 21, wherein the connection management device updates the connection management table at the end of the time interval T according to the connection time interval table.

Images