7 research outputs found
Recommended from our members
Interconnection Networks Based on Gaussian and Eisenstein-Jacobi Integers
Quotient rings of Gaussian and Eisenstein-Jacobi(EJ) integers can be deployed to construct interconnection networks with good topological properties. In this thesis, we propose deadlock-free deterministic and partially adaptive routing algorithms for hexagonal networks, one special class of EJ networks. Then we discuss higher dimensional Gaussian networks as an alternative to classical multidimensional toroidal networks. For this topology, we explore many properties including distance distribution and the decomposition of higher dimensional Gaussian net works into Hamiltonian cycles. In addition, we propose some efficient communication algorithms for higher dimensional Gaussian networks including one-to-all broadcasting and shortest path routing. Simulation results show that the routing algorithm proposed for higher dimensional Gaussian networks outperforms the routing algorithm of the corresponding torus networks with approximately the same number of nodes. These simulation results are expected since higher dimensional Gaussian networks have a smaller diameter and a smaller average message latency as compared with toroidal networks.
Finally, we introduce a degree-three interconnection network obtained from pruning a Gaussian network. This network shows possible performance improvement over other degree-three networks since it has a smaller diameter compared to other degree-three networks. Many topological properties of degree-three pruned Gaussian network are explored. In addition, an optimal shortest path routing algorithm and a one-to-all broadcasting algorithm are given
Collection of abstracts of the 24th European Workshop on Computational Geometry
International audienceThe 24th European Workshop on Computational Geomety (EuroCG'08) was held at INRIA Nancy - Grand Est & LORIA on March 18-20, 2008. The present collection of abstracts contains the 63 scientific contributions as well as three invited talks presented at the workshop
LIPIcs, Volume 258, SoCG 2023, Complete Volume
LIPIcs, Volume 258, SoCG 2023, Complete Volum
International Congress of Mathematicians: 2022 July 6–14: Proceedings of the ICM 2022
Following the long and illustrious tradition of the International Congress of Mathematicians, these proceedings include contributions based on the invited talks that were presented at the Congress in 2022.
Published with the support of the International Mathematical Union and edited by Dmitry Beliaev and Stanislav Smirnov, these seven volumes present the most important developments in all fields of mathematics and its applications in the past four years. In particular, they include laudations and presentations of the 2022 Fields Medal winners and of the other prestigious prizes awarded at the Congress.
The proceedings of the International Congress of Mathematicians provide an authoritative documentation of contemporary research in all branches of mathematics, and are an indispensable part of every mathematical library
Efficient Passive Clustering and Gateways selection MANETs
Passive clustering does not employ control packets to collect topological information in ad hoc networks. In our proposal, we avoid making frequent changes in cluster architecture due to repeated election and re-election of cluster heads and gateways. Our primary objective has been to make Passive Clustering more practical by employing optimal number of gateways and reduce the number of rebroadcast packets
Hexagonal and pruned torus networks as Cayley graphs
Hexagonal mesh and torus, as well as honeycomb and certain other pruned torus networks, are known to belong to the class of Cayley graphs which are node-symmetric and possess other interesting mathematical properties. In this paper, we use Cayley-graph formulations for the aforementioned networks, along with some of our previous results on subgraphs and coset graphs, to draw conclusions relating to internode distance and network diameter. We also use our results to refine, clarify, and unify a number of previously published properties for these networks and other networks derived from them. Keywords – Cayley digraph, Coset graph, Diameter, Distributed system, Hex mesh, Homomorphism