DOI: 10.1002/net.3230010406. On non‐blocking switching networks

10.1002/net.3230010406

Crossref journal-article

Wiley

Networks (311)

Abstract

AbstractA switching network may be informally described as a collection of single‐pole, single‐throw switches arranged so as to connect a set of terminals called inputs to another set of terminals called outputs. It is non‐blocking if, given any set of connections from some of the inputs to some of the outputs, and an idle input terminal x and idle output terminal y, then it is possible to connect x to y without disturbing any of the existing connections. Denote by σ(a, b) the minimal number of switches necessary to connect a inputs to b outputs using a non‐blocking network. We are interested in studying the growth of σ(a, a) as a → ∞. Results of C. Clos show that σ(a, a) ⩽ C ae2√log a·log 2. We show that σ(a, a) ⩽ 8a(log2a)2.

Bibliography

Cantor, D. G. (1971). On nonâblocking switching networks. Networks, 1(4), 367â377. Portico.

Authors 1

D. G. Cantor (first)

References 2 Referenced 76

{'key': 'e_1_2_1_2_2', 'volume-title': 'Mathematical Theory of Connecting Networks and Telephone Traffic', 'author': 'Beněs V. E.', 'year': '1965'} / Mathematical Theory of Connecting Networks and Telephone Traffic by Beněs V. E. (1965)
10.1002/j.1538-7305.1953.tb01433.x

Dates

Type	When
Created	18 years, 3 months ago (May 10, 2007, 7:22 p.m.)
Deposited	1 year, 9 months ago (Nov. 11, 2023, 10:35 p.m.)
Indexed	5 months ago (March 22, 2025, 5:01 a.m.)
Issued	54 years, 7 months ago (Jan. 1, 1971)
Published	54 years, 7 months ago (Jan. 1, 1971)
Published Online	18 years, 9 months ago (Nov. 6, 2006)
Published Print	54 years, 7 months ago (Jan. 1, 1971)

Funders 0

None

BibTeX

@article{Cantor_1971, title={On non‐blocking switching networks}, volume={1}, ISSN={1097-0037}, url={http://dx.doi.org/10.1002/net.3230010406}, DOI={10.1002/net.3230010406}, number={4}, journal={Networks}, publisher={Wiley}, author={Cantor, D. G.}, year={1971}, month=jan, pages={367–377} }

JSON

{
  "indexed": {
    "date-parts": [
      [
        2025,
        3,
        22
      ]
    ],
    "date-time": "2025-03-22T09:01:49Z",
    "timestamp": 1742634109253
  },
  "reference-count": 2,
  "publisher": "Wiley",
  "issue": "4",
  "license": [
    {
      "start": {
        "date-parts": [
          [
            2006,
            11,
            6
          ]
        ],
        "date-time": "2006-11-06T00:00:00Z",
        "timestamp": 1162771200000
      },
      "content-version": "vor",
      "delay-in-days": 13093,
      "URL": "http://onlinelibrary.wiley.com/termsAndConditions#vor"
    }
  ],
  "content-domain": {
    "domain": [],
    "crossmark-restriction": false
  },
  "published-print": {
    "date-parts": [
      [
        1971,
        1
      ]
    ]
  },
  "abstract": "<jats:title>Abstract</jats:title><jats:p>A switching network may be informally described as a collection of single\u2010pole, single\u2010throw switches arranged so as to connect a set of terminals called inputs to another set of terminals called outputs. It is non\u2010blocking if, given any set of connections from some of the inputs to some of the outputs, and an idle input terminal x and idle output terminal y, then it is possible to connect x to y without disturbing any of the existing connections. Denote by \u03c3(a, b) the minimal number of switches necessary to connect a inputs to b outputs using a non\u2010blocking network. We are interested in studying the growth of \u03c3(a, a) as a \u2192 \u221e. Results of C. Clos show that \u03c3(a, a) \u2a7d C ae<jats:sup>2\u221alog a\u00b7log 2</jats:sup>. We show that \u03c3(a, a) \u2a7d 8a(log<jats:sub>2</jats:sub>a)<jats:sup>2</jats:sup>.</jats:p>",
  "DOI": "10.1002/net.3230010406",
  "type": "journal-article",
  "created": {
    "date-parts": [
      [
        2007,
        5,
        10
      ]
    ],
    "date-time": "2007-05-10T23:22:19Z",
    "timestamp": 1178839339000
  },
  "page": "367-377",
  "source": "Crossref",
  "is-referenced-by-count": 76,
  "title": "On non\u2010blocking switching networks",
  "prefix": "10.1002",
  "volume": "1",
  "author": [
    {
      "given": "D. G.",
      "family": "Cantor",
      "sequence": "first",
      "affiliation": []
    }
  ],
  "member": "311",
  "published-online": {
    "date-parts": [
      [
        2006,
        11,
        6
      ]
    ]
  },
  "reference": [
    {
      "key": "e_1_2_1_2_2",
      "volume-title": "Mathematical Theory of Connecting Networks and Telephone Traffic",
      "author": "Ben\u011bs V. E.",
      "year": "1965"
    },
    {
      "key": "e_1_2_1_3_2",
      "doi-asserted-by": "publisher",
      "DOI": "10.1002/j.1538-7305.1953.tb01433.x"
    }
  ],
  "container-title": "Networks",
  "original-title": [],
  "language": "en",
  "link": [
    {
      "URL": "https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fnet.3230010406",
      "content-type": "unspecified",
      "content-version": "vor",
      "intended-application": "text-mining"
    },
    {
      "URL": "https://onlinelibrary.wiley.com/doi/pdf/10.1002/net.3230010406",
      "content-type": "unspecified",
      "content-version": "vor",
      "intended-application": "similarity-checking"
    }
  ],
  "deposited": {
    "date-parts": [
      [
        2023,
        11,
        12
      ]
    ],
    "date-time": "2023-11-12T03:35:00Z",
    "timestamp": 1699760100000
  },
  "score": 1,
  "resource": {
    "primary": {
      "URL": "https://onlinelibrary.wiley.com/doi/10.1002/net.3230010406"
    }
  },
  "subtitle": [],
  "short-title": [],
  "issued": {
    "date-parts": [
      [
        1971,
        1
      ]
    ]
  },
  "references-count": 2,
  "journal-issue": {
    "issue": "4",
    "published-print": {
      "date-parts": [
        [
          1971,
          1
        ]
      ]
    }
  },
  "alternative-id": [
    "10.1002/net.3230010406"
  ],
  "URL": "http://dx.doi.org/10.1002/net.3230010406",
  "relation": {},
  "ISSN": [
    "0028-3045",
    "1097-0037"
  ],
  "subject": [],
  "container-title-short": "Networks",
  "published": {
    "date-parts": [
      [
        1971,
        1
      ]
    ]
  }
}