JP3566038B2 - Resource allocation device, resource allocation method and recording medium, and display device, display 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, and a display device, a display method, and a recording medium.
[0002]
[Prior art]
In a communication network such as the Internet or an intranet, the quality of communication between any two connected terminals (computers) depends on how resources are allocated on a communication path. For example, communication quality such as data transfer speed depends on how resources such as line capacity and CPU time are allocated. In operating a communication network, quality restrictions are often imposed.
[0003]
However, a communication network is generally composed of a plurality of terminals connected in a complicated manner by a plurality of communication paths. Although a static estimation can be performed, the quality of communication between two specific terminals during operation is dynamically determined. It was not easy to grasp and the change was not easy. For example, when a user or an administrator changes the allocation of resources in order to improve the quality of communication between two specific terminals, it is necessary to consider the effect on other communication paths on the communication network while taking into consideration the effect on other communication paths. Finding the right assignment was very difficult.
[0004]
[Problems to be solved by the invention]
As described above, the conventional technology has a problem that the quality of communication between two specific terminals cannot be dynamically and easily grasped during the operation of the communication network, and the change thereof is not easy.
[0005]
In addition, when changing resource allocation in order to improve the quality of communication between two specific terminals, it is very important to find the optimum allocation while taking into account the effect on other communication paths on the communication network. There was also a problem that it was difficult.
[0006]
SUMMARY OF THE INVENTION The present invention has been made to solve the above-mentioned problems of the related art, and a resource allocating apparatus, a resource allocating method, and a computer readable resource which can automatically and dynamically secure resources on a communication network. It is intended to provide a recording medium.
[0007]
Another object of the present invention is to automatically return to the original state without normalizing, for example, when something happens suddenly and resource allocation is performed based on it, An object of the present invention is to provide a resource allocating apparatus, a resource allocating method, and a computer-readable recording medium that are not affected by the influence later.
[0008]
Still another object of the present invention is to visualize the resource allocation status between each terminal on the communication network so that the quality between any two terminals can be easily grasped. A resource allocating apparatus and a resource allocating method capable of instructing a change of a resource allocation state, calculating an actually optimum resource allocating method, and changing the allocation after adding a constraint on the resource allocation. And a computer-readable recording medium, and a display device, a display method, and a computer-readable recording medium.
[0009]
Yet another object of the present invention is to provide a resource that facilitates a user or an administrator to secure the quality of a specific communication channel in a specific situation while autonomously satisfying the quality constraint in normal operation. An object of the present invention is to provide an allocation device, a resource allocation method, and a computer-readable recording medium.
[0010]
[Means for Solving the Problems]
In order to solve the above problems, the present invention according to claim 1 is:A second memory for storing communication resource allocation information between terminals included in a communication network.1 storage means and the communication resource allocationRestriction informationSecond storage means for storingResource allocation status visualization means for visualizing the allocation status of the communication resources allocated between the terminals included in the communication network by the distance between the terminals, and a distance between any terminals visualized by the resource allocation status visualization means Indicates a policy for allocating the communication resources by a distance changing operation between terminals that move closer or farther from each otherMeans,According to the instruction of the policy for allocating the communication resource by the distance changing operation between the terminals, the communication resource allocation information of the first storage means and the constraint information of the second storage means are referred to for the communication between the terminals.Resource assignment changing means for changing the assignment of communication resources and thereafter returning the assignment of communication resources to the state before the change.
[0011]
The present invention according to claim 2 is the resource allocating apparatus according to claim 1, further comprising a resource allocation status visualizing means for visualizing the communication resource allocation status as a degree of association between terminals. .
[0012]
According to a third aspect of the present invention, in the resource allocating apparatus according to the first aspect, the allocation of the communication resources to the resource allocation changing means is performed based on a degree of association between any terminals included in the communication network. It is characterized by further comprising means for designating a policy.
[0016]
Claim2The invention describedIn a display device for displaying a first terminal, a second terminal, and the third terminal connected to a communication network, a communication resource allocated between two terminals among the first to third terminals. A storage unit for storing allocation information; and a distance between the first terminal and the second terminal and a distance between the first terminal and the third terminal in accordance with communication resource allocation information stored in the storage unit. Means for determining a distance to a terminal; displaying the first terminal and the second terminal, and the first terminal and the third terminal, separated by the determined distance and connected by a line segment, respectively. Means for instructing the allocation of the communication resources by a distance changing operation between the terminals to make the distance between the first terminal to the third terminal shorter or longer, and the communication by the distance changing operation between the terminals. According to the instructions of the resource allocation policy, With reference to allocation information of the communication resources of the serial storage means, by assigning communication resources to between the first terminal to the third terminal again,Means for changing the determined distance between the first terminal and the second terminal and the distance between the first terminal and the third terminal; and determining the first terminal, the second terminal, and the first terminal. Means for separating the third terminal from the third terminal by the changed distance and connecting them with line segments for display.
[0017]
Claim3The invention describedA step of storing, in the first storage means, information on assignment of communication resources between terminals included in the communication network;When,Storing the communication resource allocation constraint information in a second storage means, and visualizing an allocation status of the communication resources allocated between terminals included in the communication network by a distance between terminals, Step of instructing the communication resource allocation policy by a distance change operation between the terminals to bring the distance between the visualized terminals closer or farther, by indicating the policy of the communication resource allocation by the distance change operation between the terminals, The communication resource allocation information of the first storage means and the constraint information of the second storage means are referred to for the communication between the terminals.Changing a communication resource assignment, and thereafter returning the communication resource assignment to the state before the change.
[0018]
Claim4The invention describedA display method for displaying a first terminal, a second terminal, and the third terminal connected to a communication network on a display device, wherein allocation of communication resources allocated to the first to third terminals Storing information in a storage means, and a distance between the first terminal and the second terminal and a distance between the first terminal and the third terminal in accordance with communication resource allocation information stored in the storage means. Determining the distance between the first terminal and the second terminal, and separating the first terminal and the second terminal and the first terminal and the third terminal by the determined distance, respectively, and connecting them by a line segment. Displaying on the display device, instructing a policy of allocating the communication resources by a distance changing operation between the first terminal to the third terminal, or changing the distance between the terminals, and a distance between the terminals. Said communication resources by a change operation According to the instruction of the allocation policy, the first terminal and the third terminal determined by re-allocating the communication resources to the first terminal to the third terminal with reference to the communication resource allocation information of the storage unit. Changing the distance to the second terminal and the distance between the first terminal and the third terminal; and setting the first terminal and the second terminal and the first terminal and the third terminal to: Separating by the changed distance, connecting with a line segment and displaying on a display device.It is characterized by doing.
[0019]
Claim5The invention described5. The display method according to claim 4, wherein another terminal whose communication resource allocation has been changed by a moving operation of a specific terminal among the first to third terminals is moved.It is characterized by doing.
[0023]
Claim6The invention described6. The display method according to claim 5, wherein when the first terminal is moved closer to the second terminal, the position of the third terminal is moved so as to move the third terminal away from the second terminal. Characterized by movingI do.
[0024]
Claim7The invention described is a computerA first storage unit for storing communication resource allocation information between terminals included in the communication network, a second storage unit for storing the communication resource allocation constraint information, A resource allocation status visualization means for visualizing the allocation status of the communication resources allocated to the terminal by a distance between terminals, and a distance between terminals that makes the distance between any terminals visualized by the resource allocation status visualization unit closer or farther away Means for instructing a policy for allocating the communication resources by a change operation and instructions for a policy for allocating the communication resources by a distance change operation between terminals, the communication resource allocation information in the first storage means, the second Changing the allocation of the communication resources among the terminals by referring to the constraint information of the storage means, and thereafter changing the resource allocation to return the allocation of the communication resources to the state before the change. Function as a stageThis is a storage medium storing a program to be executed.
[0025]
Claim8The invention describedIn a program that causes a computer that displays a first terminal, a second terminal, and the third terminal connected to a communication network to execute processing, the computer is assigned to the first to third terminals. Storage means for storing communication resource allocation information; and a distance between the first terminal and the second terminal and a first terminal, in accordance with the communication resource allocation information stored in the storage means. Means for determining a distance to a third terminal; and separating the first and second terminals and the first and third terminals by the determined distance, respectively, Means for connecting and displaying; means for instructing a policy for allocating the communication resources by means of a distance changing operation for shortening or moving the distance between the first terminal to the third terminal; and a distance changing operation for the terminals By the said The first terminal determined by re-allocating communication resources to the first to third terminals by referring to the communication resource allocation information in the storage means according to the instruction of the resource allocation policy. Means for changing the distance between the first terminal and the second terminal, and the distance between the first terminal and the third terminal; and setting the first terminal and the second terminal and the first terminal and the third terminal , A recording medium storing a program that functions as a display unit that is separated by the changed distance and connected by a line segment.
[0031]
Claim 1,3as well as7In the described invention,Visualize the allocation status of the communication resources allocated between the terminals included in the communication network by the distance between the terminals, and the distance between the visualized terminals can be reduced or increased by the distance change operation by the user. When the communication resource allocation policy is instructed by the user, the communication resource allocation information is referred to and the communication resource allocation constraint information is referred to based on the instruction.Because, in the event that something happens suddenly and a resource is allocated based on it, it automatically returns to its original state without normalizing, It is possible to avoid being affected by such an unexpected matter later. Therefore, during normal operation, it is possible to dynamically and automatically allocate resources of the communication network so as to guarantee a preset quality constraint.
[0032]
Claim 2,4 and 8In the described invention,The distance between the first terminal and the second terminal and the distance between the first terminal and the third terminal are determined according to the communication resource allocation information, and these terminals are determined. Separated by a distance and connected by a line segment and displayed on the display device. Then, when a policy for allocating communication resources is instructed by a distance change operation between the first terminal to the third terminal or a distance changing operation between the terminals to be distant, the communication resource allocation information in the storage unit is referred to, By re-allocating communication resources to the first to third terminals, the determined distance between the terminals is changed, the terminals are separated by the changed distance, and connected by line segments for display. That is, the communication resource allocation policy is instructed to the resource allocation changing means by the operation of changing the distance between any of the displayed terminals, so that the optimal resource re-establishment is performed based on the current state of the allocated communication resources. Assignments can be made, which further enhances user convenience. In addition, a resource allocation instruction from a user can be automatically converted into a resource allocation policy to actually change the resource allocation. Therefore, the quality-oriented communication network can be easily reconfigured.
[0033]
Claim5In the described invention, the claimsBook described in 4In addition to the invention,Since the other terminal whose communication resource assignment has been changed by the operation of moving a specific terminal among the first terminal to the third terminal is moved, the user or the administrator particularly needs the quality information of the communication network. Can be visually confirmed.
[0037]
Claim6In the described invention,In addition to the present invention according to claim 5, the third terminal further moves the third terminal away from the second terminal when the first terminal is moved closer to the second terminal by a moving operation by the user. Move the position ofThe user can easily and visually grasp the status of communication resource allocation between any two terminals.
That is,Upon receiving an instruction from the user,1Terminal2When receiving an instruction to approach the first terminal by a certain amount, the2Non-terminalThirdTerminalThatKeep away by a certain amountOfThus, the user can not only visually and easily grasp the status of the communication resource allocation between any two terminals, but also add a resource allocation constraint as necessary, and A change of the assignment status can be instructed. In addition, since the state related to the change of the resource allocation status is also visualized, the user can surely and efficiently allocate communication resources while visually confirming.
[0038]
Therefore, according to the present invention, it becomes easy for a user or an administrator to secure the quality of a specific communication channel in a specific situation while autonomously satisfying the restriction on quality in normal operation.
[0039]
As a result, the quality-oriented communication network can be easily reconfigured, and the communication environment can be further improved.
[0040]
BEST MODE FOR CARRYING OUT THE INVENTION
Hereinafter, embodiments of the present invention will be described with reference to the drawings.
[0041]
FIG. 1 is a conceptual diagram showing an example of a communication network configuration to which a communication network resource allocation device according to the present invention is applied. In the figure, N1, N2, ..., N6 are terminal identifiers, and A12, A25, ..., A56 represent identifiers of communication paths between the two terminals. Here, a client-server type communication network is used. The server is provided with the functions of a server process and a client process described below, and the client is provided with the functions of a client process described later. Information provided by a server process arranged at a specific terminal on a communication network is used by a client process arranged at an arbitrary terminal.
[0042]
As shown in the figure, the terminal N5 is connected to a terminal N4 via a communication path A45, a terminal N2 via a communication path A25, and a terminal N6 via a communication path A56. The terminal N2 is connected to the terminal N1 via the communication path A12, and the terminal N6 is connected to the terminal N3 via the communication path A36. The terminal N5 has a server process and a client process as a server, and the other terminals N1, N2, N3, N4 and N6 each have a client process.
[0043]
Here, the terms “communication distance” and “communication distance space”, which are concepts according to the present invention, are defined.
[0044]
In general, the following metric d defined between elements belonging to an arbitrary set S is called a distance on S, and the following equation holds.
[0045]
(Equation 1)

