The Experts below are selected from a list of 22548 Experts worldwide ranked by ideXlab platform

Tiente Hsiao - One of the best experts on this subject based on the ideXlab platform.

  • the k degree cayley graph and its topological properties
    Networks, 2006
    Co-Authors: Sunyuan Hsieh, Tiente Hsiao
    Abstract:

    This article introduces a new family of Cayley graphs, called k-degree Cayley graphs, for building interconnection networks. The k-degree Cayley graph possesses many valuable topological properties, such as regularity with degree k, logarithmic diameter, and maximal fault tolerance. We present an optimal shortest Path Routing Algorithm for the k-degree Cayley graph. Cycle-embedding and clique-embedding are also discussed. © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 47(1), 26–36 2006

  • the k degree cayley graph and its topological properties
    Networks, 2006
    Co-Authors: Sunyuan Hsieh, Tiente Hsiao
    Abstract:

    This article introduces a new family of Cayley graphs, called k-degree Cayley graphs, for building interconnection networks. The k-degree Cayley graph possesses many valuable topological properties, such as regularity with degree k, logarithmic diameter, and maximal fault tolerance. We present an optimal shortest Path Routing Algorithm for the k-degree Cayley graph. Cycle-embedding and clique-embedding are also discussed. © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 47(1), 26–36 2006

  • the k valent graph a new family of cayley graphs for interconnection networks
    International Conference on Parallel Processing, 2004
    Co-Authors: Sunyuan Hsieh, Tiente Hsiao
    Abstract:

    This work introduces a new family of Cayley graphs, named the k-valent graphs, for building interconnection networks. It includes the trivalent Cayley graphs (Vadapalli and Srimani, 1995) as a subclass. These new graphs are shown to be regular with the node-degree k, to have logarithmic diameter subject to the number of nodes, and to be k-connected as well as maximally fault tolerant. We also propose a shortest Path Routing Algorithm and investigate some algebraic properties like cycles or cliques embedding.

  • the k valent graph a new family of cayley graphs for interconnection
    International Conference on Parallel Processing, 2004
    Co-Authors: Sunyuan Hsieh, Tiente Hsiao
    Abstract:

    This paper introduces a new family of Cayley graphs, named the k-valent graphs, for building interconnection networks. It includes the trivalent Cayley graphs (Vadapalli and Srimani, 1995) as a subclass. These new graphs are shown to be regular with the node-degree k, to have logarithmic diameter subject to the number of nodes, and to be k-connected as well as maximally fault tolerant. We also propose a shortest Path Routing Algorithm and investigate some algebraic properties like cycles or cliques embedding.

Biswanath Mukherjee - One of the best experts on this subject based on the ideXlab platform.

  • a novel delay aware Routing Algorithm dara for a hybrid wireless optical broadband access network woban
    IEEE Network, 2008
    Co-Authors: S Sarkar, Honghsu Yen, Sudhir Dixit, Biswanath Mukherjee
    Abstract:

    A hybrid wireless-optical broadband access network (WOBAN) is a promising architecture for future access networks. Recently, the WOBAN has been gaining increasing attention, and early versions are being deployed as municipal access solutions. This architecture saves on network deployment cost because fiber need not penetrate to each end user. However, a major research opportunity exists in developing an efficient Routing Algorithm for the wireless front-end of the WOBAN. We propose and investigate the characteristics of the delay-aware Routing Algorithm (DARA) that minimizes the average packet delay in the wireless front-end of a WOBAN. In DARA we model wireless routers as queues and predict wireless link states periodically. Our performance studies show that DARA achieves less delay and congestion, and improved load balancing compared to traditional approaches such as the minimum-hop Routing Algorithm, shortest-Path Routing Algorithm, and predictive throughput Routing Algorithm.

  • dara delay aware Routing Algorithm in a hybrid wireless optical broadband access network woban
    International Conference on Communications, 2007
    Co-Authors: S Sarkar, Honghsu Yen, Sudhir Dixit, Biswanath Mukherjee
    Abstract:

    Hybrid wireless-optical broadband access network (WOBAN) is a promising architecture for future network operations. Recently, the wireless part of WOBAN has been gaining increasing attention and early versions are being deployed as a municipal access solution to eliminate the wired backhaul to every wireless router. This architecture saves on network deployment costs because fiber (or wiring) does not need to extend to the end user, and it extends the reach of emerging optical access solutions, e.g., passive optical network (PON)-based access solutions. However, a major research opportunity exists in developing an efficient Routing Algorithm for the wireless front end of WOBAN. We propose and investigate the characteristics of "delay- aware Routing Algorithm (DARA)" that minimizes the average packet delay in the wireless front end of a WOBAN. We model wireless routers as queues and predict wireless link states periodically. Our simulation experiments show that DARA achieves better load balancing and less congestion compared to tradional approaches such as minimum-hop Routing Algorithm (MHRA) and shortest- Path Routing Algorithm (SPRA). In addition to minimizing the delay, DARA also improves the average hop count compared to the predictive throughput Routing Algorithm (PTRA), a popular protocol used in several deployments for the wireless front end of a WOBAN.

