JP3582979B2 - Communication device, communication method, and recording medium - Google Patents

Description

但し、ｅｆｋｉ：ある期間ｋのフローｉの評価値
ｅｉ：フローｉのデータのインデックス表における評価値
Ｇ：各パケットの評価値を統計処理する関数

但し、ｒｉ：フローｉへのリクエスト数
Ｈ：評価値にリクエスト数を加味する関数
また、データの評価値が映像、音声、文字列等に種類別に設定されている場合、特にメディア別に帯域幅を操作できる場合は、各メディア毎に式２〜式５のいずれかの処理を行うのもよい。
【０１５３】
３．優先度決定（ステップ２６０３）
各期間での各データフローの評価値を用いて、データフロー間での優先度を決定する。優先度決定関数は、評価値の種類をどのように設定するかや、評価値の取り方により異なる。一つの簡単な例は、式２〜式５等の様に各データフローの評価値を求める場合のように、評価値が数字で表されていて、かつ、数字の大きい方が評価が高い場合、式６に示すように全てのデータフローの評価値の合計に占める各データフローの評価値の占める割合を各データフローの優先度とする方法がある。
【０１５４】
この他に、例えば、データフローの評価値をそのまま優先度として見なすことも可能である。
【０１５５】

但し、ｅｆｋｉ：ある期間ｋのフローｉの評価値
Ｐｋｉ：ある期間ｋのフローｉの優先度
また、データの評価値が映像、音声、文字列等に種類別に設定されている場合、特にメディア別に帯域幅を操作できる場合は、各メディア毎に式６の処理を行うのもよい。
【０１５６】
４．通信帯域決定（ステップ２６０４）
各データフローに割り当てられる通信帯域幅は、固定帯域と変動帯域の合計となる。
【０１５７】
固定帯域は既にルータ・サーバ帯域確保時にスケジューリング機構によって確保されているので、ここでは、各データフローへ変動帯域を割り当てる。その割り当て方法の例としては、各データフローに対して決定された優先度を用いて各データフローに通信帯域を割り当てる方法がある。割り当てる方法は、優先度の取り方により異なるが、一つの簡単な例は、式６の処理で求められる様に全てのデータフローの評価値の合計に占める各データフローの評価値の占める割合を各データフローの優先度とする場合、式７の様に通信路の中での変動領域全体の帯域幅と優先度の積から各データフローの帯域幅を求める方法である。
【０１５８】
ｂｋｉ＝ｐｋｉ×ｂｋＴ
但し、ｂｋｉ：ある期間ｋのフローｉの優先度
ｂｋＴ：ある期間ｋのデータ通信用総変動帯域幅
ｐｋｉ：ある期間ｋのフローｉのデータ通信用変動帯域幅
５．パケット送信（ステップ２６０５）
各データフローに割り当てられた通信帯域幅に見合うようにパケットを適宜廃棄しながらパケットを送信する。廃棄のレベルとしては２つあり、１つはデータフロー間の優先度に応じてその優先度の低いフローからパケットを破棄する。重要度は、インデックスの評価値を用いて判断できる。もう１つは、優先度の低さに応じて各データフローからパケットを破棄して情報量を減らすことである。本実施形態では後者のレベルを例に説明する。この方法の例としては、例えば次のような方法がある。
【０１５９】
次に本発明を適用した例を示す。
【０１６０】
最初は、「緊急報道」を利用した場合の、通信制御について示す。インデックスとして緊急報道を用いる事により、通常のスケジューリングルールに従わずに、特権的に情報を提供することが可能となる。例えば、従来、地震等の災害発生時には、災害発生箇所に対する通信要求が多発し通信回線がパンクするため、１１０番や１１９番による救急通信が利用できないといった問題がある。このような問題に対し、インデックスを「緊急通信」とする事によって、他の如何なる情報よりも優先的に処理を行うことを可能とする。これは、単に優先度を最高位にするだけでは、先に述べたスケジューリング規則に基づくと、他のサービスに必要な固定帯域で全帯域が占有されている場合は、緊急通信用の帯域を即確保することが出来ない。よって、他のサービスの最低限度の品質を欠いても（固定帯域を削ることになる）、緊急通信用の通信帯域を確保する特別なスケジューリング機構が必要となる。これは、固定帯域をスケジューリングする際に、インデックスが「緊急通信」か否かを判定することによって容易に拡張することが可能である。 この技術は、現在のテレビにおけるテロップによって、地震情報や選挙速報が放送されていることに対応づけることができる。例えば、ＶＯＤ機構を用いているネットワークにおいて、帯域いっぱいに情報を提供している時でも、必要に応じて緊急情報を放送することが可能となる。
【０１６１】
但し、この緊急情報に関しても、後に示す情報フィルタリングの機構を用いることにより、個人の責任において不要な情報をマスクすることが可能である。例えば、選挙速報はいらない、災害情報は関東圏に限定する、といったことが可能である。
【０１６２】
しかし、この技術によっても、緊急通信が多発し、全ての緊急通信をリアルタイムで処理出来ない（通信帯域が足りなくなる）場合が想定される。これは、現在の電話網でよく問題になることであり、緊急通信といえどもその内の間欠的につながる情報のみ扱われ、回線が確保されなかった要求は無視されていた。このような問題への対応策として、従来無視されていた要求も含めて全ての要求をカウントし、マクロ的に要求発生の分布を把握することによって、救急車を出動させる等の災害対策に利用することを可能とする。
【０１６３】
これは、固定帯域をスケジューリングする際に、緊急通信をリアルタイムに処理できなくなったとき、そのスケジュールだけを行い遅延時間の評価によって、発生頻度や要求の発生分布を見積もることが可能となる。
【０１６４】
次の適用例として、インデックスに個人や端末情報を付加して送る例を示す。
これにより、無駄、作業効率、プライバシー／機密保持、契約内容等の観点から、利用する端末や個人に基づいたサービスの自動調整が可能になる。
【０１６５】
例えば、無駄の視点からは、
・端末の仕様を上回る精度のデータを転送しても無駄である。プリンタでは３００ｄｐｉ程度の速度のデータがほしいが、画面でしか見ない画像データであれば７２ｄｐｉ程度ですむ。これを自動的に区別できれば通信量は１／３以下となる。また、白黒端末にカラー情報を送信したり、８ｂｉｔのＣＲＴ精度しかないところに２５６ｂｉｔのカラー情報を送信しても無駄である。
【０１６６】
・何らかのハンディキャップがある人に感知できないメディアデータを転送しても無駄である。耳の聞こえない人には、画像データと文字データを、目の見えない人には音声データと点字データを送るような機能を自動化できる。
【０１６７】
このような無駄なデータ転送をなくすため、端末からのサービス要求時に、端末や個人に関する情報を付加してサーバに通知する。サーバ側では、予め端末や個人に応じたデータ精度にデータを加工した後、通信路に加工済みデータを送出することが可能となる。これにより、従来端末側で利用できずに捨てていた無駄な情報の転送がなくなり、通信資源をより有効に利用可能となる。
【０１６８】
また、作業効率の視点からは、営業担当が詳細な技術情報の中から営業に役立つデータを探すのは困難であり、多面的なデータベース（データウェアハウス）の構築と、その効率化が望まれている。インデックスがデータベース検索を効率化する。
【０１６９】
プライバシー／機密保持の視点からは、部分的に公開される個人向けのインデックス（マシンのＩＰアドレスに類似） を配布することで、暗号通信に加え個人認証の観点から、個人情報の不当な漏洩や、企業、公的機関等の秘密漏洩の事柄を防ぐ部になる。
【０１７０】
さらに、契約内容として、幾つかのレベルの契約内容が考えられ、契約内容インデックスによりサービス内容を自動的に変えることが可能となる。
【０１７１】
３番目の適用例として、情報フィルタリングに適用できる。個人、地域、国家など色々な粒度の主体にとって、不必要な、あるいは、不利益な情報を如何にシャットアウトするかは、インターネットのような巨大なネットワーク環境が広がるにつれて、切実な問題となってきている。また、インターネット上での自由な情報の流れの中で、個人のプライバシー、公序良俗、あるいは、国益の保護のための法制化が遅れているという問題もある。
【０１７２】
インデックスに基づく通信は、こうした問題への一つの解決策ともなる。例えば、国家、プロバイダ、法人、個人等は、インターネット上に公開されているデータの種類うち、取り扱う範囲、あるいは、取り扱わない範囲をインデックスを用いて公開することで、取り扱わない種類のデータを一方的に拒否することができる。これにより、風紀上好ましくない情報や、興味のない情報を自動的に排除する事が可能となり、必要な情報の選択を同時に実現することが可能となる。
【０１７３】
図２７に示す統合公共情報通信網と、図２８に示す大規模統合公共情報通信網は、以上で説明したインデックスを用いる通信網を、ユーザの要求により、ニュース、映画、音楽等の番組を配信するサービスやコンピュータネットワークサービス、電話サービス等の公共的なインフラストラクチャに適用する場合の例を表している。
【０１７４】
各構成要素は、少なくとも上述のインデックスを用いる通信部の各構成要素の部を備える。
【０１７５】
各構成要素の対応関係は、キー局１３０１はサーバ１００、中継局１３０２と中継局（小）１４０３はルータ２００に、家庭１３０４は端末３００に、情報作成局１３０５はインデックスデータ作成部４００に対応する。
【０１７６】
【発明の効果】
本発明により、不特定多数からの通信要求を、その転送情報の内容に応じて資源配分することが可能となり、かつ情報内容に応じて動的に資源配分を変更することが可能となる。即ち、通信に要求される帯域を固定領域と変動領域に分け、別々にスケジューリングすることにより、次のような効果が得られる。
【０１７７】
・最低限必要な情報のみを固定帯域で送信することにより、必要以上に高い品質の情報（画像など）の送信が抑制され、トラフィックの軽減が図ることが可能となる。
【０１７８】
・固定帯域のスケジューリングを行なうことにより、通信路混雑時でも要求が拒絶されずに処理されるようになり、従来ではわからなかったサービスの開始・終了時刻をユーザに提示することが可能となる。
【０１７９】
・入札期間を用いることにより、優先度に応じたスケジューリングが可能となり、サービスに軽重をつけることが可能となる。
【０１８０】
・従来では帯域が一杯でこれ以上送信できないというような場合でも、変動帯域を通信要求間で相互に融通しあうことにより、送信できる可能性が上がる。
【０１８１】
・通信路の負荷状況に応じて、動的に付加情報を追加することを可能とし、絶えず要求品質以上で可能な限り高い品質の情報を提供することが可能となる。これは例えば、１つの通信フロー中でも、クライマックスなど、ある部分だけは品質の高い映像、音声を提供することが可能となり、きめの細かいユーザの要求に対応することが可能となることを意味している。
【０１８２】
本発明によれば、不特定多数からの通信要求を、その転送情報の内容に応じて資源配分することが可能となり、また情報内容に応じて動的に資源配分を変更することを可能となる。さらに、災害等に迅速に対応できるネットワークを構築でき、また公序良俗に反するようなデータの侵入等を防止でき、さらにユーザの妥協を促してユーザが納得した形で通信資源を確保することができる。
【図面の簡単な説明】
【図１】本発明の一実施形態に係るネットワークの一例を示す図である。
【図２】図１に示した各サーバ、ルータ、端末の構成を示す図である。
【図３】インデックスを用いる通信網における通信帯域の分割方針と、それに応じた各通信への通信帯域の割り当て方法の一例を表す図である。
【図４】ネットワーク内に公開されるデータの種類を網羅するインデックステーブルの例を示す図である。
【図５】シーンインデックスの例を示す図である。
【図６】インデックスを用いる通信で各サーバ、ルータ、端末などが受け取るデータパケットの構成例を表す図である。
【図７】本発明の一実施形態に係るネットワークのサーバ、ルータの構成要素である固定帯域予約部の構成例を表す図である。
【図８】インデックス付きパケットを用いて行う通信におけるデータ転送手順を表すフローチャートである。
【図９】サーバから端末に送られるデータ転送規定情報の一例を示す図である。
【図１０】端末からサーバに送られるユーザ要求を加味したデータ転送規定情報の一例を示す図である。
【図１１】受信情報に対する通信資源割り当てを行う方法のうち、入札期間の長さを一定とし、入札期間内に仮予約のためのスケジューリングを行う方法である入札方法１の一例を示す図である。
【図１２】受信情報に対する通信資源割り当てを行う方法のうち、入札期間の長さを一定とし、入札期間終了後に本予約のためのスケジューリングを行う方法である入札方法２の一例を示す図である。
【図１３】受信情報に対する通信資源割り当てを行う方法のうち、各データごとに優先度に応じて入札期間の長さが異なり、それぞれの入札期間において仮予約のためのスケジューリングを行う方法である入札方法３の一例を示す図である。
【図１４】固定帯域が経時的に確保されるスケジュール表の作成手順の一例を示す図である。
【図１５】入札方法４における固定帯域の一構成例を示す図である。
【図１６】変動帯域のスケジューリングの一例を示す図である。
【図１７】入札方法４における固定帯域のスケジュール結果の一例を示す図である。
【図１８】インデックス付きパケットを用いて行う通信における他のデータ転送手順を表すフローチャートである。
【図１９】サーバから端末に送られる代替案としてのデータ転送規定情報の一例を示す図である。
【図２０】サーバから端末に送られる代替案としてのデータ転送規定情報の他の例を示す図である。
【図２１】変動帯域幅割り当て部における基本的な処理の手順を示すフローチャートである。
【図２２】変動帯域のスケジューリングの一例を示す図である。
【図２３】変動帯域のスケジューリングの一例を示す図である。
【図２４】データの再送信の概念を示す図である。
【図２５】パケット迂回やパケットキャッシュの場合のクライアント（端末）側の装置の一構成例を示す図である。
【図２６】変動帯域幅割り当て部における他の手順を示すフローチャートである。
【図２７】統合公共情報通信網の一例を示す図である。
【図２８】大規模統合公共情報通信網の一例を示す図である。
【符号の説明】
１００ サーバマシン
１０５ 変動帯域優先度決定部
２００ ルータ
２１０ 固定帯域予約部
３００ 端末
４００ インデックス付データ作成部[0001]
TECHNICAL FIELD OF THE INVENTION
The present invention relates to a communication device, a communication method, and a recording medium that secure communication resources according to required quality.
[0002]
[Prior art]
Distributed systems are rapidly spreading due to the spread of the Internet / Intranet. However, it is very difficult to grasp the whole picture of programs and systems due to the complexity of the system, the increase in scale, and the introduction of componentware. I have. For this reason, modeling for performing numerical analysis such as simulation in advance is difficult, and performance grasp / evaluation at the time of system design / development cannot be sufficiently performed. Among the causes that make the performance evaluation difficult, the biggest cause is that a plurality of jobs share the resources of one system. Such sharing by a plurality of entities occurs for network resources and computing resources, and it is difficult to predict performance due to different optimization standards in their respective management policies. When evaluating the performance, the user can obtain not only the average performance but also the worst value. However, in a complex system shared by a plurality of subjects, such worst values are often obtained and exceed engineering experience values. For this reason, theoretical analysis does not make sense, and even in actual experiments, data that causes the worst situation cannot be created, so that the worst state simulation that occurs during operation cannot be simulated. Making it more difficult. This is because, for example, in the field of communication between many computers typified by the conventional Internet, the Best Effort system in which a plurality of entities share the communication resources equally has been conventionally adopted. However, it has always been affected by communication by other communication entities, and it has been difficult to guarantee a necessary band. Therefore, the communication speed is measured on the data receiving side, and the information is fed back to the data transmission source to control the data transmission amount on the transmission side. For example, when the communication speed is low, the information is deleted. There is a method of realizing data transfer at a constant speed by transmitting. However, this method requires a separate line for transferring the feedback information. Furthermore, there is a problem that information is uniformly deleted regardless of the content of data to be transferred.
[0003]
Further, studies are being made on protocols such as an ATM (Asynchronous Transfer Mode) communication system and an RSVP (Resource Reservation Protocol) as a communication system of a band securing type instead of the Best Effort system. However, in these methods, in accordance with the diversification of data handled on the network, even though the proper handling is different depending on the characteristics of the data, the request was made earlier according to the principle of first-come-first-served basis. It merely secures the communication resources (bands) required in order. Therefore, if the requested bandwidth cannot be secured, the request is simply rejected, and the user is constantly forced to wait for a communication resource to be available and then make a request again.
[0004]
As described above, in the related art, it is difficult to guarantee a necessary band in a communication field between computers, and a data receiving side measures a communication speed and feeds back the information to a data transmission source. In the method of controlling the amount of data transmission on the transmitting side, for example, when the communication speed is low, the information is cut off and transmitted, so that a data transmission at a constant speed is required. However, there is a problem that information is uniformly deleted regardless of the information. Furthermore, if the required bandwidth cannot be ensured by the ATM system or the RSVP system, the request is simply rejected, and the user is forced to constantly wait for a communication resource to be available and make a request again.
[0005]
[Problems to be solved by the invention]
When such limited communication resources are shared by an unspecified number of subjects, communication resources are not secured only in response to requests from individual users, but rather are objective priorities common to the entire network. It is an issue to provide such an index and use the index to distribute resources equally to an unspecified number of users.
[0006]
For example, if the data to be transmitted / received is video and the purpose is news coverage, real-time retention is the most important, and if the image quality is relatively insignificant, if the traffic of routers and servers increases or decreases, The problem is to omit this data within an acceptable range. This makes it possible to satisfy other communication requests and provide services to a large number of users.
[0007]
Conversely, if the data to be transmitted and received is movie information and the purpose is to appreciate it, if the image quality is more important than the real-time property, the time at which good image quality can be provided is presented, and then the time I don't think it's a problem to wait. For this purpose, it is an issue to reserve resources for a communication channel on a time axis.
[0008]
Furthermore, in the case of watching a movie, even in the same data flow, such as a climax scene and other scenes, even if the image quality is somewhat degraded with a part requiring high quality that determines the value of the data. There may be a mixture of parts that do not affect many people. In the case of such information, it is a great loss to delete the information uniformly, and it is desired that the information processing method can be dynamically changed according to the situation.
[0009]
The present invention has been made in view of such a problem.
[0010]
An object of the present invention is to provide a communication device, a communication method, and a recording medium that can efficiently allocate communication resources.
[0011]
It is another object of the present invention to provide a communication device, a communication method, and a recording medium that can suppress transmission of information of unnecessarily high quality and reduce traffic.
[0012]
Still another object of the present invention is to provide a communication device, a communication method, and a recording medium in which a request is processed without being rejected even when a communication channel is congested.
[0013]
Another object of the present invention is to provide a communication device, a communication method, and a recording medium that can present a start / end time of a service to a user.
[0014]
Still another object of the present invention is to provide a communication device, a communication method, and a recording medium that can perform scheduling according to priority and can give light weight to services.
[0015]
It is another object of the present invention to provide a communication device, a communication method, and a recording medium which increase the possibility of transmitting and receiving communication resources between communication requests.
[0016]
Still another object of the present invention is to provide a communication device, a communication method, and a recording medium that can provide information of the highest quality as much as required or higher according to the load status of a communication channel. .
[0017]
[Means for Solving the Problems]
In order to solve such a problem, the present invention described in claim 1 is:Means for managing the resource allocation status of the communication path, means for transferring the communication information to the communication path, means for determining the contents of the communication information to be transferred, and means for transferring the communication information according to the determined contents. Means for allocating a bandwidth of a communication path comprising a fixed bandwidth in which a fixed bandwidth is fixedly secured and a variable bandwidth in which the bandwidth fluctuates according to a predetermined situation. And securing a fixed bandwidth and / or a variable bandwidth according to the resource allocation status, and controlling the bandwidth of the variable bandwidth according to the content of the communication information and the resource allocation status.
[0018]
According to a second aspect of the present invention, in the communication device according to the first aspect,transferTo the communication information to be added, an index indicating the content of the communication information is added,DiscriminationThe meansindexThe content of the communication information to be transferred is determined based on the
[0021]
Claim3SUMMARY OF THE INVENTION1The communication device according toFluctuationThe bandwidth of the band is periodically controlled.
[0022]
Claim4SUMMARY OF THE INVENTION1The communication device according toFluctuationUsing the bandcommunicationMeans for transferring information as packets;FluctuationMeans for discarding packets in response to a decrease in bandwidth,DiscardMeans for temporarily storing the transmitted packet,FluctuationAs bandwidth increasestemporaryMeans for transferring the packet stored in the storage device.
[0023]
Claim5SUMMARY OF THE INVENTION1The communication device according toFluctuationUsing the bandcommunicationIf there is a means to hold the packet that could not transfer the information as a packet to the original transmission path, and if there is a detour path different from the original transmission path,DetourAfter grasping the bandwidth status of the route, use an available detour routeRetentionMeans for transferring the received packet.
[0024]
Claim6The invention describedMeans for allocating communication path resources to a transfer request for communication information to which priority is added regarding the allocation of communication path resources; means for temporarily reserving communication path resources in response to the transfer request; Means for scheduling the temporary reservation in the middle, and means for changing the temporary reservation to a full reservation of the resources of the communication path in accordance with the scheduling. The scheduling is performed by evaluating the priority of the request.
[0027]
Claim7The invention describedMeans for allocating communication path resources to a transfer request for communication information to which priority is added regarding the allocation of communication path resources; means for temporarily reserving communication path resources in response to the transfer request; Means for scheduling for the temporary reservation in, and means for changing the temporary reservation to a full reservation of the resources of the communication path according to the scheduling,Scheduling means,bidAfter the period ends, each transfer request during the bidding periodpriorityIs evaluated and scheduling is performed.
[0028]
Claim8The invention describedMeans for allocating communication path resources to a transfer request for communication information to which priority is added regarding the allocation of communication path resources; means for temporarily reserving communication path resources in response to the transfer request; Means for scheduling for the temporary reservation in, and means for changing the temporary reservation to a full reservation of the resources of the communication path according to the scheduling,Scheduling means,transferThe length of the bidding period is determined according to the priority of the request, and each transfer request within the bidding period is scheduled.
[0029]
Claim9The invention describedMeans for allocating communication path resources to a transfer request for communication information to which priority is added regarding the allocation of communication path resources; means for temporarily reserving communication path resources in response to the transfer request; Means for scheduling the temporary reservation in the medium, means for changing the temporary reservation to a full reservation of the resources of the communication path according to the scheduling,Means for dividing the band of the communication path to be allocated into a first band which has to be secured to a minimum which becomes meaningless if information is deleted any more, and a second band which can be cut off during congestion.AndEquipped,SchedulingThe meansbidAfter the period ends, each transfer request during the bidding periodSecondThe scheduling is performed in consideration of the band deletion and the priority of each transfer request.
[0030]
Claim10The invention described(A) a step of managing the resource allocation status of the communication path; (b) a step of determining the content of the communication information to be transferred; and (c) a constant for transferring the communication information according to the determined content. Allocating a bandwidth of a communication path including a fixed bandwidth in which the bandwidth of the communication path is fixedly secured and a variable bandwidth in which the bandwidth fluctuates according to a predetermined situation. And a step of securing a fixed band and / or a variable band of the bandwidth according to the resource allocation status, and a step of controlling the bandwidth of the variable band according to the content of the communication information and the resource allocation status. To be
[0031]
Claim11SUMMARY OF THE INVENTION10In the communication method described,transferFurther comprising the step of adding an index indicating the content of the communication information to the communication information to be performed,(B)In stepsindexThe content of the communication information to be transferred is determined based on the
[0034]
Claim12SUMMARY OF THE INVENTION10In the communication method described,FluctuationControlling the bandwidth of the band,FluctuationIt is characterized in that the bandwidth of the band is controlled periodically.
[0035]
ClaimThirteenSUMMARY OF THE INVENTION10In the communication method described,FluctuationUsing the bandcommunicationTransfer information as packets,FluctuationAs well as discarding packets as bandwidth decreases,DiscardTemporarily store the saved packet,FluctuationThe method may further include transmitting the temporarily stored packet according to an increase in bandwidth.
[0036]
Claim14SUMMARY OF THE INVENTION10In the communication method described,FluctuationUsing the bandcommunicationIf a packet that cannot transfer information to the original transmission path as a packet is retained, and there is a detour path different from the original transmission path,DetourAfter grasping the bandwidth status of the route, use an available detour routeRetentionThe method further comprises the step of forwarding the packet.
[0037]
ClaimFifteenThe invention described(A) temporarily reserving communication channel resources in response to a transfer request for communication information to which a priority relating to allocation of communication channel resources is added; and (b) scheduling for provisional reservation during a predetermined bidding period. And (c) changing the tentative reservation to a full reservation of the resources of the communication path in accordance with the scheduling, and (b) the step of giving priority to each transfer request during the bidding period every time there is a transfer request. It is characterized by evaluating the degree and scheduling.
[0040]
Claim16The invention described(A) temporarily reserving communication channel resources in response to a transfer request for communication information to which a priority relating to allocation of communication channel resources is added; and (b) scheduling for provisional reservation during a predetermined bidding period. (C) changing the tentative reservation to a full reservation of the resources of the communication path according to the scheduling,(B) In the step,bidAfter the period ends, each transfer request during the bidding periodpriorityIs evaluated and scheduling is performed.
[0041]
Claim17The invention described(A) temporarily reserving communication channel resources in response to a transfer request for communication information to which a priority relating to allocation of communication channel resources is added; and (b) scheduling for provisional reservation during a predetermined bidding period. (C) changing the tentative reservation to a full reservation of the resources of the communication path according to the scheduling,(B) In the step,transferThe length of the bidding period is determined according to the priority of the request, and each transfer request within the bidding period is scheduled.
[0042]
Claim18The invention described(A) temporarily reserving communication channel resources in response to a transfer request for communication information to which a priority relating to allocation of communication channel resources is added; and (b) scheduling for provisional reservation during a predetermined bidding period. (C) converting the tentative reservation into a full reservation of the resources of the communication path in accordance with the scheduling;A step of dividing the bandwidth of the communication path to be allocated into a first bandwidth which must be secured to a minimum which becomes meaningless if information is deleted any more, and a second bandwidth which can be reduced in congestion.AndEquipped,(B)In stepsbidAfter the period ends, each transfer request during the bidding periodSecondThe scheduling is performed in consideration of the band deletion and the priority of each transfer request.
[0043]
Claim19The invention describedMeans for managing the resource allocation status of the communication path, means for transferring the communication information to the communication path, means for determining the contents of the communication information to be transferred, and means for transferring the communication information according to the determined contents. A computer functioning as a means for allocating a bandwidth of a communication path including a fixed bandwidth in which a fixed bandwidth is fixedly secured and a variable bandwidth in which the bandwidth fluctuates in accordance with a predetermined situation; The computer is caused to secure a fixed bandwidth and / or a variable bandwidth according to the content and the resource allocation status, and to control the bandwidth of the variable bandwidth according to the content of the communication information and the resource allocation status.
[0044]
Claim20The invention describedMeans for allocating communication path resources to a transfer request for communication information to which priority is added regarding the allocation of communication path resources; means for temporarily reserving communication path resources in response to the transfer request; The computer functions as a means for scheduling the temporary reservation in the middle and a means for changing the temporary reservation to a full reservation of the communication channel resources according to the scheduling. The computer is caused to evaluate and schedule the priority of each transfer request.
[0045]
In the present invention, a communication band corresponding to the index is assigned using, for example, an index indicating the message content added to the message. At this time, in the present invention, for example, a communication band secured for transmitting information is managed by being divided into a fixed band and a variable band. The fixed band is a communication band that guarantees that the fixed band will not be deleted, and the fixed bandwidth is determined at the time of starting communication. In addition, the variable bandwidth is exchanged between the communication flows due to the fluctuation of the load of the router or the server. The index is used for securing a fixed band at the time of starting communication and for changing the band of the variable band in order to objectively determine the priority according to the characteristics of communication contents and media. In the case of securing a fixed band or a variable band, considering the case where it is not possible to secure the band immediately, the objective priority can be determined using the index even when the function of the communication reservation by the scheduling is realized.
[0046]
According to the present invention, messages exchanged between computers via a network can be reserved for communication resources. This makes it possible to clarify the start and end times of the service without rejecting the request even when the communication path is busy.
[0047]
BEST MODE FOR CARRYING OUT THE INVENTION
Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings.
[0048]
FIG. 1 shows an example of a network according to an embodiment of the present invention. This network includes various server machines 100, a router 200, and a terminal 300. In general, in the so-called Internet or in-house network (intranet), communication is performed via a dedicated digital line in addition to a LAN, and is composed of various layers such as an ATM switch. Therefore, it will be described with a router as a representative. In the server machine 100, DB is a server machine for a database, MDB is a server machine for a multimedia database, KB is a server machine for a knowledge base, and LIB is a server machine for a library.
[0049]
FIG. 2 is a block diagram showing a configuration of a communication network using an index according to an embodiment of the present invention in the network environment as shown in FIG. The “index” is used for determining the priority at the time of data selection, negotiation, transfer, connection, and the like.
[0050]
A communication network using an index includes at least a server 100 that transmits an indexed packet in response to a user request, a router 200 that relays and distributes the packet, and a terminal 300 that receives and restores the packet. Further, the indexed data creating unit 400 that supplies the indexed data to the server may be configured to exist on the network.
[0051]
The server 100 includes at least a user request window 101, an indexed data storage unit 102, an index storage unit 103, a packet index addition unit 104 for adding an index to a packet, a variable band priority determination unit 105, a variable band allocation unit 106, a packet It comprises a discarding / restoring unit 107, a packet transmitting unit 108, a fixed band priority determining unit 109 for reserving or reserving a band in advance and then transmitting, a fixed band reserving unit 110, and a reservation information storage unit 111. A data browsing unit 112 for the user to browse and select data handled by the server, an emergency news interruption unit 113 for allowing interruption of emergency news such as a disaster, etc. may be added to the configuration. The packet discarding / restoring unit 107 restores a packet once discarded when there is enough bandwidth, and a packet discarding unit 114 is connected.
[0052]
In the server 100, the packet index adding unit 104 divides the transmitted data into packets, and adds an index to each packet using the index in the index storage unit 103. The variable band priority determining unit 105 searches the index storage unit for an evaluation value corresponding to the index, and determines the priority of each data flow. The variable bandwidth allocating unit 106 allocates a bandwidth to each data flow based on the priority of each data flow. The packet discarding / restoring unit 107 selects only a packet corresponding to the allocated bandwidth, passes it to the packet transmitting unit 108, and discards or cancels the other packets. The emergency report interrupting unit 113 detects a packet having an index of the emergency report and notifies the data flow or packet to be transmitted with the highest priority to the variable bandwidth priority determining unit 105, the packet discarding / restoring unit 107, and the like.
[0053]
The router 200 includes at least a user request window 201, a packet receiving unit 202, an index storing unit 203, an index expanding unit 204, a variable band priority determining unit 205, a variable band allocating unit 206, a packet discarding / restoring unit 207, and a packet transmitting unit. 208, a fixed band priority determining unit 209 for securing a band in advance and then performing transmission, a fixed band reservation unit 210, and a reservation information storage unit 211. A packet cache unit 212 for temporarily storing received packets and sharing packets between data flows, a data filtering unit 213 for determining unnecessary data in a network below a terminal (such as a terminal), and grounds for the determination. A data mask rule storage unit 214 for storing rules to be stored, a packet index update unit 215 for updating a part of the index by a router, an emergency news interrupt unit 216 for allowing an emergency news interrupt in a disaster or the like are added to the configuration. Is also good. The packet discarding / restoring unit 207 restores a packet once discarded when there is enough bandwidth, and a discarded packet cache unit 217 is connected.
[0054]
In the router 200, the index expansion unit 204 searches the index storage unit 203 for an evaluation value using the index of the received packet, and calculates the evaluation value of each data flow. The variable band priority determining unit 205 determines the priority of each data flow using the evaluation value. The variable bandwidth allocation unit 206 allocates a bandwidth to each data flow based on the priority of each data flow. The packet discarding / restoring unit 207 selects only packets that match the allocated bandwidth, passes them to the packet transmitting unit, and discards or cancels other packets. The emergency news interrupting unit 216 detects a packet having an index of the emergency news and notifies the data flow or packet to be transmitted with the highest priority to the variable bandwidth priority determining unit 205, the packet discarding / restoring unit 207, and the like.
[0055]
The terminal 300 includes a network using unit 301 for at least connecting the terminal to a network and searching for desired data, a user request issuing unit 302 for requesting transmission of desired data, and a packet receiving unit for receiving an indexed packet. 303, and a data restoring unit 304 for restoring data from the received packet to a form desired by the user. If it is necessary to temporarily store the received packet as a packet or in a state where it has been decoded into data, the data cache unit 305 is used. A unit, a data mask rule storage unit, and an index storage unit may be added to the configuration. Also, when the terminal wants to perform processing referring to the index and its evaluation value, an index storage unit may be added to the configuration.
[0056]
The indexed data creation unit 400 includes at least an indexless data storage unit 401 that stores data to which no index is added, an index storage unit 402, a content index addition unit 403 that adds data contents to the entire data, An indexed data storage unit 404 for storing the added data and a data supply unit 405 for supplying the indexed data to a server or the like. When it is necessary to add a scene index indicating the importance of each scene in the data, a scene cutout unit 406 that cuts out a scene from data to which no scene index is added, a scene that adds a scene index to the cutout scene The index adding unit 407 may be included in the configuration.
[0057]
In this communication network, a method of making a reservation or securing when performing communication by reserving or securing a communication band in advance is as follows.
[0058]
The user obtains the server 100 having desired data by the network using unit 301 of the terminal 300.
[0059]
The user request issuing unit 302 of the terminal 300 connects to the corresponding server 100 through the user request window 201 of the router 200 and the user request window 101 of the server 100, and confirms data contents (outline description, size, fee, etc.). Then, the terminal 300 issues a user request (transfer start time, transfer rate, transfer end time, etc.) to the router 200 and the server 100.
[0060]
In the server 100 or the router 200 that has received the user request, the fixed bandwidth priority determination units 109 and 209 search the index storage units 103 and 203 for data evaluation values and determine the priority when securing a fixed bandwidth. decide.
[0061]
The fixed band reservation units 110 and 210 search the reservation status of the communication band from the reservation information storage units 111 and 211 and check whether it is possible to secure the communication band for a time according to the user's request. As a result, if it can be secured, the user is notified to that effect through the user request window. If it cannot be secured, an alternative is created and the fact is presented to the user through the user request window.
[0062]
If the request cannot be secured as requested by the user, negotiation is performed with the server 100 and the router 200 through the user request window.
[0063]
If the user is able to secure, or if a satisfactory negotiation is possible by negotiation, the user confirms it and requests the server 100 and the router 200 to secure and transmit the communication band through the user request window.
[0064]
FIG. 3 shows an example of a communication band dividing policy in a communication network using an index and a method of allocating a communication band to each communication according to the policy.
[0065]
Here, the fixed band is a communication band that is guaranteed not to be deleted by a certain communication. The specific value is called a fixed bandwidth. The fixed bandwidth is determined at the time of scheduling the fixed bandwidth before starting communication. The variable band is a communication band in which a band other than a band secured as a fixed band in a communication band of a router or a server is allocated to each simultaneously performed communication by priority. Further, the minimum transfer bandwidth is a minimum bandwidth in which certain data maintains real-time properties and information of the data is sufficiently transmitted.
[0066]
The band division policy is divided into several depending on the characteristics of the data. Here, the following four are given as examples. The following description of the present embodiment covers four examples.
"Real-time priority data (thinning possible)" is used.
[0067]
・ Real-time priority data (thinning is possible)
It is data that requires real-time properties, but refers to data that can be recovered to the extent that the user can compromise on the receiving side even if packets are decimated within a certain range. The extent to which restoration is required depends on the user, although there is a technical minimum.
[0068]
This includes general video data and audio data (including telephones). The form of securing the bandwidth includes a fixed bandwidth and a variable bandwidth, and the ratio of the fixed bandwidth and the thinning rate of the variable bandwidth can be changed according to the content, the scene, and the importance of the transfer data. The communication bandwidth (transfer speed) is determined by the sum of the fixed bandwidth and the variable bandwidth determined by balancing other data flows.
[0069]
-Real-time priority data (no thinning)
This refers to data that requires real-time properties and that cannot be thinned out.
[0070]
This includes moving images that require high accuracy, and communications in real-time control systems.
[0071]
The communication band is composed of a fixed band sufficient to maintain the real-time property, and the communication bandwidth (transfer speed) is determined by the content of data.
[0072]
-Integrity priority data (bandwidth reservation)
This refers to data that places importance on data integrity, is transferred according to a certain schedule, and needs to guarantee the time until transfer is completed. This corresponds to a case where data such as various aggregation results for each period (day, month, year, year, etc.) of each branch of a company is transferred to the head office. The communication band is composed of a fixed band sufficient to be transmitted according to a schedule, and the width (transfer speed) of the communication band is determined by the amount of data and the time required for transfer.
[0073]
-Integrity priority data (bandwidth fluctuation)
Data that emphasizes data integrity, but the time to complete the transfer is not very important. This is e-mail exchanged between individuals. The communication band is composed only of the variable band, and the communication bandwidth (transfer speed) is determined in consideration of other data flows. In TCP / IP or the like based on the current Best Effort method, the bandwidth of all data flows fluctuates without priority.
[0074]
FIG. 4 shows an example of an index table covering the types of data published in the network. In this case, when a special priority method is set for handling data similar to an emergency report, it is necessary to limit the method to a specific individual such as a network administrator or a public organization.
[0075]
FIG. 4 shows an example in which the evaluation values are set for video, audio, character strings, and the like. However, even if a single value is used without distinguishing these values, the values are set in different ways. You may. In addition, when it is desired to distinguish between the priority of the connection itself and the priority at the time of securing the communication bandwidth, the evaluation value at the time of connecting the communication line and the evaluation value at the time of communication are set separately. Is also good.
[0076]
The scene index shown in FIG. 5 may be set. This index is effective for flexible accommodation of the communication band when the priorities are different in the same data. The relationship between the two indexes when the index in FIG. 4 and the index in FIG. 5 are used is, for example, the index in FIG. 4 is used as a basic evaluation value when securing a communication band, and the index in FIG. Used as an evaluation value. For example, the evaluation value may be changed between the climax of the movie and the portion that is not.
[0077]
FIG. 6 shows a configuration example of a data packet received by each server, router, terminal, and the like in communication using an index. In this configuration example, the index is added to the normal header portion of the data packet. This index includes a portion representing the content of the data being communicated (content: an index of the communication content shown in FIG. 4 is added) and a portion representing the importance in the data (scene: shown in FIG. 5). May be added, and the number of requests for the same data at the same time (the number of requests) may be included. Further, if the setting is such that the data to be transmitted is specifically specified by the content, it may also include an ID (intra-data ID) indicating which part of the entire transmitted data.
[0078]
By using the number of requests, each router and server can preferentially process the larger number. This is because a plurality of requests can be transmitted in one data flow until the router copies and distributes them. Here, if the data to be transmitted can be specified specifically by the contents of the index, or if the data is transmitted with a time lag that can be covered by the cache even if the data is not transmitted at the same time, the same request may be counted. It is possible. This is because the data flows can be shared between data flows by using the ID. Also, the data flow of a request with a large fixed bandwidth can include the data flow of a request with a small fixed bandwidth, so that it can be included in the same request until it is distributed by a router. Furthermore, if the packet on the router's cache contains the data requested by the user, and the quality of the packet also satisfies the user's request (the data is transferred with a fixed bandwidth higher than the user's request), then the router will Can take the place of a shoulder.
[0079]
FIG. 7 is a diagram showing a configuration of the fixed bandwidth reservation units 110 and 210 in the server 100 and the router 200 shown in FIG. FIG. 8 is a flowchart showing the flow of the fixed bandwidth reservation process.
[0080]
1. Data selection (step 801)
The user finds and selects some desired data by using a WWW browser or the like or by using a directory search mechanism on a network. When selected, the server presents information about the data (index, size, transfer time, bandwidth for transferring data, fee, etc.) to the user. For example, a user accesses a multimedia database from a terminal using a browser and selects video data “Jurassic Wars”. Then, information about Jurassic Wars as shown in FIG. 9 is sent from the server. In the table of FIG. 9, the full transfer bandwidth indicates the bandwidth required to transfer data at full specifications.
[0081]
In addition, in the required fixed bandwidth in the user request column, a bandwidth obtained by adding + α to the minimum transfer bandwidth by the server can be set as a default fixed bandwidth.
[0082]
2. User request (step 802)
The user confirms the information from the server and the option setting of the user and issues a request. In the request, the date and time at which the transfer is desired to be started are entered from the terminal, and the user request column is changed (option setting) as required or desired, and then issued. For example, as shown in FIG. 10, a transfer start date and time can be entered, or the fixed bandwidth can be changed from 25 Kbytes by default to 35 Kbytes. In this case, the selection range is such that the full transfer bandwidth is the upper limit and the minimum transfer bandwidth is the lower limit.
[0083]
When distributing data for a fee, a license fee for receiving the data itself or charging information based on the communication amount may be presented at the same time. When charging based on the communication amount, it is also possible to distinguish between a fixed band charging method and a variable band charging method.
[0084]
3. Fixed bandwidth priority determination (step 803)
The router and the server determine the priority when the respective bands are provisionally reserved using, for example, the following equation 1 with respect to the data requested by the user. Each evaluation value is retrieved from the index tables of FIGS. 4 and 5 and used.
[0085]
In case of video, audio and text
ej = epj + esj + ecj
pj = ej / Σei (Equation 1)
Here, epj: video information evaluation value of a certain flow j
esj: Voice information evaluation value of a certain flow j
ecj: Character information evaluation value of a certain flow j
ej: evaluation value of a certain flow j
pj: priority
4. Router, server bandwidth provisional reservation (step 804)
The terminal, the server, and the router between the terminal and the server temporarily reserve a communication path (data flow) from the transfer start date and time to the end of the transfer. At this time, the tentative reservation unit 402 introduces a predetermined time called a bidding period, schedules communication requests arriving within the period according to the evaluation value (priority) of the information, and temporarily sets the communication resources. Make a reservation. Therefore, when a plurality of communication requests are received during the bidding period, each time a request with a higher evaluation value (priority) is received, the service start time of a communication request with a lower evaluation value (priority) than the evaluation value is changed. May be delayed.
[0086]
5. The bidding period monitoring unit 403 notifies the main reservation unit 404 of the end of the bidding period periodically or after a lapse of a predetermined time after notification from the provisional reservation unit (S805).
[0087]
6. In the main reservation unit 404, the provisional reservation of the communication resource is committed and registered as the main reservation (S806).
[0088]
8. The user is notified of the service start / end time as the communication resource reservation result (S807).
[0089]
Several variations can be considered as a method of selecting a bidding period, a tentative reservation, and a scheduling method for making a real reservation. An example is shown below. The number added to the data represents an evaluation value (priority). Here, the higher the number, the higher the priority.
[0090]
There is also a method of allocating on a first-come, first-served basis without using a bidding period, but such a case is a simple case where service priority is not considered. Therefore, a case in which the priority is considered will be described below.
[0091]
Bidding method 1. The length of the bidding period is fixed, and scheduling for provisional reservation is performed within the bidding period. (FIG. 11)
Bidding method 2. The length of the bidding period is fixed, and scheduling for the main reservation is performed after the bidding period ends. (FIG. 12)
2. Bidding method The length of the bidding period differs depending on the priority for each data. In each bidding period, scheduling for provisional reservation is performed. (FIG. 13)
In the case of the examples of the bidding methods 1 and 3, the time chart of the fixed band changes as shown in FIG. Note that a, b, and c in the figure represent the occupation status of the bandwidth over time at the time when the communication channel securing request packet having the priority arrives. The communication path securing request packets arriving at the time are called a communication request a, a communication request b, and a communication request c, respectively. The priority of each communication request is priority 5, priority 1, and priority 3, respectively. In the following examples, the length of the bidding period is fixed for simplicity, but the same processing can be performed even if the bidding periods overlap each other.
[Bid method 1]
First, the bidding method 1 will be described.
[0092]
The bidding period monitoring unit 403 notifies the provisional reservation unit 402 of the start of the bidding period. The length of the bidding period is fixed.
[0093]
The first bidding period is called bidding period 1. The case where three communication requests have arrived in the bidding period 1 will be described. This is shown in FIG. The arriving communication request obtains information such as a fixed bandwidth, a transfer time, and a priority required for scheduling for securing communication resources in the fixed band priority determining units 109 and 209 and the like.
[0094]
The communication request a that arrives first in the bidding period 1 makes a temporary reservation of communication resources in the temporary reservation unit 402. After the provisional reservation, the provisional reservation information of the communication resource is registered in the reservation information storage units 111 and 211. Here, the temporary reservation information is information including a transfer start time, a transfer end time, a required bandwidth, a fact that the reservation is a temporary reservation, and the like, and is stored in a form such as a database.
[0095]
Since the communication request b that arrives next has a lower priority than the communication request a that arrives first, it does not affect the provisional reservation of the communication resource of the communication request a, and does not affect the currently available bandwidth in the same manner as described above. The temporary reservation unit 402 makes a temporary reservation for communication resources.
[0096]
In the bidding period 1, the communication request c that has arrived last has a higher priority than the communication request b that has arrived within the same bidding period. Therefore, first, the provisional reservation unit 402 notifies the reservation information storage units 111 and 211 that the communication resources allocated for the communication request b are released. Thereafter, the tentative reservation unit 402 makes a tentative reservation of the communication resource for the communication request c. Finally, the provisional reservation unit 402 makes a provisional reservation for the communication request b having a low priority. The above result is registered as temporary reservation information in the reservation information storage units 111 and 211.
[0097]
FIG. 14 shows how the required bandwidth and the transfer start / end times are provisionally reserved.
[0098]
The bidding period monitoring unit 403 notifies the main reservation unit 404 that the bidding period has ended. The main reservation section 404 registers the resource information provisionally reserved in the reservation information storage sections 111 and 211 as the main reservation information in the reservation information storage sections 111 and 211. The real reservation information has the same configuration as the temporary reservation information except for the information indicating that it is a real reservation.
[Bid method 2]
Next, an example of reducing the load by performing scheduling at the end of the bidding period without performing scheduling every time a request is received (bid method 2) will be described.
[0099]
An example in which three communication requests a, b, and c have arrived, similarly to the bidding method 1. This is shown in FIG. The length of the bidding period is constant as in the bidding method 1. The start and end of the bidding period are monitored by the bidding period monitoring unit 403.
[0100]
The fixed bandwidth information is extracted from the communication request arriving before the end of the bidding period 1, and the fixed bandwidth information is notified to the temporary reservation unit 402. When the bidding period monitoring unit 403 notifies the temporary reservation unit 402 that the bidding period 1 has ended, scheduling for communication resource allocation is performed in the next bidding period (bidding period 2). Communication resources are allocated in order from the communication request having the highest priority that arrived in the bidding period 1. In the example of FIG. 12, scheduling is performed for the free bandwidth in the order of the communication request a, the communication request c, and the communication request b with the highest priority, and the real reservation unit 404 is notified. The main reservation unit 404 registers the main reservation information in the reservation information storage units 111 and 211.
[0101]
[Bid method 3]
Further, a method of changing the bidding period according to the evaluation value (priority) of each communication request will be described.
[0102]
An example in which three communication requests a, b, and c have arrived, similarly to the bidding method 1. This is shown in FIG. The bidding period monitoring unit 403 monitors the cycle of the bidding period. The length of the bidding period is determined according to the priority of the communication request. Here, the higher the priority of the communication request, the shorter the length of the bidding period, that is, the lower the possibility of interruption and scheduling. First, when the communication request a arrives, fixed bandwidth information is extracted. The provisional reservation unit 402 makes a provisional reservation, registers the provisional reservation information in the reservation information storage units 111 and 211, and notifies the priority period information described therein to the bidding period monitoring unit 403 to notify the bidding period monitoring unit 403 of the bidding period. Let the length be determined. Unless a communication request having a higher priority than the communication request a arrives within the bidding period of the communication request a, the other communication requests are not interrupted by scheduling for communication resource allocation. In this example, since only the communication request b having a lower priority than the communication request a arrives within the bidding period of the communication request a, the communication request a is notified by the bidding period monitoring unit 403 of the end of the bidding period for the communication request a. Then, the main reservation is made in the main reservation unit 404, and the main reservation information is registered in the reservation information storage units 111 and 211.
[0103]
The bidding period of the communication request b that arrives during the bidding period of the communication request a is also determined by the bidding period monitoring unit 403 based on the priority of the extracted communication request b. Since the communication request b has a lower priority than the communication request a, the bidding period is set longer than the communication request a. Thereafter, the communication request c that has arrived is notified by the bidding period monitoring unit 403 that the communication request b has arrived within the bidding period. Further, it can be seen that the priority of the extracted communication request c is higher than the priority of the currently provisionally reserved communication request b. Therefore, after the reservation information storage units 111 and 211 are notified that the temporary reservation information of the communication request b should be released, the temporary reservation unit 402 schedules the communication requests b and c, and the temporary reservation information is reserved. The information is registered in the information storage units 111 and 211. If a communication request having a higher priority does not arrive within the bidding period of the communication requests b and c, a notification of the end of the bidding period is made by the bidding period monitoring unit 403, and the temporary reservation information related to these communication requests is transmitted to the main reservation unit. A real reservation is made by 404. In this example, the end of the bidding period of the communication request c is notified first by the bidding period monitoring unit 403, and the tentative reservation information relating to the communication request c is registered in the reservation information storage units 111 and 211 as the main reservation information. Subsequently, the end of the bidding period of the communication request b is notified from the bidding period monitoring unit 403, and the tentative reservation information related to the communication request b is registered in the reservation information storage units 111 and 211 as the main reservation information.
[0104]
[Bid method 4]
Further, two types of fixed bandwidth, “minimum transfer bandwidth” and “user requested additional fixed bandwidth” are considered, and a pattern in which resource allocation is determined between them is shown.
[0105]
The “minimum transfer band” is a band that must be secured to a minimum that becomes meaningless if information is deleted any more, and the “user-requested fixed band” is a fixed band that can be cut off during congestion. The fixed band provides a fixed band throughout the service period, and does not change every moment according to the load condition of the communication path unlike the variable band. FIG. 15 shows a configuration example of the fixed band.
[0106]
Hereinafter, description will be made with reference to FIGS. 16 and 17.
[0107]
The length of the bidding period is fixed. After the end of the bidding period 1 is notified from the bidding period monitoring unit 403, the communication request arriving in the bidding period 1 makes a tentative reservation by the tentative reservation unit 402 in the next bidding period, bidding period 2. Although the communication requests a, b, and c are scheduled in the descending order of priority, there are cases where not all communication requests can be allocated to a band. Therefore, scheduling is performed in consideration of the user request for the arrived service. Here, the following is assumed.
[0108]
The communication request a and the communication request b request the service start immediately, but the deletion of the user requested additional band is permitted.
[0109]
The service start time of the communication request c may be delayed, but the deletion of the user requested additional band is not allowed.
[0110]
The temporary reservation unit 402 schedules the communication request a and the communication request b. At this time, communication resources cannot be assigned to all two communication requests. Therefore, the bandwidth of “additional user request” is divided according to the priority. In this example, division is performed at a ratio of 5: 3.
[0111]
Next, communication resources are allocated from the earliest time when all remaining communication requests c can be transferred. When all scheduling is completed, the result is notified to the main reservation unit 404, and the main reservation unit 404 registers the scheduling data in the reservation information storage units 111 and 211 as the main reservation information.
[0112]
In addition, it is also possible to implement as shown in FIG. 18 without providing a bidding period as described above.
[0113]
The method shown in FIG. 18 is the same as that shown in FIG. 8 up to the determination of the priority of the fixed band, but differs therefrom.
[0114]
4. Router, server bandwidth provisional reservation (steps 1804, 1805)
The terminal, the server, and the router between the terminal and the server temporarily reserve a communication path (data flow) from the transfer start date and time to the end of the transfer. At this time, a search is made for a communication path that can secure a fixed bandwidth so as to meet the request issued by the user as much as possible and to perform scheduling. As a result, communication at the lowest level of quality required from the reserved designated start date and time is guaranteed.
[0115]
If the bandwidth cannot be secured as requested by the user, the corresponding server or router presents the user with an alternative that is as close to the user's request as possible. Examples of alternatives are shown below.
[0116]
Alternative 1: As shown in FIG. 19, the start time is prioritized, and the data transfer is started from the time closest to the request while securing a bandwidth equal to or greater than the minimum fixed bandwidth.
[0117]
Alternative 2: As shown in FIG. 20, data transfer is started from the time zone closest to the request that can secure the bandwidth by giving priority to the fixed bandwidth requested by the user.
[0118]
5. Negotiation (Step 1806)
If the user is satisfied with the presented provisional reservation result (including the alternative), the user proceeds to the request in step 1607. However, when the user is not satisfied with the provisional reservation result and the alternative, the request is changed as follows, for example. Issue the request again.
[0119]
Examples of changes in the user request include the following.
[0120]
• Compromise to select alternatives.
[0121]
・ Issue the request again with another option.
[0122]
Search for another server with the same data.
[0123]
-Give up and search for completely different data.
[0124]
6. Request (Step 1807)
Request a data transfer if requested, or if there is a viable alternative.
[0125]
7. Data transfer (step 1808)
In communication based on the index, data transfer in each router is performed according to the procedure shown in FIG.
[0126]
7-1. In step S2101, the free bandwidth management unit 218 refers to the reservation information storage unit 211, knows how many data are currently flowing, how much bandwidth they are using, and how much bandwidth is used as a variable bandwidth. Calculate whether can be used.
[0127]
7-2. In step S2102, the variable bandwidth priority determining unit 205 grasps the evaluation value of each data from the index of the received packet.
[0128]
7-3. In step S2103, the variable band priority determining unit 205 calculates a priority based on the evaluation value obtained in step S2102, and the variable band allocating unit 206 calculates this and the amount of the variable band obtained in step S2101. Based on this, a variable band to be assigned to each data is determined.
[0129]
7-4. In step S2104, the variable band allocation unit 206 refers to the reservation information storage unit 211 and determines the number of packets to be allocated to the fixed band and the number of packets to be allocated to the variable band.
[0130]
7-5. In step S2105, the variable bandwidth allocating unit 206 determines whether or not all packets corresponding to the variable bandwidth can be transmitted with the variable bandwidth determined in steps S2103 and S2104.
[0131]
7-6. If it is determined in step S2105 that the bandwidth is insufficient, in step S2106, the packet discarding / restoring unit 207 thins out the packet to determine a packet to be transmitted, and in step S2107, transmits the packet to the packet transmitting unit 208. Instruct. In step S2108, the discarded packet is sent to the discarded packet cache unit 217, and the discarded packet cache unit 217 temporarily stores the discarded packet. Further, in step S2109, the packet discarding / restoring unit 207 determines whether or not data transmission can be performed on a detour path different from the original path. To send the packet.
[0132]
7-7. If it is determined in step S2105 that the bandwidth is sufficient, in step S2111 the packet discarding / restoring unit 207 refers to the discarded packet cache unit 217 and, if there is a cached packet, the packet that can be transmitted. Take it out of here. At step 2112, the packet transmission means is instructed to transmit the packet to which the packet is added.
[0133]
7-8. The above processing is repeated to some extent at regular time intervals, and the variable bandwidth is reallocated. This time interval can be determined independently of the above-mentioned fixed bandwidth scheduling interval (bid period). However, even though a new service has been started, variable bandwidth is not reallocated. For example, in order to prevent the occurrence of a mismatch between the fixed band and the variable band, the fixed band and the variable band may be set to an integral fraction of the bidding period.
[0134]
An example of an allocation processing procedure in the variable band allocation unit 502 will be described with reference to FIGS.
[0135]
In the figure, the fixed band and the variable band of each of the data 1, 2, and 3 are separately illustrated, but the total band of them can be collectively secured and realized as one data flow. Of course, as shown in the figure, it is also possible to realize by securing the fixed band and the variable band as separate flows.
[0136]
In FIG. 22, three types of data, data 1, 2, and 3, are transmitted. Initially, only data 1 and data 2 flow, so that the bands other than the bands used by these fixed bands are variable bands. The allocation of the variable band to each data is determined according to the priority ratio calculated based on the evaluation value given to each data. Here, the evaluation value is regarded as the priority as it is. That is, since data 1 has an evaluation value of 6 and data 2 has an evaluation value of 3, the priority ratio is 2: 1 and the entire variable band is divided at a ratio of 2: 1. The assignment of the variable band is reviewed at each time interval t.
[0137]
At time T1, transmission of data 3 starts. Since the fixed band of the data 3 uses the communication band, the band that can be used as the variable band decreases. Since the time T1 is an integer multiple of the time interval t, the allocation of the variable band is reviewed. Since the data 1 is the evaluation value 6, the data 2 is the evaluation value 3, and the data 3 is the evaluation value 4, the ratio of the variable band to be allocated is 6: 3: 4 according to the priority ratio.
[0138]
FIG. 23 is an example in which the evaluation value changes in the middle of the data. Initially, data 1 and 2 are transmitted. At time T1 (T1 ≠ n1t: n1 is an integer), transmission of data 1 ends. At this time, since the data transmission end time T1 is not an integral multiple of the time interval t, the reallocation is not performed immediately at this time. Reallocation is performed at time T2 (T2 = n2t: n2 is an integer) which is the next integral multiple of the time interval t, and the area occupied by the data 1 in the fluctuation band of the data 2 is expanded.
[0139]
When transmission of data 3 is started at time T3 (T3 = n3t: n3 is an integer), the allocation ratio of the variable bands of data 2 and data 3 becomes 1: 2. Further, at time T4 (T4 = n4t: n4 is an integer), it is assumed that the scene index of data 2 is "climax of movie" or the like, and the evaluation value temporarily increases to 6. In this case, at the time T4 when the variable band is reallocated, the evaluation values of data 2 and data 3 are both equal to 6, so that the variable band of data 2 is extended, and the variable band of data 3 is deleted by that much and 1 : 1 ratio. When the “movie climax” ends and the evaluation value returns to the original value, the band allocation also returns to the original value.
[0140]
In the example of FIG. 22, the transmission band of the data 1 or 2 is reduced by the start of the transmission of the data 3. If the variable bandwidth is reduced in this way, or if the required variable bandwidth cannot be secured, the packet that should have been transmitted using the variable bandwidth is discarded. However, instead of immediately discarding, the discarded packet cache unit 217 and the packet discarding / restoring 207 attempt to rescue the discarding. First, a description will be given of the discard of a packet that cannot be transmitted because a band cannot be secured. The data transmitted using the variable band is data that can be mechanically thinned out. Therefore, when data must be discarded, the data is thinned out.
[0141]
For example, image data in the interlaced GIF format is represented by coordinates (0, 0), (1, 0), (2, 0),. . . Instead of saving data in the order of (0,0), (10,0), (20,0),. . . , (1,0), (11,0), (21,0),. . . In this way, it takes a format that saves everywhere. Therefore, even if the end of the data is discarded, the image is formed although the image quality is deteriorated. Therefore, data that can be transmitted according to the allocated band is transmitted in order from the beginning of the data, and the data that cannot be transmitted is discarded as it is.
[0142]
Alternatively, in the image data compression method adopted by MPEG, there are three types of data, B, P, and I. First, B, then P if there is no B, then I if there is no P it can. This is due to the dependency relationship that B data is decoded using P data and I data, and P data is decoded using I data. In other words, if I is missing, neither P nor B until the next I is decoded. If P is missing, there is a relationship that B up to P is not decoded next. Therefore, B and P packets can be discarded according to the band that can be secured.
[0143]
Next, the processing of the discarded packet cache unit 217 will be described with reference to FIG. This diagram shows the transmission status of a certain piece of data. If the variable bandwidth is removed from time t1 to t2, the variable bandwidth returns to the original at time t2, and further extra bandwidth can be secured. Is shown.
[0144]
In this example, a packet that was intended to be transmitted during the period from t1 to t2, but could not be transmitted because the bandwidth was cut off, is held in the discarded packet cache unit 217. At time t2, when the congestion of the communication path is resolved and a sufficient bandwidth can be secured, the packet discarding / restoring unit 207 extracts the cached packet from the discarded packet cache unit 217 and performs normal fluctuation. The transmission is performed in the period from t2 to t3 in addition to the packet for the band.
[0145]
The packet discarding / restoring unit 207 also functions when there is a bypass route different from the original transmission route. The packet discarding / restoring unit 207 always keeps track of the band status of the bypass route, and if there is a free space in the bypass route, extracts the discarded packet from the discard packet cache unit 217 and transmits the packet to the bypass route.
[0146]
When a packet is bypassed by a bypass route, or when a packet is temporarily cached and transmitted after communication channel congestion is resolved, the packet arrives at the client (terminal) later than the original arrival time. . Therefore, as shown in FIG. 25, the client receives the packet transmitted on the original route and time, and holds the packet until the packet arriving late arrives, and the packet is transmitted by the detour route. A delay packet receiving unit 2502 that receives a packet and a packet that has been transmitted after the communication channel has been congested has been delayed, and a reception data combining unit 2503 that combines the two types of packets to reconstruct correct data. Is done.
[0147]
By adopting such a configuration, it is possible to cope with the occurrence of a packet arriving late, but there are cases where real-time properties are required and arrival delay is not allowed. By including in the index information indicating whether the arrival delay is not allowed or how long the arrival delay is allowed, the discarded packet cache unit 217 caches the information based on this information. Judge whether to discard immediately. The packet held in the discarded packet cache unit 217 is deleted from the cache as soon as the allowable delay time is exceeded.
[0148]
In the communication based on the index, data transfer in each router can also be performed by the procedure shown in FIG.
[0149]
1. Packet reception (step 2601)
Each router and server has a buffer that can search and operate a packet in accordance with an evaluation value obtained from an index for each data flow at every preset cycle. Received packets are first stored in this buffer.
[0150]
2. Index expansion (Step 2602)
An evaluation value corresponding to the index of the packet of each data flow is searched from the index tables of FIGS. 4 and 5 which are commonly owned by the routers and the servers for every certain period, for example, every one cycle or an appropriate number of cycles. If the index table of FIG. 5 is not used, that is, if there is no change in the evaluation value within the same data flow, the evaluation value of each packet obtained from the index table of FIG. In many cases, it can be used consistently. When considering the number of requests, a function corresponding to the number of requests may be used as in Expression 3.
[0151]
efki = ei (Equation 2)
Here, efki: evaluation value of flow i in a certain period k
ei: evaluation value in the index table of data of flow i
efki = H (ei, ri) (Equation 3)
Where ri is the number of requests to flow i
H: Function that adds the number of requests to the evaluation value
When setting an evaluation value in the same data, such as the scene index in FIG. 5, statistical processing is performed on the evaluation value retrieved for each flow as in Expression 4, and the statistical value is used as the evaluation value for each flow. It is desirable that As the statistical value, a value that can characterize each flow or compare flows can be obtained, such as a total value, an average value, and normalization of the evaluation values of each packet. When considering the number of requests, a function corresponding to the number of requests may be used as in Expression 5.
[0152]

Here, efki: evaluation value of flow i in a certain period k
ei: evaluation value in the index table of data of flow i
G: Function for statistically processing the evaluation value of each packet

Where ri is the number of requests to flow i
H: Function that adds the number of requests to the evaluation value
When the data evaluation value is set for each type of video, audio, character string, and the like, and particularly when the bandwidth can be operated for each medium, any one of Expressions 2 to 5 is performed for each medium. Is also good.
[0153]
3. Priority determination (step 2603)
The priority between data flows is determined by using the evaluation value of each data flow in each period. The priority determination function differs depending on how to set the type of the evaluation value and how to take the evaluation value. One simple example is when the evaluation value is expressed by a number and the larger the number, the higher the evaluation, as in the case where the evaluation value of each data flow is obtained as in Equations 2 to 5, etc. As shown in Expression 6, there is a method in which the ratio of the evaluation value of each data flow to the total evaluation value of all data flows is set as the priority of each data flow.
[0154]
In addition, for example, the evaluation value of the data flow can be regarded as the priority as it is.
[0155]

Here, efki: evaluation value of flow i in a certain period k
Pki: priority of flow i in a certain period k
When the evaluation value of the data is set for each type of video, audio, character string, and the like, and particularly when the bandwidth can be operated for each medium, the processing of Expression 6 may be performed for each medium.
[0156]
4. Communication bandwidth determination (step 2604)
The communication bandwidth allocated to each data flow is the sum of the fixed bandwidth and the variable bandwidth.
[0157]
Since the fixed bandwidth has already been secured by the scheduling mechanism when securing the router / server bandwidth, a variable bandwidth is assigned to each data flow here. As an example of the allocation method, there is a method of allocating a communication band to each data flow using the priority determined for each data flow. The method of assignment differs depending on the priority, but one simple example is to calculate the ratio of the evaluation value of each data flow to the sum of the evaluation values of all data flows as determined by the processing of Equation 6. When the priority of each data flow is used, a method of obtaining the bandwidth of each data flow from the product of the priority and the bandwidth of the entire variable region in the communication path as in Expression 7 is used.
[0158]
bki = pki × bkT
Where bki is the priority of flow i in a certain period k
bkT: total fluctuation bandwidth for data communication in a certain period k
pki: variable bandwidth for data communication of flow i in a certain period k
5. Packet transmission (step 2605)
The packet is transmitted while appropriately discarding the packet so as to match the communication bandwidth allocated to each data flow. There are two levels of discarding. One is to discard a packet from a flow having a lower priority according to the priority between data flows. The importance can be determined using the evaluation value of the index. The other is to reduce the amount of information by discarding packets from each data flow according to the low priority. In the present embodiment, the latter level will be described as an example. As an example of this method, for example, there is the following method.
[0159]
Next, an example to which the present invention is applied will be described.
[0160]
At first, communication control when "emergency report" is used will be described. By using an emergency report as an index, information can be privilegedly provided without following the usual scheduling rules. For example, in the past, when a disaster such as an earthquake occurs, there is a problem that communication requests to the place where the disaster occurred frequently occur and the communication line is punctured, so that emergency communication by 110 or 119 cannot be used. For such a problem, by setting the index to "emergency communication", it is possible to perform processing with priority over any other information. This means that simply setting the priority to the highest priority will immediately set the bandwidth for emergency communication if the fixed bandwidth required for other services occupies the entire bandwidth, based on the scheduling rules described above. I can not secure it. Therefore, a special scheduling mechanism for securing a communication band for emergency communication is required even if the minimum quality of other services is lacking (a fixed band is cut off). This can be easily extended by determining whether or not the index is “emergency communication” when scheduling a fixed band. This technology can correspond to the fact that earthquake information and election bulletin are being broadcast by the current telop on television. For example, in a network using a VOD mechanism, it is possible to broadcast emergency information as needed even when information is provided to fill the entire bandwidth.
[0161]
However, with regard to this emergency information, it is possible to mask unnecessary information at an individual responsibility by using an information filtering mechanism described later. For example, it is possible to eliminate the need for an election bulletin and to limit disaster information to the Kanto area.
[0162]
However, even with this technique, it is assumed that emergency communications frequently occur and all emergency communications cannot be processed in real time (communication band becomes insufficient). This is a common problem in the current telephone network. Even emergency communications deal with only intermittently connected information and ignore requests for which a line is not secured. As a countermeasure against such a problem, all requests, including requests that have been ignored in the past, are counted, and the distribution of request occurrences is grasped macro-wise, and used for disaster countermeasures such as dispatching an ambulance. To make things possible.
[0163]
This is because when emergency communication cannot be processed in real time when scheduling a fixed band, it is possible to estimate the occurrence frequency and the occurrence distribution of requests by performing only the schedule and evaluating the delay time.
[0164]
As an example of the next application, an example in which personal and terminal information is added to an index and sent is shown.
As a result, the service can be automatically adjusted based on the terminal used and the individual from the viewpoints of waste, work efficiency, privacy / confidentiality, and contract contents.
[0165]
For example, from a waste perspective,
・ It is useless to transfer data with an accuracy exceeding the specifications of the terminal. A printer wants data at a speed of about 300 dpi, but image data that can only be viewed on a screen requires about 72 dpi. If this can be automatically distinguished, the communication amount will be 1/3 or less. Further, it is useless to transmit color information to a monochrome terminal or to transmit 256-bit color information where only CRT precision of 8 bits is available.
[0166]
-It is useless to transfer media data that cannot be detected by a person with some handicap. It is possible to automate a function of sending image data and character data to a deaf person and audio data and Braille data to a blind person.
[0167]
In order to eliminate such useless data transfer, when a service is requested from a terminal, information about the terminal and the individual is added to notify the server. On the server side, after processing data in advance with data accuracy according to the terminal and the individual, it is possible to send the processed data to the communication path. This eliminates the useless transfer of information that was previously discarded because it could not be used on the terminal side, and communication resources can be used more effectively.
[0168]
Also, from the viewpoint of work efficiency, it is difficult for sales staff to search for useful data from detailed technical information, and it is desirable to construct a multifaceted database (data warehouse) and improve its efficiency. ing. Indexes streamline database searches.
[0169]
From the privacy / confidentiality perspective, by distributing partially publicized indices for individuals (similar to the IP address of the machine), unauthorized disclosure of personal information from the perspective of personal authentication as well as cryptographic communication can be achieved. , A department that prevents leaks of secrets from companies and public institutions.
[0170]
Further, as the contract contents, there are several levels of contract contents, and the service contents can be automatically changed by the contract contents index.
[0171]
As a third application example, it can be applied to information filtering. For individuals with various granularities such as individuals, regions, and nations, how to shut out unnecessary or disadvantageous information becomes an urgent issue as a huge network environment such as the Internet spreads. ing. Another problem is that legislation for protecting personal privacy, public order and morals, or protecting national interests has been delayed due to the free flow of information on the Internet.
[0172]
Index-based communication is also one solution to these problems. For example, nations, providers, corporations, individuals, etc. use the index to publish the range of data handled on the Internet, or the range not handled, using an index, so that the types of data that are not handled are unilateral. Can be rejected. This makes it possible to automatically exclude information that is unfavorable in morals and information that is not of interest, and it is possible to simultaneously select necessary information.
[0173]
The integrated public information communication network shown in FIG. 27 and the large-scale integrated public information communication network shown in FIG. 28 distribute a program such as news, movies, music, and the like at the request of the user through the communication network using the index described above. 1 shows an example of a case where the present invention is applied to a public infrastructure such as a computer service, a computer network service, and a telephone service.
[0174]
Each component includes at least a component of each component of the communication unit that uses the above-described index.
[0175]
The key station 1301 corresponds to the server 100, the relay station 1302 and the relay station (small) 1403 correspond to the router 200, the home 1304 corresponds to the terminal 300, and the information creating station 1305 corresponds to the index data creating unit 400. .
[0176]
【The invention's effect】
According to the present invention, resources can be allocated to communication requests from an unspecified number of people according to the contents of the transfer information, and the resource allocation can be dynamically changed according to the information contents. That is, the following effects can be obtained by dividing the band required for communication into a fixed region and a variable region and scheduling them separately.
[0177]
-By transmitting only the minimum necessary information in the fixed band, transmission of information (images and the like) with higher quality than necessary is suppressed, and traffic can be reduced.
[0178]
By performing fixed bandwidth scheduling, requests can be processed without being rejected even when communication channels are congested, and it is possible to present to users the start and end times of services that were not known conventionally.
[0179]
-By using the bidding period, scheduling according to the priority can be performed, and the service can be given light weight.
[0180]
-Even in the case where the band is full and transmission cannot be performed anymore, the possibility of transmission can be increased by mutually interchanging the variable band between communication requests.
[0181]
-It is possible to dynamically add additional information according to the load condition of the communication path, and it is possible to constantly provide the highest quality information that is higher than the required quality. This means that, for example, even in a single communication flow, it is possible to provide high-quality video and audio only in certain parts, such as climax, and to respond to fine-grained user requests. I have.
[0182]
ADVANTAGE OF THE INVENTION According to this invention, it becomes possible to allocate resources according to the content of the transfer information, and to dynamically change the resource allocation according to the information content, from the communication request from an unspecified majority. . Further, it is possible to construct a network capable of promptly responding to a disaster or the like, prevent data intrusion or the like that is against public order and morals, and further promote a user's compromise and secure communication resources in a form that the user is satisfied with.
[Brief description of the drawings]
FIG. 1 is a diagram illustrating an example of a network according to an embodiment of the present invention.
FIG. 2 is a diagram showing a configuration of each server, router, and terminal shown in FIG.
FIG. 3 is a diagram illustrating an example of a communication band division policy in a communication network using an index, and an example of a method of allocating a communication band to each communication according to the policy.
FIG. 4 is a diagram showing an example of an index table covering types of data published in a network.
FIG. 5 is a diagram illustrating an example of a scene index.
FIG. 6 is a diagram illustrating a configuration example of a data packet received by each server, router, terminal, and the like in communication using an index.
FIG. 7 is a diagram illustrating a configuration example of a fixed bandwidth reservation unit that is a component of a server and a router of a network according to an embodiment of the present invention.
FIG. 8 is a flowchart illustrating a data transfer procedure in communication performed using an indexed packet.
FIG. 9 is a diagram showing an example of data transfer regulation information sent from a server to a terminal.
FIG. 10 is a diagram showing an example of data transfer regulation information in consideration of a user request sent from a terminal to a server.
FIG. 11 is a diagram illustrating an example of a bidding method 1 that is a method of setting the length of a bidding period constant and performing scheduling for provisional reservation within the bidding period among methods of allocating communication resources to received information. .
FIG. 12 is a diagram illustrating an example of a bidding method 2 that is a method of performing a scheduling for a final reservation after a bidding period, in which the length of a bidding period is constant among methods of allocating communication resources to received information. .
FIG. 13 shows a method of allocating communication resources to received information, in which the length of a bidding period differs depending on the priority of each data, and a method of performing scheduling for provisional reservation in each bidding period. FIG. 11 is a diagram illustrating an example of a method 3.
FIG. 14 is a diagram illustrating an example of a procedure for creating a schedule table in which a fixed band is secured over time.
FIG. 15 is a diagram illustrating a configuration example of a fixed band in a bidding method 4;
FIG. 16 is a diagram illustrating an example of scheduling of a variable band.
FIG. 17 is a diagram illustrating an example of a fixed band schedule result in the bidding method 4;
FIG. 18 is a flowchart illustrating another data transfer procedure in communication performed using an indexed packet.
FIG. 19 is a diagram showing an example of data transfer regulation information as an alternative sent from the server to the terminal.
FIG. 20 is a diagram showing another example of data transfer regulation information as an alternative sent from the server to the terminal.
FIG. 21 is a flowchart illustrating a procedure of a basic process in a variable bandwidth allocating unit.
FIG. 22 is a diagram illustrating an example of scheduling of a variable band.
FIG. 23 is a diagram illustrating an example of scheduling of a variable band.
FIG. 24 is a diagram illustrating the concept of data retransmission.
FIG. 25 is a diagram illustrating a configuration example of a device on a client (terminal) side in the case of a packet detour or a packet cache.
FIG. 26 is a flowchart showing another procedure in the variable bandwidth allocating unit.
FIG. 27 is a diagram illustrating an example of an integrated public information communication network.
FIG. 28 is a diagram illustrating an example of a large-scale integrated public information communication network.
[Explanation of symbols]
100 server machine
105 Variable Band Priority Determination Unit
200 router
210 Fixed bandwidth reservation unit
300 terminals
400 Indexed data generator

Claims (20)

Means for managing the resource allocation status of the communication path ;
Means for transferring communication information to the communication path,
Means for determining the content of the communication information to be transferred;
The communication path comprising a fixed band in which a fixed bandwidth is fixedly secured for transferring the communication information in accordance with the determined content, and a variable band in which the bandwidth varies according to a predetermined situation. Means for allocating the bandwidth of
Said assigning means is adapted to secure the fixed band and / or the fluctuation band of the bandwidth according to the contents and the resource allocation situation of the communication information, the variation depending on the content and the resource allocation situation of the communication information A communication device for controlling a bandwidth of a band. Communication information to said transfer have a index indicating the contents of the communication information, said determination means, based on the index, according to claim 1, characterized in that to determine the contents of the communication information to be transferred Communication device. The communication device according to claim 1, wherein a bandwidth of the variable band is periodically controlled. Means for transferring the communication information as a packet using the variable band,
Means for discarding packets according to the decrease in the variable bandwidth,
Means for temporarily storing the discarded packets,
The communication device according to claim 1, further comprising: a unit configured to transfer the temporarily stored packet according to an increase in the variable bandwidth. Means for holding a packet that failed to transfer the communication information as a packet to the original transmission path using the variable band,
Means for transferring the held packet using a free bypass route after grasping the bandwidth status of the bypass route when a bypass route different from the original transmission route exists. The communication device according to claim 1, wherein: Means for allocating the resources of the communication path in response to a transfer request of the communication information to which the priority related to the allocation of the resources of the communication path is added;
Means for temporarily reserving the resources of the communication path in response to the transfer request;
Means for scheduling the provisional reservation during a predetermined bidding period;
Means for changing the temporary reservation to a full reservation of resources of the communication path according to the scheduling,
The communication device , wherein the scheduling unit evaluates the priority of each transfer request during the bidding period and performs scheduling each time the transfer request is issued. Means for allocating the resources of the communication path in response to a transfer request of the communication information to which the priority related to the allocation of the resources of the communication path is added;
Means for temporarily reserving the resources of the communication path in response to the transfer request;
Means for scheduling the provisional reservation during a predetermined bidding period;
Means for changing the temporary reservation to a full reservation of resources of the communication path according to the scheduling,
The scheduling means, the rear bidding period ends, the communication apparatus characterized by scheduling by evaluating the priority of each transfer request in said bidding period. Means for allocating the resources of the communication path in response to a transfer request of the communication information to which the priority related to the allocation of the resources of the communication path is added;
Means for temporarily reserving the resources of the communication path in response to the transfer request;
Means for scheduling the provisional reservation during a predetermined bidding period;
Means for changing the temporary reservation to a full reservation of resources of the communication path according to the scheduling,
The scheduling means, said transfer determines the length of the bidding period in accordance with the priority of the request, the communication apparatus characterized by scheduling the transfer request that were in the bidding period. Means for allocating the resources of the communication path in response to a transfer request of the communication information to which the priority related to the allocation of the resources of the communication path is added;
Means for temporarily reserving the resources of the communication path in response to the transfer request;
Means for scheduling the provisional reservation during a predetermined bidding period;
Means for changing the tentative reservation to a full reservation of resources of the communication path according to the scheduling,
The bandwidth of the communication channel assigned and means for separating and a second band that can be cut at the time of congestion in the first band must be secured minimum no longer make sense to delete any more information,
The communication apparatus according to claim 1 , wherein said scheduling means performs a scheduling after the end of the bidding period, taking into consideration the elimination of the second band of each transfer request during the bidding period and the priority of each transfer request. (A) managing the resource allocation status of the communication path ;
(B) determining the content of the communication information to be transferred;
(C) A fixed band for fixedly securing a fixed bandwidth for transferring the communication information according to the determined content, and a variable band whose bandwidth varies according to a predetermined situation. Allocating a band of the communication path,
Step (c) includes the steps of securing said fixed bandwidth and / or the fluctuation band of the band width in accordance with the contents and the resource allocation situation of the communication information, depending on the content and the resource allocation situation of the communication information Controlling the bandwidth of the fluctuating band by using the communication method. The method further comprises: adding an index indicating the content of the communication information to the communication information to be transferred, and determining the content of the communication information to be transferred based on the index in the step (b). The communication method according to claim 10, wherein The communication method according to claim 10 , wherein the step of controlling the bandwidth of the variable band periodically controls the bandwidth of the variable band. The communication information is transferred as a packet using the variable band, and the packet is discarded in accordance with the decrease in the variable band, and the discarded packet is temporarily stored. The communication method according to claim 10, further comprising a step of transferring the temporarily stored packet. The communication information is held as a packet using the variable bandwidth, and the packet that could not be transferred to the original transmission path is held. If there is another bypass path different from the original transmission path, the band status of the bypass path is grasped. 11. The communication method according to claim 10, further comprising a step of transferring the held packet using a vacant detour path. (A) tentatively reserving the resources of the communication path in response to a transfer request for communication information to which a priority relating to the allocation of resources of the communication path has been added;
(B) scheduling the provisional reservation during a predetermined bidding period;
(C) changing the temporary reservation to a full reservation of the resources of the communication path according to the scheduling;
Step (b), the communication method characterized in that scheduling by evaluating the priority of each transfer request in the bidding period each time there is the transfer request. (A) tentatively reserving the resources of the communication path in response to a transfer request for communication information to which a priority relating to the allocation of resources of the communication path has been added;
(B) scheduling the provisional reservation during a predetermined bidding period;
(C) changing the temporary reservation to a full reservation of the resources of the communication path according to the scheduling;
In the communication method, the step (b) performs scheduling after evaluating the priority of each transfer request during the bidding period after the bidding period ends. (A) tentatively reserving the resources of the communication path in response to a transfer request for communication information to which a priority relating to the allocation of resources of the communication path has been added;
(B) scheduling the provisional reservation during a predetermined bidding period;
(C) changing the temporary reservation to a full reservation of the resources of the communication path according to the scheduling;
Step (b) determines the length of the bidding period according to the priority of the transfer request, the communication method characterized by scheduling the transfer request that were in the bidding period. (A) tentatively reserving the resources of the communication path in response to a transfer request for communication information to which a priority relating to the allocation of resources of the communication path has been added;
(B) scheduling the provisional reservation during a predetermined bidding period;
(C) changing the temporary reservation to a full reservation of the resources of the communication path according to the scheduling;
The bandwidth of the communication channel to be allocated, comprising a first and a band that must be minimum to ensure no longer make sense to delete any more information, and a step of separating into a second band that can be cut at the time of congestion ,
In the communication method, the step (b) is characterized in that after the bidding period ends, the scheduling is performed in consideration of the elimination of the second band of each transfer request and the priority of each transfer request during the bidding period. Means for managing the resource allocation status of the communication path, means for transferring communication information to the communication path, means for determining the content of the communication information to be transferred, and, according to the determined content, the communication information to transfer, causes the computer to function as means for allocating the bandwidth of the communication path including the fluctuation band bandwidth varies in accordance with the fixed bandwidth and a predetermined status constant bandwidth is secured in a fixed manner, wherein The allocating means secures the fixed bandwidth and / or the variable bandwidth of the bandwidth according to the content of the communication information and the resource allocation status, and allocates the variable bandwidth according to the content of the communication information and the resource allocation status. A recording medium recording a program for causing the computer to function so as to control a bandwidth . Means for allocating communication path resources to a transfer request of communication information to which priority relating to allocation of communication path resources is added; means for temporarily reserving the communication path resources in response to the transfer request; A computer that functions as means for scheduling the provisional reservation during the bidding period, and as means for converting the provisional reservation into a permanent reservation for the resources of the communication path in accordance with the scheduling; a recording medium recording a program for evaluating the priority of each transfer request during the bidding period each time the certain function the computer to schedule.

Images