(Equation 2)

(Equation 3)

On an arbitrary communication network N, communication quality such as easiness of communication is quantitatively expressed, and “communication distance” is introduced as a concept satisfying the above properties, and the following dc is defined.
That is,
N, any two terminals N_i, N_jBetween the maximum amount of information that can be exchanged per unit time, that is, the amount of information that can be exchanged through the fastest communication path among N_i, N_jCommunication distance between
And dc (N_i, N_j).
[0046]
In the present embodiment, the information transfer rate is adopted as the communication quality (represented by the communication distance). However, if it is quantified, another quality measure, such as the information error rate, may be similarly defined as the communication distance. Can be. Hereinafter, the description will be made assuming that the target quality measure is the information transfer rate.
[0047]
Also, for a certain terminal on an arbitrary communication network N, a “communication distance space” is introduced as a concept representing the above set of communication distances from the terminal to all other terminals on N, and the following DC is defined. I do.
[0048]
That is,
"Communication distance space" DC
A terminal N on N_iFor all terminals on N and N_iSet of pairs with communication distance from
Is defined as
(Equation 4)

, Ν_iCommunication distance space attached to, or Ν_iIs defined as a communication distance space based on
[0049]
Next, the configuration of the present invention will be described.
[0050]
FIG. 2 is a block diagram showing a configuration of a communication network resource allocation device according to an embodiment of the present invention.
[0051]
As shown in the figure, the present apparatus includes a resource allocation visualizing unit 101, a resource allocation change instructing unit 102, a resource allocation changing unit 103, a resource allocation status storage unit 104, a resource allocation constraint setting unit 105, and a resource allocation constraint storage. The unit 106 is provided. The server process 107 includes a resource allocation status storage unit 104, a resource allocation constraint storage unit 106, and a resource allocation change unit 103. The client process 108 includes a resource allocation visualization unit 101, a resource allocation change instruction unit 102, and a resource allocation constraint setting unit. 105. As described above, the server process 107 is located on a specific terminal, and the client process 108 is located on any terminal. The visualized expression in the client process 108 in FIG. 10 refers to the degree of association between terminals displayed on a display (not shown in the block diagram showing the configuration).
[0052]
The resource allocation visualization unit 101 has a function of visually displaying communication quality such as easiness of communication, reads out current resource allocation information from the resource allocation status storage unit 104, and stores this information in the information (described later). ) By adding processing, a communication distance space based on an arbitrary terminal on the network is generated, and the communication distance space is visualized by an appropriate expression means as needed. Details of the resource allocation visualization unit 101 will be described later.
[0053]
The resource allocation change instructing unit 102 has a function of performing a preparation operation and an instruction operation necessary for changing the allocation of communication network resources according to a user's request, receives an input from the user, and receives necessary resources from the input. And sends a resource allocation change instruction to the resource allocation changing unit 103. Further, the resource allocation change instructing unit 102 has a function of constantly exchanging information with the resource allocation changing unit 103 and rejecting the request when the user instructs an excessive request.
[0054]
The resource allocation change unit 103 has a function of changing the allocation of communication network resources within the existing constraints, receives a resource allocation instruction issued by the resource allocation change instruction unit 102 based on a user request, and reallocates resources. Perform the assignment.
[0055]
The resource allocation status storage unit 104 stores information on a communication network (hereinafter, referred to as “communication network information”) necessary for performing (re) allocating resources, monitors the communication network as needed, and constantly updates the communication network. It has a function of recording the resource allocation status. The information on the communication network required for the (re) allocation of resources is resource allocation information necessary for calculating an information transfer rate between arbitrary terminals, such as CPU time, line capacity, buffer capacity, communication Band information and the like are recorded. As described above, the resource allocation information is updated by the resource allocation status storage unit 104 by referring to the communication network (network) at regular intervals.
[0056]
The resource allocation constraint setting unit 105 has a function of setting and resetting restrictions on communication resource allocation, for example, a lower limit of quality required for a communication channel, a priority of communication channel allocation, and the like. Based on the request or the like, the information regarding the restriction on the communication resource allocation is written in the resource allocation restriction storage unit 106, and the information regarding the restriction on the communication resource allocation stored in the resource allocation restriction storage unit 106 is rewritten.
[0057]
The resource allocation constraint storage unit 106 has a function of storing constraint information, such as the lower limit of the required quality of the communication channel and the priority of the communication channel, regarding the information recorded in the resource allocation status storage unit. The constraint information stored in the resource assignment constraint storage unit 106 is used when setting resource assignment constraints, which will be described later, or when deciding a resource securing policy when allocating communication resources.
[0058]
Next, the operation of the communication network resource allocating apparatus configured as described above will be described.
[0059]
FIG. 3 is a flowchart showing the operation of the present apparatus.
[0060]
As shown in the figure, first, the operation of the present apparatus is started (step 301). Accordingly, the resource allocation status storage unit 104 monitors the communication network at regular intervals, and starts an operation of constantly updating the communication network information stored in the resource allocation status storage unit 104 to the latest communication network information. Further, when the operation of the present apparatus is started, the autonomous change of the allocation of the communication network resources can be performed at any time. This autonomous change in the allocation of communication network resources usually means that the communication network is operated under a certain quality constraint, the resource allocation is temporarily changed by a user's instruction, and automatically changed when the request is completed. This means that the resource allocation is returned so as to satisfy the original constraint.
[0061]
In the autonomous change of the allocation of the communication network resources, the resource allocation changing unit 103 changes the resource allocation of the communication network so as to satisfy the constraints while referring to the resource allocation status storage unit 104 and the resource allocation constraint storage unit 106. . At this time, when an assignment instruction is received from the user, the resources of the communication network are assigned so as to satisfy the instruction. The operation related to the autonomous change of the allocation of the communication network resources will be described by taking the communication network of FIG. 1 as an example.
[0062]
In the figure, it is assumed that the constraint of the average distribution of CPU time to A25, $ 45, and $ 56 is recorded in the resource allocation constraint storage unit 106 as a normal quality constraint for N5. In this case, the resource allocation change unit 103 always refers to the resource allocation status sequentially recorded in the resource allocation status storage unit 104 and adjusts the CPU time to the three communication paths A25 and # 45 in order to observe the above restrictions. , And $ 56. Here, when the user instructs to increase the resource allocation to A25, the resource allocation changing unit 103 changes the time slice of the CPU time to satisfy this request. In this case, it is necessary to allocate communication resources for the resources allocated to A25 from $ 45 and $ 56, but the resources are equally allocated according to the constraints originally imposed. Then, when the user stops the request, the resource allocation changing unit 103 again causes the CPU to relocate the CPU to the three communication paths in accordance with the constraints recorded in the resource assignment constraint storage unit 106 by the autonomous network resource changing function as described above. Distribute time evenly.
[0063]
Next, the current resource allocation status is visualized (step 302). This operation will be described in detail.
[0064]
Assuming that the change of the communication network resource allocation is performed to control the information transfer rate, the information referred to and changed by the user is not the resource allocation itself, but the information transfer rate corresponding to the resource allocation status is better. . In view of this point, the communication network resource allocation is made to correspond to the communication distance space based on the information transfer speed, and by visualizing this, the user can confirm the current communication network from the viewpoint of the information transfer speed. is there. The resource allocation status visualizing unit 101 reads the current resource allocation information from the resource allocation status storage unit 104, processes this information to configure information on the communication distance space DC, and visualizes the information by an appropriate expression means. The details will be described later.
[0065]
FIG. 4 is a diagram showing an example in which the communication distance space based on the terminal N5 in the communication network of FIG. 1 is visualized by the resource allocation status visualization unit 101.
[0066]
As shown in the figure, nodes N1, N2,..., N6 in the figure are identifiers corresponding to each terminal on the communication network. The broken line in the figure corresponds to the routing. At the time of visualization, a reference terminal is specified for convenience. In the figure, a communication distance space based on N5 is displayed. The three terminals N2, N4, and N6 that can communicate directly from N5 are arranged at positions proportional to the communication distance from N5. That is, for example, a value obtained by multiplying the distance between N5 and N6 (represented as “N5 to N6”) by a certain number is equal to the actual communication distance between N5 and N6. In this embodiment, an expression in which the distance in the figure is proportional to the communication distance is used, but any means for expressing the quantified quality can be used. In the present embodiment, the directions viewed from N5 are arranged such that the angles formed by the directions are equal. Terminals that cannot communicate directly from N5 are arranged on an extension of N6 as viewed from N5, for example, to indicate that N3 communicates via N6.
[0067]
At this time, the distance between N6 and N3 is proportional to the communication distance between them. However, in this case, the distance between N5 and N3 in the figure has no relation to the actual communication distance. That is, the communication distance between N5 and N3 is not necessarily equal to the sum of the communication distance between N5 and N6 (a fixed multiple of N5 and N6) and the communication distance between N6 and N3 (a fixed multiple of N6 and N3). Absent. This is because, for example, in packet communication or the like, transmission from the relay station to the target station may be started before all packets arrive at the relay station. That is, in the visualization diagram, the distance between any two adjacent stations in the figure accurately reflects the actual communication distance between the two stations, but the distance between two non-adjacent stations is the 2 It can be said that the actual communication distance between stations is not always accurately reflected. As a display format in this visualization, any terminal can be selected and displayed. Conversely, an arbitrary terminal can be selected and hidden.
[0068]
FIG. 5 is a diagram illustrating an example of the visualization when N6 is not displayed in the visualization example illustrated in FIG. In the case shown in the figure, the node corresponding to N3 is relocated to a position proportional to the communication distance with N5.
[0069]
Further, a circle shown by a broken line surrounding a node adjacent to a reference node (referred to as a “reference node”) is referred to as an adjacent node when the maximum resource is allocated to the adjacent node. Indicates the limit of communication quality that a node may have. That is, if the quality is longer than the communication distance indicated by this radius, it indicates that a request cannot be made.
[0070]
In the example described above, the communication distance space based on N5 is represented, but the communication distance space based on an arbitrary terminal can be visualized.
[0071]
FIG. 6 is a diagram illustrating an example of visualizing a communication distance space based on, for example, N2.
[0072]
As shown in the figure, when N2 is used as a reference, only two nodes N2 and N5 are adjacent nodes, and two dashed lines in the radial direction representing the two routes are written at 180 degrees from the center N2. . When viewed from N2, the end of N5 is branched into two, N4 and N6 are arranged on the branch line, and N3 is arranged on an extension of N6. It should be noted that the two line segments branching from N5 to N4 and N6 form an angle of 120 degrees, which is an angle obtained by dividing 360 degrees by the number of line segments 3 including the line segment from the reference node to N5. Be placed.
[0073]
Next, an instruction regarding the required quality for the communication path is received from the user (step 303). That is, the user can visually grasp the communication resources by looking at the visualized expression. For example, when the user wants to change the communication distance between a certain node and a certain node on the visualized expression, an instruction to that effect is given. This will be given to this device. Changing the distance between nodes on the visualized representation corresponds to changing the channel quality between the corresponding terminals. Therefore, the operation of instructing the distance change on the visualized representation is performed by the user. This is because the request is transmitted to the apparatus as an input operation of a request for the communication channel quality from the device.
[0074]
The resource allocation change instructing unit 102 receives the input from the user, calculates a necessary resource allocation policy from the input, and sends a resource allocation change instruction to the resource allocation changing unit 103. However, since the amount of resources that can be allocated depends on the original holding amount and the imposed constraints, it is not possible to give an unlimited change instruction. As described above, the resource allocation change instructing unit 102 always exchanges information with the resource allocation changing unit 103, and rejects the request when the user instructs an excessive request.
[0075]
Consider an example in which a resource assignment change instruction is issued by a user command in a communication distance space based on N5 shown in FIG. The change instruction is issued by changing the relative position of the node in the communication distance space. At this time, the node whose position can be changed is limited to a node adjacent to the reference node, that is, a node surrounded by a broken line. In the figure, nodes whose positions can be changed are limited to N2, N4 and N6. To improve the quality of the communication path between N5 and N4, an operation of bringing N4 closer to N5 is performed. The operation of bringing N4 closer to N5 is specifically performed in the form of key input (not shown) by a user (client).
[0076]
FIG. 7 is a diagram conceptually showing the operation of bringing N4 closer to N5.
[0077]
As shown in the figure, as N4 approaches N5, the resource allocation change instructing unit 102 calculates a corresponding change instruction and sends it to the resource allocation changing unit 103. At this point, if a request exceeding the achievable quality is made, that is, if the request is made to go beyond the dashed circle, this request is rejected by the resource allocation change instruction unit 102 as described above. If the request from the client is a feasible quality request, the resource allocation change instructing unit 102 sends a corresponding change instruction to the resource allocation changing unit 103, and the resource allocation changing unit 103 reallocates resources according to the given change instruction. Execute. By performing this operation, resources reserved for communication with another terminal are allocated to secure necessary resources. As a result, as shown in the figure, the distance between N2 and N6 is expressed so as to increase. That is, in the same figure, as the client performs an operation of bringing N4 closer to N5 using a mouse (not shown) or the like (step 303), on the display (not shown), N2 and N1 move away from N5 to N6. And N3 also move away from N5. At this time, as described later, the resource allocation changing unit 103 reduces the communication resources allocated to the communication paths N2 to N5 and N5 to N6 so that the communication resources are allocated to N4 to N5. The resources are reallocated, and the communication quality (in this case, the information transfer speed) of N4 to N5 increases. In order to reduce the communication resources, a policy for appropriately allocating the communication resources such as the CPU time, the line capacity, and the buffer capacity is established, and the reduction is performed according to the policy.
[0078]
Next, the resource allocation change instructing unit 102 checks whether or not the instruction (input) from the user is an allocation change instruction (step 304). If the instruction (input) from the user is an allocation change instruction, the process proceeds to the next step 305, and if not, it is determined that the resource allocation is restricted, and the process proceeds to the next step 308.
[0079]
The resource allocation change unit 103 receives the user request that the resource allocation change instructing unit 102 has actually converted into a resource allocation instruction (step 305), and actually performs resource reallocation (step 306). The information needed is the type and amount of controllable resources, including the constraints currently imposed. In reallocating the resources, the resource allocation changing unit 103 determines a policy for securing the resources requested by the resource allocation change instructing unit 102, that is, determines which communication path is to be degraded.
[0080]
Restrictions may be imposed when deciding a policy for securing resources. The restrictions include, for example, a lower limit of quality for a specific communication path, a priority set for each communication path, and the like. For the former, it is necessary to allocate resources from another communication path while keeping the resources of the communication path with the lower limit set, and for the latter, it is necessary to allocate resources in order from the communication path with the lower priority. .
[0081]
In the present embodiment, there is no particular limitation on the method of allocating resources for the requested quality. As a simple example, in the case of FIG. 7, N5 is a resource that can be changed in order to control the quality of three communication paths A25, # 45 and # 56 between the terminal N5 and the adjacent terminal. Consider the CPU time allocated to. In the example shown in the drawing, in response to a request to improve the quality of # 45, an operation is performed in which the CPU time allocated to A25 and $ 56 is reduced and the CPU time is allocated to $ 45.
[0082]
In allocating resources for the requested quality described above, the resource allocation change unit 103 refers to the information in both the resource allocation status storage unit 104 and the resource allocation constraint storage unit 106, and You need to answer 102 requests.
[0083]
Through such a process, when an instruction to actually change the allocation is issued from the resource allocation change instructing unit 102, the resource allocation changing unit 103 actually changes the resource allocation on the communication network. This change result is reflected in the resource allocation status storage unit 104 (step 307), and further (as described above) is reflected on the visualized representation.
[0084]
The resource allocation change instructing unit 102 checks whether or not the instruction (input) from the user is an allocation change instruction (step 304). This is sent to the constraint setting unit 105. The resource allocation constraint setting unit 105 receives the user request converted by the resource allocation change instruction unit 102 into the resource allocation constraint instruction (step 308). The operation of setting / updating the resource allocation constraint will be described below.
[0085]
In the above-described example, an example of equal allocation of CPU time has been described above as a constraint on resource allocation. Thus, in the communication distance space, it is necessary to be able to set constraints on resource allocation. As described above, examples of the restrictions that can be set include, for example, the lower limit of the quality of a specific communication path and the priority set for each communication path. Here, a specific method of setting these restrictions will be described. The resource allocation constraint setting unit 105 sets the constraint on the quality of the communication network. In the previous example, the constraint of equal allocation was described as an example of the constraint, but here,
・ Lower limit of communication channel quality
・ Priority of communication channel
The setting method of is described.
[0086]
(1) When setting the lower limit of communication channel quality as a constraint
By setting a link of a certain length from a reference node to a specific node in a communication distance space, a lower limit of quality can be set for a corresponding communication path.
[0087]
FIG. 8 is a conceptual diagram showing how a lower limit of quality is set for a corresponding communication path by setting a link of a fixed length from the reference node N5 to the specific node N6. As shown in the figure, in the communication distance space, the two nodes N5 and N6 to which the link is set do not have a communication distance longer than the length of the link. This means that the communication speed of the communication path between the two corresponding terminals (here, N5 and N6) does not become slower than a certain value.
[0088]
A link set on the basis of a certain node remains as a constraint on the communication distance space on the basis of the other node (see FIG. 9).
[0089]
FIG. 9 is a conceptual diagram showing that a link set with N5 as a reference node remains as a constraint in a communication distance space with another node N2 as a reference node.
[0090]
As shown in FIG. 8, the links N5 to N6 set in FIG. 8 remain as constraints even in a communication distance space with N2 as a reference node. Therefore, even in the communication distance space where N2 is the reference node, the communication speed of the communication path between N5 and N6 does not become lower than a certain value.
[0091]
FIG. 10 is a diagram showing a state in which an assignment change instruction is issued when restrictions are set on the communication path between N5 and N6 in this way.
[0092]
As shown in the figure, when N4 is brought closer to N5 in the same manner as in the above-described example, the resource allocation is changed from the communication path A25 in order to change the resource allocation while maintaining the quality of the communication path # 56. .
[0093]
(2) When setting the priority of the communication channel as a constraint
The priority can be set for each adjacent node in the communication distance space. In particular, a node for which no priority is specified has the lowest priority. If it is desired to ensure the quality of the communication path with a specific terminal with priority, the priority of the corresponding node is set higher than the others. This means that the resources of the communication path between the reference node and the higher priority node are less likely to be reduced than other communication paths when the resource allocation is changed.
[0094]
FIG. 11 shows an example in which priorities are set in a communication distance space based on N5.
[0095]
As shown in the figure, since the first priority is set to N2 and the second priority is set to N6, the resources of the communication paths of N2 to N5 are set to the communication paths of N5 to N6. Resources are less likely to be reduced.
[0096]
The priority set on the basis of a certain node is significant only in the communication distance space on the basis of that node.
[0097]
FIG. 12 is a conceptual diagram showing a state where the display is switched to the communication distance space based on N2 in a situation where the priority is set in the communication distance space based on N5.
[0098]
As shown in the figure, even if the priorities are set for N2 and N6 on the communication distance space based on N5 (FIG. 11), the priorities are only on the communication distance space based on N5. Since it has meaning, when the display is switched to the display of the communication distance space based on N2, the priorities set for N2 and N6 are cleared. Priority is assigned to N5 in FIG.
“2” is set for a new priority in the communication distance space based on N2.
[0099]
FIG. 13 is a conceptual diagram showing a state in which an assignment change instruction is issued when restrictions are set as described above.
[0100]
As shown in the figure, when N4 is brought closer to N5 as in the above example, if N2 is set to have a higher priority than N6, more resources are allocated from the communication path # 56. become.
[0101]
The constraint information set as described above is stored (recorded / updated) in the resource assignment constraint storage unit 106 by the resource assignment constraint setting unit 105. Further, this information is referred to by the resource allocation changing unit 103 as described above, and is used for determining a resource securing policy at the time of resource allocation.
[0102]
As described above, according to the present embodiment, the resource allocation status storage unit 104 monitors the communication network at regular intervals, and always updates the communication network information stored in the resource allocation status storage unit 104 with the latest communication network information. The resource allocation changing unit 103 allocates communication resources based on the user's resource allocation request while referring to the resource allocation status storage unit 104 and the resource allocation constraint storage unit 106. It operates to return the resource allocation to satisfy the above constraints, so that during normal operation, it is possible to dynamically and automatically allocate the resources of the communication network to guarantee the preset quality constraints become.
[0103]
Further, since the resource allocation visualizing unit 101 generates a communication distance space based on an arbitrary terminal on the network and visualizes the communication distance space by an appropriate expression means as needed, the user or the administrator particularly needs While visually confirming the quality information, it is possible to visually give necessary quality requirements and quality restrictions.
[0104]
As a result, it is possible to automatically convert to the resource allocation policy and actually change the resource allocation. Therefore, the quality-oriented communication network can be easily reconfigured. Next, the details of the resource allocation visualization unit 101 will be described with reference to the drawings.
[0105]
FIG. 14 is a block diagram illustrating a configuration of the resource allocation visualization unit 101 according to the first embodiment.
[0106]
As shown in the figure, a resource allocation visualizing unit 101 calculates a relevance between arbitrary terminals from a resource allocation status stored in a resource allocation status storage unit 104, It has a connection relationship management unit 202 for managing the connection relationship with the terminal, and a relevance display unit 203 for displaying the relevance.
[0107]
The degree-of-association calculation unit 201 calculates the degree of association between the terminals from the resource allocation status stored in the resource allocation status storage unit 104 using any two terminals as arguments.
[0108]
The communication distance is taken as an example of the relevance. At this time, as the resource allocation status, information necessary for obtaining a communication distance, such as a communication buffer capacity of each terminal, a CPU time allocated for channel control, a capacity of a communication path, and the like are stored. It is possible to obtain the theoretical value of the communication distance from the given information by a known technique.
[0109]
The connection relation management unit 202 manages connection relations of all terminals on the communication network based on the own terminal by appropriate means. In the processing of the resource allocation visualization unit 101, a concept of “tree” that can be regarded as a tree structure connecting terminals is used. That is, in the present embodiment, the communication network is regarded as a single tree by estimating a terminal as a node, a communication path as a route (a branch of a tree), and an aggregate of terminals to be selected as subtrees. . Here, the “tree” is one of the expression methods of a set, and gives a hierarchical parent-child relationship to a set of elements called nodes. One of the nodes is called a "root" and is distinguished from other nodes and is defined as follows.
[0110]
1 A single node forms a tree by itself. This node is also the root of the tree. 2 n is a node and T₁, T₂, ..., T_kAre trees and their roots are n₁, N₂, ..., n_kAnd At this time, n is n₁, N₂, ..., n_k    For all parents, you get a new tree. In this tree, n is the root and T₁, T₂, ..., T_kIs the root subtree. Node n₁, N₂, ..., n_kIs called a child of node n.
[0111]
An empty set without nodes is also considered a tree, and is called an empty tree.
[0112]
n₁, N₂, ..., n_kIs a sequence of nodes in a tree, where n for 1 ≦ i <k_iIs n_{i + 1}Is the parent of node n₁To n_kCalled the route to.
[0113]
When there is a path from node a to node b, a is said to be an ancestor of b and b is a descendant of a. Also, ancestors and descendants other than themselves are called true ancestors and true descendants. The root is the only node in a tree that has no true ancestor. Nodes that have no true descendants are called "leaves." The structure formed by nodes (including roots and leaves) and paths in this way is called a "tree structure".
[0114]
The association degree display unit 203 displays the tree managed by the connection relation management unit 202 by an appropriate display unit. In the present embodiment, an example is shown in which a graph is displayed centering on the own terminal. Details of this management operation will be described later.
[0115]
Next, the operation of the resource allocation visualization unit 101 configured as described above will be described. FIG. 15 is a flowchart showing the operation of the resource allocation visualization unit 101. In the present embodiment, as described above, a description will be given of the logic of determining the form displayed on the resource allocation visualization unit 101 shown in the first embodiment by managing the tree with the own terminal as a root. In the present embodiment, description will be given with reference to FIGS. 16 to 21 showing application examples based on the operation of FIG.
[0116]
As shown in FIG. 15, first, a set S of all terminals is prepared (step 1501). FIG. 16 is a conceptual diagram showing a state where the set S is prepared.
[0117]
Next, the terminal itself is removed from S, and this is set as the root of the tree in the tree structure (step 1502). That is, the own terminal is the root of the tree. The following is the procedure for recursively regenerating trees.
[0118]
FIG. 17 is a conceptual diagram showing a state in which the own terminal (here, the reference node N5) is removed from the set S, and this N5 is used as the root of the tree. Here, N5 is not only the root of the tree but also the leaf of the tree.
[0119]
Next, all the terminals adjacent to the terminal arranged at the leaf of the current tree are selected from S, and this is set as S '(step 1503). FIG. 18 is a diagram conceptually showing a state in which all the terminals N2, N4, and N6 adjacent to the terminal (here, only N5) arranged at the leaf of the current tree are selected from the set S, and these are set to S '. .
[0120]
Next, for each terminal in S ′, the relevance calculating unit 201 is called to calculate the communication distance with the terminal, and one route that minimizes this is selected, and the route adjacent to the terminal on the route is selected. The terminal is set to t (step 1504). According to the definition of S ′, t is always located at a node that is a leaf of the current tree. Therefore, the terminal is removed from S ′ and set as a child of t. At this time, as the attribute of the terminal, the relevance calculating unit 201 is called to calculate and add a communication distance with the terminal and a communication distance with t.
[0121]
Then, step 1504 is repeated until S 'becomes empty (step 1505).
[0122]
FIG. 19 is a diagram conceptually showing an example of the above operation.
[0123]
As shown in the figure, for the terminal N2 of S ', the relevance calculator 201 is called to calculate the communication distance with the terminal N5, and one route (N2 to N5) that minimizes this is selected. The terminal N5 adjacent to the terminal N2 on the route is defined as t. Therefore, the terminal N2 is removed from S 'and is set as a child of N5 which is t. At this time, as the attribute of the terminal, the relevance calculating unit 201 is called to calculate and add a communication distance with the terminal and a communication distance with t. This operation is repeated until S ′ becomes empty, that is, for N4 and N6, as shown in the figure, N2, N4 and N6 are each children of N5, and each terminal and N5 are shown in the right column. Are connected by a line segment. The numbers written in the nodes N2, N4 and N6 represent the communication distance with the terminal and the communication distance with t.
[0124]
Next, steps 1503 and 1504 are repeated until S becomes empty (step 1506).
[0125]
FIG. 20 and FIG. 21 are diagrams conceptually showing a state in which the operation of repeating steps 1503 and 1504 until S becomes empty is performed.
[0126]
As shown in FIG. 20, terminals N1 (adjacent to N2) and N3 (adjacent to N6) adjacent to terminals (here, N5, N2, N4, and N6) arranged at the leaves of the current tree from the set S in FIG. All are selected, and these are set as S '. First, for the terminal N1 in S ', the relevance calculating unit 201 is called to calculate the communication distance with the terminal N2, and one route (N2 to N1) that minimizes the communication distance is selected, and on the route, The terminal N2 adjacent to the terminal N1 is defined as t. Therefore, the terminal N1 is removed from S ', and is set as a child of N2 which is t. At this time, as the attribute of the terminal, the relevance calculating unit 201 is called to calculate and add the communication distance with the terminal itself (here, 3) and the communication distance with t (here, 5). This operation is repeated until S 'becomes empty, that is, for N3.
[0127]
FIG. 21 is a diagram showing a result obtained as a result of such an operation. As shown in the drawing, N1 is a child of N2, and N3 is a child of N6, and a tree structure is created in the right column, which is connected to nodes as terminals, by paths.
[0128]
In the above example, any terminal other than the child of the own terminal can be temporarily managed as a child of the own terminal. The operation in this case will be described below.
[0129]
FIG. 22 is a flowchart showing the operation of the resource allocation visualization unit 101.
[0130]
As shown in the figure, first, a partial tree T ′ having the terminal as a root is removed from the original tree, and an identifier of the original parent terminal is given as an attribute of the terminal (step 2201).
[0131]
Next, T ′ is connected to the original tree as a subtree of a child of the own terminal (step 2202).
[0132]
When returning to the original state, T 'is removed from the terminal itself, and the connection is made as a subtree of the child of the original parent with reference to the attribute (step 2203).
[0133]
FIG. 23 is a diagram conceptually showing an operation state when N3 is a child of N5 in the tree of FIG.
[0134]
As shown in the figure, first, a partial tree T '((N6) -N3) rooted at the terminal N3 is removed from the original tree, and the attribute N6 of the original parent terminal is set as the attribute of the terminal N3. Give. Next, T ′ is connected to the original tree as a subtree of a child of the own terminal N5. In this case, when returning to the original state, T ′ is removed from the own terminal N5, and the connection is made as a child subtree of the original parent N6 with reference to the attribute (having “N6”).
[0135]
Next, a second embodiment according to the present invention will be described.
[0136]
The configuration of the resource allocation visualization unit 101 is the same as that of the first embodiment.
[0137]
Next, an operation according to the present embodiment will be described. Here, an example is shown in which a graph is displayed centering on the own terminal.
[0138]
FIG. 24 is a flowchart showing the operation according to the present embodiment. According to this flowchart, the operation when applied to the tree shown in FIG. 21 will be described with reference to FIGS.
[0139]
First, the terminal is displayed at the center of the screen (step 2401). FIG. 25 is a diagram for explaining this operation. As shown in the circle in the figure, the identifier N5 of the own terminal is displayed at the center of the screen.
[0140]
Next, all the children of the own terminal are displayed in order at a distance proportional to the communication distance in the attribute. At this time, the terminals are arranged such that the angles formed by the respective children as viewed from the own terminal are equal. That is, when the number of children is three, the angle is 120 degrees, and when the number of children is five, the angle is 72 degrees.
[0141]
FIG. 26 is a diagram showing a state displayed by this operation.
[0142]
As shown in the figure, all the children N2, N4 and N6 of the own terminal N5 are in the communication distance in the attribute (as shown in FIG. 21, 3 for N2, 5 for N4, 4 for N6). Displayed in proportion to the distance. At this time, since the number of children is three, the child N2, N4, and N6 viewed from the own terminal N5 are linearly displayed in a radial direction from N5 such that the angle formed by the children N2, N4, and N6 becomes 120 degrees.
[0143]
Next, for terminals where no child is displayed, all the children are displayed at a distance proportional to the communication distance in the attribute. At this time, the display is made so that the angles formed by all terminals including the parent from each child as seen from the terminal are equal (step 2403). That is, when the number of children is 3, the angle formed by the four terminals including the parent is 90 degrees, and when the number of children is 5, the angle formed by the six terminals including the parent is 60 degrees. To be displayed.
[0144]
FIG. 27 is a diagram showing a state displayed by this operation.
[0145]
As shown in the figure, for the terminal N2 in which no child is displayed, all the children (only N1) are displayed at a distance proportional to the communication distance (here, 3) in the attribute. At this time, since the number of children (N1) is 1, the display is made so that the angles formed by the two terminals including the parent (N2) are equal, that is, 180 degrees. N3 is also displayed by the same operation.
[0146]
Next, step 2403 is repeated until there is no terminal that is not displayed (step 2404).
[0147]
In the above procedure, terminals other than the child of the own terminal will not be displayed at a position proportional to the communication distance with the own terminal, but will be displayed at a position proportional to the communication distance with the parent. Accordingly, these terminals can be displayed as children of the own terminal. An instruction to display a certain terminal at a position proportional to the communication distance from the own terminal is given. For example, the instruction is given by an operation such as moving the mouse pointer to a terminal arranged on the screen and clicking a button. Thereby, the connection relationship management unit 202 reconstructs the tree according to the algorithm shown in the flowchart of FIG. 22, and the relevance display unit 203 redisplays the reconstructed tree. Thus, an arbitrary terminal can be displayed at a position proportional to the communication distance from the own terminal.
[0148]
FIG. 28 is a diagram illustrating an example in which the terminal N3 other than the child of the own terminal N5 is displayed as a child of the own terminal. This is a diagram corresponding to the case described in FIG.
[0149]
As shown in the figure, first, an instruction to display the terminal N3 at a position proportional to the communication distance from the own terminal N5 is issued by, for example, moving a mouse pointer (not shown) to a terminal arranged on the screen. It is given through actions such as clicking a button. In response to this instruction, the connection relationship management unit 202 reconstructs the tree according to the algorithm shown in the flowchart of FIG. 22, and the relevance display unit 203 redisplays the reconstructed tree. As the specific reconfiguration logic, the same logic as described above is employed.
[0150]
As described in detail above, according to the first and second embodiments, the degree-of-association calculation unit 201 calculates the degree of association between the terminals based on the resource allocation status in the resource allocation status storage unit 104. The connection relation management unit 202 manages the connection relation of all the terminals on the communication network based on the own terminal, for example, by introducing a tree structure rooted at the own terminal. Since the tree managed by the connection relation management unit 202 is displayed by an appropriate display means, it becomes possible to visualize communication resources in which communication quality is accurately reflected in accordance with the network connection status of the communication network. As a result, the user can visually grasp the allocation status of the communication resources, and can issue the communication resource allocation instruction smoothly, without error, and speedily.
[0151]
According to the present invention, in particular, while a user or an administrator visually confirms quality information of a communication network and visually gives necessary quality requirements and quality constraints, automatically This can be converted into a resource allocation policy to actually change the resource allocation.
[0152]
Further, by using the technical concept described in the present embodiment, the user not only visually grasps the communication resource allocation status, but also dynamically issues a communication resource reallocation instruction on a screen, Its execution can be confirmed immediately. As a result, communication resources can be allocated efficiently, reliably, and intuitively. Therefore, according to the present invention, the reconfiguration of the communication network can be performed easily and reliably. Note that the present invention is not limited to the above-described embodiment, and various modifications can be made within the scope of the technical idea of the present invention.
[0153]
For example, in the above-described embodiment, the case where the distance in the figure displayed on the display means of the visualization device is set to be proportional to the communication distance is described as an example, but any distance that expresses quantified quality can be used. Attribute can be used.
[0154]
In addition, the case where a circle is illustrated as a diagram displayed on the display unit of the visualization device has been exemplified, but any device can be used as long as it functions as a unit for accurately visualizing the resource allocation status between terminals on the communication network. Can be.
[0155]
【The invention's effect】
As described in detail above, according to the present invention, the first information regarding the communication resource allocation status, the second information regarding the restriction on the allocation of communication resources, and the communication from the user. Since the allocation of communication resources is changed autonomously based on the instruction on the resource allocation policy, for example, when something happens suddenly and the resource is allocated based on it, it is normal. It is automatically returned to the original state without being changed, and it is possible to avoid being affected by such an unexpected matter later. Therefore, during normal operation, it is possible to dynamically and automatically allocate resources of the communication network so as to guarantee a preset quality constraint.
[0156]
According to the present invention described in claims 2, 9, and 16, in addition to the present invention described in claims 1, 8, and 15, the communication resource allocation status is further visualized as the degree of association between terminals. In particular, users and managers can visually check the quality information of the communication network.
[0157]
According to the third, tenth and seventeenth aspects of the present invention, in addition to the first, eight and fifteenth aspects of the present invention, a resource allocation changing means based on the degree of relevance between arbitrary terminals included in the communication network. , A communication resource allocation policy is instructed, so that optimal resource reallocation can be performed based on the current state of the allocated communication resources, thereby further increasing the convenience of the user. In addition, a resource allocation instruction from a user can be automatically converted into a resource allocation policy to actually change the resource allocation. Therefore, the quality-oriented communication network can be easily reconfigured.
[0158]
According to the present invention described in claims 4, 11 and 18, in addition to the present invention described in claims 1, 8 and 15, the second information relating to the restriction on the allocation of communication resources is further created, updated and deleted. The result is stored in the second storage means, so that the latest information about the resource allocation reflecting the reallocation of the resources can be held. In a rapidly changing communication environment, real-time optimal re-allocation of resources can be performed, which further enhances user convenience.
[0159]
According to the fifth, twelfth and nineteenth aspects of the present invention, the degree of association between arbitrary terminals included in the communication network is calculated based on the allocation status of communication resources for each communication path, and the connection between the terminals is managed. Since the calculated degree of association is displayed, it is possible to visualize the resource allocation status among the terminals on the communication network. This allows the user to easily and visually grasp the status of the communication resource allocation between any two terminals. According to the present invention as set forth in claims 6, 13 and 20, the first terminal is displayed substantially at the center of the screen, and the angles formed by the terminals adjacent to the first terminal as viewed from the first terminal are equal. A line connecting the displayed first and second terminals, and displaying the second terminal in such a direction and a distance according to the allocation status of the communication resources of the communication path between the first and second terminals. Since the minutes are displayed, it is possible to accurately visualize the resource allocation status between the terminals on the communication network. This allows the user to easily and visually grasp the status of the communication resource allocation between any two terminals.
[0160]
According to the present invention described in Claims 7, 14 and 21, in addition to the present invention described in Claims 6, 13 and 20, the third terminal is fixed to the first terminal upon receiving an instruction from the user. When an instruction to approach the amount is received, terminals other than the third terminal adjacent to the first terminal are moved away by an amount corresponding to a certain amount, so that the user can use communication resources between any two terminals. Not only can the user easily visually grasp the allocation status of the resources, but also can instruct the change of the resource allocation status after adding restrictions on the resource allocation as necessary. In addition, since the state related to the change of the resource allocation status is also visualized, the user can surely and efficiently allocate communication resources while visually confirming.
[0161]
Therefore, according to the present invention, it becomes easy for a user or an administrator to secure the quality of a specific communication channel in a specific situation while autonomously satisfying the restriction on quality in normal operation.
[0162]
As a result, the quality-oriented communication network can be easily reconfigured, and the communication environment can be further improved.
[Brief description of the drawings]
FIG. 1 is a conceptual diagram illustrating an example of a communication network configuration according to an embodiment of the present invention.
FIG. 2 is a block diagram showing a configuration of a communication network resource allocation device according to one embodiment of the present invention.
FIG. 3 is a flowchart showing an operation of the apparatus according to one embodiment of the present invention.
FIG. 4 is a diagram showing an example of realizing a communication distance space according to an embodiment of the present invention;
FIG. 5 is a diagram illustrating an example of a visualization of a communication distance space according to an embodiment of the present invention.
FIG. 6 is a diagram illustrating an example of visualizing a communication distance space according to an embodiment of the present invention.
FIG. 7 is a diagram conceptually illustrating an operation of bringing a terminal closer to another terminal according to an embodiment of the present invention.
FIG. 8 is a conceptual diagram illustrating a state in which a link according to an embodiment of the present invention is set to set a lower limit of quality on a corresponding communication path.
FIG. 9 is a conceptual diagram showing that a link set at a certain reference node according to an embodiment of the present invention remains as a constraint even when another node is set as a reference node.
FIG. 10 is a diagram showing a state when an assignment change instruction is issued according to an embodiment of the present invention.
FIG. 11 is a diagram showing an example in which priorities are set in a communication distance space according to an embodiment of the present invention.
FIG. 12 is a conceptual diagram showing a state where the display is switched to another communication distance space in a situation where the priority is set according to the embodiment of the present invention.
FIG. 13 is a conceptual diagram showing a situation when an assignment change instruction is issued according to an embodiment of the present invention.
FIG. 14 is a block diagram illustrating a configuration of a resource allocation visualization unit according to an embodiment of the present invention.
FIG. 15 is a flowchart illustrating an operation of a resource allocation visualization unit according to an embodiment of the present invention.
FIG. 16 is a conceptual diagram showing a prepared state of a set S according to an embodiment of the present invention.
FIG. 17 is a conceptual diagram illustrating a state in which a terminal is removed from a set S according to an embodiment of the present invention, and the terminal is used as a root of a tree.
FIG. 18 is a diagram conceptually illustrating a state in which all terminals adjacent to a terminal arranged at a leaf of a current tree are selected from a set S according to an embodiment of the present invention, and these are set to S ′.
FIG. 19 is a diagram conceptually illustrating an example of an operation of a resource allocation visualization unit according to an embodiment of the present invention.
FIG. 20 is a diagram conceptually illustrating an example of an operation of a resource allocation visualization unit according to an embodiment of the present invention.
FIG. 21 is a diagram conceptually illustrating an example of an operation of a resource allocation visualization unit according to an embodiment of the present invention.
FIG. 22 is a flowchart illustrating an operation of a resource allocation visualization unit according to an embodiment of the present invention.
FIG. 23 is a diagram conceptually illustrating an example of an operation of a resource allocation visualization unit according to an embodiment of the present invention.
FIG. 24 is a flowchart illustrating an operation of a resource allocation visualization unit according to an embodiment of the present invention.
FIG. 25 is a diagram conceptually illustrating an example of a screen displayed on a resource allocation visualization unit according to an embodiment of the present invention.
FIG. 26 is a diagram conceptually illustrating an example of a screen displayed on a resource allocation visualization unit according to an embodiment of the present invention.
FIG. 27 is a diagram conceptually illustrating an example of a screen displayed on a resource allocation visualization unit according to an embodiment of the present invention.
FIG. 28 is a diagram conceptually illustrating an example of a screen displayed on the resource allocation visualization unit according to an embodiment of the present invention.
[Explanation of symbols]
101 Resource Allocation Visualization Unit
102 Resource allocation change instruction section
103 Resource allocation change unit
104 Resource allocation status storage unit
105 Resource allocation constraint setting unit
106 Resource Allocation Constraint Storage Unit
107 server process
108 Client process
201 Relevance calculator
202 Connection Relationship Management Unit
203 Relevance display