Sunyuan Hsieh - One of the best experts on this subject based on the ideXlab platform.

  • the k degree cayley graph and its topological properties
    Networks, 2006
    Co-Authors: Sunyuan Hsieh, Tiente Hsiao
    Abstract:

    This article introduces a new family of Cayley graphs, called k-degree Cayley graphs, for building interconnection networks. The k-degree Cayley graph possesses many valuable topological properties, such as regularity with degree k, logarithmic diameter, and maximal fault tolerance. We present an optimal shortest Path Routing Algorithm for the k-degree Cayley graph. Cycle-embedding and clique-embedding are also discussed. © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 47(1), 26–36 2006

  • the k degree cayley graph and its topological properties
    Networks, 2006
    Co-Authors: Sunyuan Hsieh, Tiente Hsiao
    Abstract:

    This article introduces a new family of Cayley graphs, called k-degree Cayley graphs, for building interconnection networks. The k-degree Cayley graph possesses many valuable topological properties, such as regularity with degree k, logarithmic diameter, and maximal fault tolerance. We present an optimal shortest Path Routing Algorithm for the k-degree Cayley graph. Cycle-embedding and clique-embedding are also discussed. © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 47(1), 26–36 2006

  • the k valent graph a new family of cayley graphs for interconnection networks
    International Conference on Parallel Processing, 2004
    Co-Authors: Sunyuan Hsieh, Tiente Hsiao
    Abstract:

    This work introduces a new family of Cayley graphs, named the k-valent graphs, for building interconnection networks. It includes the trivalent Cayley graphs (Vadapalli and Srimani, 1995) as a subclass. These new graphs are shown to be regular with the node-degree k, to have logarithmic diameter subject to the number of nodes, and to be k-connected as well as maximally fault tolerant. We also propose a shortest Path Routing Algorithm and investigate some algebraic properties like cycles or cliques embedding.

  • the k valent graph a new family of cayley graphs for interconnection
    International Conference on Parallel Processing, 2004
    Co-Authors: Sunyuan Hsieh, Tiente Hsiao
    Abstract:

    This paper introduces a new family of Cayley graphs, named the k-valent graphs, for building interconnection networks. It includes the trivalent Cayley graphs (Vadapalli and Srimani, 1995) as a subclass. These new graphs are shown to be regular with the node-degree k, to have logarithmic diameter subject to the number of nodes, and to be k-connected as well as maximally fault tolerant. We also propose a shortest Path Routing Algorithm and investigate some algebraic properties like cycles or cliques embedding.

