Search
Didn't find any results in this catalog!
But we have some results in other catalogs.Filters
total: 1338
displaying 1000 best results Help
Search results for: MULTICAST CLOS NETWORKS
-
Rearrangeability in multicast Clos networks is NP-complete
PublicationPrzestrajalność w polach Closa z połączeniami jeden do jeden jest problemem wielomianowym. W pracy pokazano, że w polach z połączeniami jeden do wiele problem ten jest NP zupełny.Three-stage elos networks are commutation networks with circuit switching. So far, graph theory has been very useful tool for solving issues related to these networks with unicast connections. This is so because if elos network is represented as a bipartite...
-
Towards the boundary between easy and hard control problems in multicast Clos networks
PublicationIn this article we study 3-stage Clos networks with multicast calls in general and 2-cast calls, in particular. We investigate various sizes of input and output switches and discuss some routing problems involved in blocking states. To express our results in a formal way we introduce a model of hypergraph edge-coloring. A new class of bipartite hypergraphs corresponding to Clos networks is studied. We identify some polynomially...
-
Graph models of clos networks
Publication...
-
A Novel Multicast Architecture of Programmable Networks
PublicationIn the paper a multicast architecture for programmable networks based on separation of group management and network control tasks is proposed. Thanks to this separation, services which want to make use of multicast communications no longer have to implement low-level network functionalities and their operation is greatly simplified. Abstracting service’s view of the network into a fully connected cloud enables us to transparently...
-
A bound on the number of middle-stage crossbars in f-cast rearrangeable Clos networks
PublicationIn 2006 Chen and Hwang gave a necessary and sufficient condition under which a three-stage Clos network is rearrangeable for broadcast connections. Assuming that only crossbars of the first stage have no fan-out property, we give similar conditions for f-cast Clos networks, where f is an arbitrary but fixed invariant of the network. Such assumptions are valid for some practical switching systems, e.g. high-speed crossconnects....
-
Resilience through multicast – An optimization model for multi-hop wireless sensor networks
Publication -
Packet routing and frame length optimization in wireless mesh networks with multicast communications
Publication -
Maximization of multicast periodic traffic throughput in multi-hop wireless networks with broadcast transmissions
Publication -
Rearrangeable clos networks C(n,r_1,n^2-1,n,r_2) with certain restrictions for connections
PublicationW pracy została zaproponowana nowa metoda sprawdzania przestrajalności pól Closa dla połączeń jeden do wiele. W rozważaniach zakładamy grupowanie połączeń.In the article we will propose new method of checking rearrangeability of multicast Clos networks. In the literature there is no precise method for checking rearrangeability. We focused on three-stage Clos networks without any constraints about fan-out capability. We show the...
-
Multicast Traffic Throughput Maximization through Dynamic Modulation and Coding Scheme Assignment in Wireless Sensor Networks
Publication