電気学会 電子図書館
 HOME > 同研究会の論文誌(論文単位) > 文献詳細
Extended Summaryはついていません。

・会員価格 ¥550
・一般価格 ¥770
こちらはBookPark「電気学会 電子図書館(IEEJ Electronic Library)」による文献紹介ページです。
非会員の方はログインの必要はありません。このまま お進みください。
■ページ数 10ページ
■タイトル Flow Diffusion Algorithms for Folded Clos Networks
■タイトル(英語) Flow Diffusion Algorithms for Folded Clos Networks
■著者名 Satoru Ohta (Faculty of Engineering, Toyama Prefectural University)
■著者名(英語) Satoru Ohta (Faculty of Engineering, Toyama Prefectural University)
■価格 会員 ¥550 一般 ¥770
■書籍種類 論文誌(論文単位)
■グループ名 【C】電子・情報・システム部門
■本誌 電気学会論文誌C(電子・情報・システム部門誌) Vol.139 No.11 (2019)特集T:国際会議ICESS 2018 特集U:電気関係学会関西連合大会
■本誌掲載ページ 1224-1233ページ
■原稿種別 論文/英語
■電子版へのリンク https://www.jstage.jst.go.jp/article/ieejeiss/139/11/139_1224/_article/-char/ja/
■キーワード network,algorithm,routing,data center,packet
■要約(英語) The performance of a data center network is a key to provide high quality information services. As a topology for data center networks, a folded Clos network (FCN) is advantageous because it provides high throughput for arbitrary traffic patterns. To maximize the throughput of an FCN, traffic congestion must be avoided. This is achieved by uniformly diffusing flows between links. Thus, this paper investigates two distributed algorithms that nearly uniformly spread flows in FCNs. The first algorithm is executable with information that is locally obtainable at the source of a flow. This method is further divided into two versions. One version may reroute an existing flow for a flow completion, while the other does not perform rerouting. The second algorithm runs with semi-local information, which can be obtained via communication between the source and destination switches. These algorithms are executable in a distributed manner without relying on global information. This means that the processing overhead for these algorithms is small. This paper theoretically derives upper bounds on the number of flows that go through a link when these algorithms are applied. These bounds assure that the load offered on a link does not grow extremely heavy. This paper also evaluates the presented algorithms and conventional random routing for different traffic and network models through computer simulation. The results clearly show the advantage of the presented algorithms.
■版 型 A4
©Contents Works Inc.