S Sarkar - One of the best experts on this subject based on the ideXlab platform.

  • a novel delay aware Routing Algorithm dara for a hybrid wireless optical broadband access network woban
    IEEE Network, 2008
    Co-Authors: S Sarkar, Honghsu Yen, Sudhir Dixit, Biswanath Mukherjee
    Abstract:

    A hybrid wireless-optical broadband access network (WOBAN) is a promising architecture for future access networks. Recently, the WOBAN has been gaining increasing attention, and early versions are being deployed as municipal access solutions. This architecture saves on network deployment cost because fiber need not penetrate to each end user. However, a major research opportunity exists in developing an efficient Routing Algorithm for the wireless front-end of the WOBAN. We propose and investigate the characteristics of the delay-aware Routing Algorithm (DARA) that minimizes the average packet delay in the wireless front-end of a WOBAN. In DARA we model wireless routers as queues and predict wireless link states periodically. Our performance studies show that DARA achieves less delay and congestion, and improved load balancing compared to traditional approaches such as the minimum-hop Routing Algorithm, shortest-Path Routing Algorithm, and predictive throughput Routing Algorithm.

  • dara delay aware Routing Algorithm in a hybrid wireless optical broadband access network woban
    International Conference on Communications, 2007
    Co-Authors: S Sarkar, Honghsu Yen, Sudhir Dixit, Biswanath Mukherjee
    Abstract:

    Hybrid wireless-optical broadband access network (WOBAN) is a promising architecture for future network operations. Recently, the wireless part of WOBAN has been gaining increasing attention and early versions are being deployed as a municipal access solution to eliminate the wired backhaul to every wireless router. This architecture saves on network deployment costs because fiber (or wiring) does not need to extend to the end user, and it extends the reach of emerging optical access solutions, e.g., passive optical network (PON)-based access solutions. However, a major research opportunity exists in developing an efficient Routing Algorithm for the wireless front end of WOBAN. We propose and investigate the characteristics of "delay- aware Routing Algorithm (DARA)" that minimizes the average packet delay in the wireless front end of a WOBAN. We model wireless routers as queues and predict wireless link states periodically. Our simulation experiments show that DARA achieves better load balancing and less congestion compared to tradional approaches such as minimum-hop Routing Algorithm (MHRA) and shortest- Path Routing Algorithm (SPRA). In addition to minimizing the delay, DARA also improves the average hop count compared to the predictive throughput Routing Algorithm (PTRA), a popular protocol used in several deployments for the wireless front end of a WOBAN.

Shietung Peng - One of the best experts on this subject based on the ideXlab platform.

  • a new node to set disjoint Path Algorithm in perfect hierarchical hypercubes
    The Computer Journal, 2011
    Co-Authors: Antoine Bossard, Keiichi Kaneko, Shietung Peng
    Abstract:

    The perfect hierarchical hypercube (HHC) interconnection network, also known as the cube-connected cube, was introduced as a topology for large parallel computers. One of its interesting properties is that it can connect many nodes while retaining a small diameter and a low degree. The first node-to-set disjoint-Path Routing Algorithm in perfect HHCs was previously introduced by Bossard et al. [(2011) Node-to-Set Disjoint-Path Routing in Perfect Hierarchical Hypercubes. Proc. 11th Int. Conf. Computational Science, Tsukuba, Japan, June 1–3. Elsevier, Amsterdam]. In this paper, we propose a novel solution to the node-to-set disjoint-Path Routing problem in HHC. Inside a (2m + m)-dimensional HHC, we shall describe an Algorithm that can find disjoint Paths between a source node and at most m + 1 destination nodes of maximum length O(2m), significantly shorter than the maximum Path length O(m2m) of Bossard et al. [(2011) Node-to-Set Disjoint-Path Routing in Perfect Hierarchical Hypercubes. Proc. 11th Int. Conf. Computational Science, Tsukuba, Singapore, June 1–3. Elsevier, Amsterdam].

  • a node to set disjoint Path Routing Algorithm in metacube
    International Symposium on Pervasive Systems Algorithms and Networks, 2009
    Co-Authors: Antoine Bossard, Keiichi Kaneko, Shietung Peng
    Abstract:

    The metacube (MC) was introduced as a topology for interconnection networks of large parallel computers, and it has a merit that with a diameter similar to that of the hypercube, its degree is much lower: the 2^{m2^k+k} nodes of a metacube MC(k, m) have a degree of m+k. We introduce in this paper an efficient Routing Algorithm for finding in a metacube MC(k, m) disjoint Paths between one source node and a maximum of m+k target nodes. We show that for any source node s, and any target nodes T = {t_1,..., t_n}, n