Claims (8)

First storage means for storing communication resource allocation information between terminals included in the communication network ;
Second storage means for storing the communication resource allocation constraint information ;
Resource allocation status visualization means for visualizing the allocation status of the communication resources allocated between terminals included in the communication network by the distance between terminals,
Means for instructing the policy of the communication resource allocation by a distance change operation between terminals to make the distance between any terminals visualized by the resource allocation status visualization means or to move away ,
According to an instruction of the communication resource allocation policy by a distance change operation between terminals, communication between the terminals is performed by referring to communication resource allocation information in the first storage means and constraint information in the second storage means. A resource allocation changing means for changing resource allocation, and thereafter returning the communication resource allocation to the state before the change. A display device for displaying a first terminal, a second terminal, and the third terminal connected to a communication network,
Storage means for storing communication resource allocation information allocated between two terminals among the first to third terminals;
A distance between the first terminal and the second terminal and a distance between the first terminal and the third terminal are determined according to the communication resource allocation information stored in the storage unit. Means,
Means for displaying the first terminal and the second terminal, and the first terminal and the third terminal separated by the determined distance and connected by a line segment,
Means for instructing a policy of allocating the communication resources by a distance changing operation between terminals that moves closer or farther from the first terminal to third terminal;
Re-allocating communication resources among the first to third terminals by referring to the communication resource allocation information in the storage means in accordance with an instruction of the communication resource allocation policy by a distance changing operation between terminals; Means for changing the determined distance between the first terminal and the second terminal and the determined distance between the first terminal and the third terminal;
Means for displaying the first terminal and the second terminal, and the first terminal and the third terminal separated by the changed distance and connected by a line segment, respectively;
A display device comprising: Storing, in a first storage means, allocation information of communication resources between terminals included in the communication network ;
Storing the constraint information of the communication resource allocation in a second storage unit;
Visualizing the allocation status of the communication resources allocated between the terminals included in the communication network by the distance between the terminals,
Instructing the policy of the communication resource allocation by a distance change operation between the terminals closer or farther from the visualized arbitrary terminal,
According to an instruction of the communication resource allocation policy by a distance change operation between terminals, communication between the terminals is performed by referring to communication resource allocation information in the first storage means and constraint information in the second storage means. Changing the resource allocation, and then returning the communication resource allocation to the state before the change;
A resource allocation method comprising: A display method for displaying a first terminal, a second terminal, and the third terminal connected to a communication network on a display device,
Storing, in a storage unit, allocation information of communication resources allocated to the first to third terminals;
A distance between the first terminal and the second terminal and a distance between the first terminal and the third terminal are determined according to the communication resource allocation information stored in the storage unit. Steps and
The first terminal and the second terminal and the first terminal and the third terminal are respectively determined by the determined terminal. Separated by a distance, connected by a line segment and displayed on the display device,
Instructing a policy of allocating the communication resources by a distance changing operation between the terminals to make the distance between the first to third terminals closer or farther;
By instructing the communication resource allocation policy by the distance changing operation between the terminals, referring to the communication resource allocation information in the storage unit, the communication resources are reallocated to the first to third terminals. Changing the determined distance between the first terminal and the second terminal and the determined distance between the first terminal and the third terminal;
Displaying the first terminal and the second terminal and the first terminal and the third terminal on the display device by separating them by the changed distance and connecting them with a line segment, respectively;
A display method comprising: 5. The display method according to claim 4, wherein
A display method characterized by moving another terminal, the communication resource of which has been changed by a moving operation of a specific terminal among the first to third terminals. The display method according to claim 5, wherein
A display method, wherein when the first terminal is moved closer to the second terminal, the position of the third terminal is moved so as to move the third terminal away from the second terminal. Computer
First storage means for storing communication resource allocation information between terminals included in the communication network;
Second storage means for storing the communication resource allocation constraint information;
Resource allocation status visualization means for visualizing the allocation status of the communication resources allocated between the terminals included in the communication network by the distance between the terminals,
Means for instructing a policy of allocating the communication resources by a distance change operation between terminals that brings closer or distances any terminal visualized by the resource allocation status visualization means,
The communication between the terminals is performed by referring to the communication resource allocation information in the first storage unit and the constraint information in the second storage unit in accordance with the instruction of the communication resource allocation policy by the distance changing operation between the terminals. Resource allocation changing means for changing the allocation of resources and thereafter returning the communication resource allocation to the state before the change
A recording medium that stores a program that functions as a computer. In a program that causes a computer that displays a first terminal, a second terminal, and the third terminal connected to a communication network to execute processing,
Said computer,
Storage means for storing communication resource allocation information allocated to the first to third terminals;
A distance between the first terminal and the second terminal and a distance between the first terminal and the third terminal are determined according to the communication resource allocation information stored in the storage unit. Means,
Means for displaying the first terminal and the second terminal, and the first terminal and the third terminal separated by the determined distance and connected by a line segment,
Means for instructing a policy of allocating the communication resources by a distance changing operation between terminals that moves closer or farther from the first terminal to third terminal;
By instructing the communication resource allocation policy by the distance changing operation between the terminals, referring to the communication resource allocation information in the storage unit, the communication resources are reallocated to the first to third terminals. Means for changing the determined distance between the first terminal and the second terminal and the determined distance between the first terminal and the third terminal;
Means for displaying the first terminal and the second terminal, and the first terminal and the third terminal separated by the changed distance and connected by a line segment
A recording medium that stores a program that functions as a computer.

Images