Dividing method for topological design of corporate communication networks
This paper proposes a topological design algorithm for a corporate communication network. The algorithm is more efficient than the traditional heuristic algorithms. In our method we subdivide the overall nodes. We then use branching for a batch of nodes so divided and bounding by traffic and product...
Gespeichert in:
| Veröffentlicht in: | Electronics & communications in Japan. Part 1, Communications Communications, 1992, Vol.75 (8), p.54-63 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 63 |
|---|---|
| container_issue | 8 |
| container_start_page | 54 |
| container_title | Electronics & communications in Japan. Part 1, Communications |
| container_volume | 75 |
| creator | Ohmae, Yoshitsugu Watanabe, Atsushi Takeshita, Miyuki |
| description | This paper proposes a topological design algorithm for a corporate communication network. The algorithm is more efficient than the traditional heuristic algorithms. In our method we subdivide the overall nodes. We then use branching for a batch of nodes so divided and bounding by traffic and product of traffic and channel distance. We repeat the above procedure until the final desired topological configuration is attained. |
| doi_str_mv | 10.1002/ecja.4410750805 |
| format | Article |
| fullrecord | <record><control><sourceid>wiley_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1002_ecja_4410750805</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>ECJA4410750805</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2645-a436a4b811478021f76904b018db2e82fafbf6b21975be9e425020ff4f89179a3</originalsourceid><addsrcrecordid>eNqFkDtPwzAUhS0EEqUws-YPpL12_EjEVAoUqqoM5SUWy0ns4jaJKztQ-u9pVQRiYrpHuuc7w4fQOYYeBiB9XSxUj1IMgkEK7AB1MCMQc0roIeqkgvGYc4KP0UkICwDIOMMdNL6yH7a0zTyqdfvmysg4H7Vu5So3t4WqolIHO28iZ6LC-ZXzqtXbVNfvzfbdWtdEjW7Xzi_DKToyqgr67Pt20ePN9cPwNp7cj-6Gg0lcEE5ZrGjCFc1TjKlIgWAjeAY0B5yWOdEpMcrkhucEZ4LlOtOUMCBgDDVphkWmki7q73cL70Lw2siVt7XyG4lB7lTInQr5q2JLXOyJta305r-6vB6OB3_oeE_b0OrPH1r5peQiEUw-T0fy8mX6imfiSc6SL39Pc0I</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Dividing method for topological design of corporate communication networks</title><source>Business Source Complete</source><creator>Ohmae, Yoshitsugu ; Watanabe, Atsushi ; Takeshita, Miyuki</creator><creatorcontrib>Ohmae, Yoshitsugu ; Watanabe, Atsushi ; Takeshita, Miyuki</creatorcontrib><description>This paper proposes a topological design algorithm for a corporate communication network. The algorithm is more efficient than the traditional heuristic algorithms. In our method we subdivide the overall nodes. We then use branching for a batch of nodes so divided and bounding by traffic and product of traffic and channel distance. We repeat the above procedure until the final desired topological configuration is attained.</description><identifier>ISSN: 8756-6621</identifier><identifier>EISSN: 1520-6424</identifier><identifier>DOI: 10.1002/ecja.4410750805</identifier><language>eng</language><publisher>New York: Wiley Subscription Services, Inc., A Wiley Company</publisher><subject>Branch-and-bound technique ; computational quantity ; corporate communication network ; discrete capacity ; dividing method ; economical network design ; topological design</subject><ispartof>Electronics & communications in Japan. Part 1, Communications, 1992, Vol.75 (8), p.54-63</ispartof><rights>Copyright © 1992 Wiley Periodicals, Inc., A Wiley Company</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c2645-a436a4b811478021f76904b018db2e82fafbf6b21975be9e425020ff4f89179a3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,4010,27900,27901,27902</link.rule.ids></links><search><creatorcontrib>Ohmae, Yoshitsugu</creatorcontrib><creatorcontrib>Watanabe, Atsushi</creatorcontrib><creatorcontrib>Takeshita, Miyuki</creatorcontrib><title>Dividing method for topological design of corporate communication networks</title><title>Electronics & communications in Japan. Part 1, Communications</title><addtitle>Electron. Comm. Jpn. Pt. I</addtitle><description>This paper proposes a topological design algorithm for a corporate communication network. The algorithm is more efficient than the traditional heuristic algorithms. In our method we subdivide the overall nodes. We then use branching for a batch of nodes so divided and bounding by traffic and product of traffic and channel distance. We repeat the above procedure until the final desired topological configuration is attained.</description><subject>Branch-and-bound technique</subject><subject>computational quantity</subject><subject>corporate communication network</subject><subject>discrete capacity</subject><subject>dividing method</subject><subject>economical network design</subject><subject>topological design</subject><issn>8756-6621</issn><issn>1520-6424</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1992</creationdate><recordtype>article</recordtype><recordid>eNqFkDtPwzAUhS0EEqUws-YPpL12_EjEVAoUqqoM5SUWy0ns4jaJKztQ-u9pVQRiYrpHuuc7w4fQOYYeBiB9XSxUj1IMgkEK7AB1MCMQc0roIeqkgvGYc4KP0UkICwDIOMMdNL6yH7a0zTyqdfvmysg4H7Vu5So3t4WqolIHO28iZ6LC-ZXzqtXbVNfvzfbdWtdEjW7Xzi_DKToyqgr67Pt20ePN9cPwNp7cj-6Gg0lcEE5ZrGjCFc1TjKlIgWAjeAY0B5yWOdEpMcrkhucEZ4LlOtOUMCBgDDVphkWmki7q73cL70Lw2siVt7XyG4lB7lTInQr5q2JLXOyJta305r-6vB6OB3_oeE_b0OrPH1r5peQiEUw-T0fy8mX6imfiSc6SL39Pc0I</recordid><startdate>1992</startdate><enddate>1992</enddate><creator>Ohmae, Yoshitsugu</creator><creator>Watanabe, Atsushi</creator><creator>Takeshita, Miyuki</creator><general>Wiley Subscription Services, Inc., A Wiley Company</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>1992</creationdate><title>Dividing method for topological design of corporate communication networks</title><author>Ohmae, Yoshitsugu ; Watanabe, Atsushi ; Takeshita, Miyuki</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2645-a436a4b811478021f76904b018db2e82fafbf6b21975be9e425020ff4f89179a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1992</creationdate><topic>Branch-and-bound technique</topic><topic>computational quantity</topic><topic>corporate communication network</topic><topic>discrete capacity</topic><topic>dividing method</topic><topic>economical network design</topic><topic>topological design</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ohmae, Yoshitsugu</creatorcontrib><creatorcontrib>Watanabe, Atsushi</creatorcontrib><creatorcontrib>Takeshita, Miyuki</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><jtitle>Electronics & communications in Japan. Part 1, Communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ohmae, Yoshitsugu</au><au>Watanabe, Atsushi</au><au>Takeshita, Miyuki</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Dividing method for topological design of corporate communication networks</atitle><jtitle>Electronics & communications in Japan. Part 1, Communications</jtitle><addtitle>Electron. Comm. Jpn. Pt. I</addtitle><date>1992</date><risdate>1992</risdate><volume>75</volume><issue>8</issue><spage>54</spage><epage>63</epage><pages>54-63</pages><issn>8756-6621</issn><eissn>1520-6424</eissn><abstract>This paper proposes a topological design algorithm for a corporate communication network. The algorithm is more efficient than the traditional heuristic algorithms. In our method we subdivide the overall nodes. We then use branching for a batch of nodes so divided and bounding by traffic and product of traffic and channel distance. We repeat the above procedure until the final desired topological configuration is attained.</abstract><cop>New York</cop><pub>Wiley Subscription Services, Inc., A Wiley Company</pub><doi>10.1002/ecja.4410750805</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 8756-6621 |
| ispartof | Electronics & communications in Japan. Part 1, Communications, 1992, Vol.75 (8), p.54-63 |
| issn | 8756-6621 1520-6424 |
| language | eng |
| recordid | cdi_crossref_primary_10_1002_ecja_4410750805 |
| source | Business Source Complete |
| subjects | Branch-and-bound technique computational quantity corporate communication network discrete capacity dividing method economical network design topological design |
| title | Dividing method for topological design of corporate communication networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T15%3A57%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-wiley_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Dividing%20method%20for%20topological%20design%20of%20corporate%20communication%20networks&rft.jtitle=Electronics%20&%20communications%20in%20Japan.%20Part%201,%20Communications&rft.au=Ohmae,%20Yoshitsugu&rft.date=1992&rft.volume=75&rft.issue=8&rft.spage=54&rft.epage=63&rft.pages=54-63&rft.issn=8756-6621&rft.eissn=1520-6424&rft_id=info:doi/10.1002/ecja.4410750805&rft_dat=%3Cwiley_cross%3EECJA4410750805%3C/wiley_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |