Performance of wireless mesh networks can be greatly improved by spatial reuse （SR）, therefore, lots of algorithms have been proposed to maximize the number of concurrent transmis- sions. However, most methods only ...Performance of wireless mesh networks can be greatly improved by spatial reuse （SR）, therefore, lots of algorithms have been proposed to maximize the number of concurrent transmis- sions. However, most methods only considered the interference brought by the sender nodes. In this paper, we study the interfer- ence model in WiMAX mesh networks and propose a minimal SR-pair interference model to perform concurrent transmissions in both uplink and downlink directions. Simulation results show that our model is more efficient and stable, i.e., it increases the number of concurrent transmissions and its performance is constant and independent of transmission directions.展开更多
This paper proposes a new switching scheme of switch fabric, which is named Multicast-enabled Protocol Agnostic Forwarding Engine (M-PAFE). M-PAFE is a central scheduling crossbar-based switch fabric with embedded Com...This paper proposes a new switching scheme of switch fabric, which is named Multicast-enabled Protocol Agnostic Forwarding Engine (M-PAFE). M-PAFE is a central scheduling crossbar-based switch fabric with embedded Combined Input and Output Queue from the queuing view. An extra switching path is dedicated for multicast cell processing in M-PAFE. And the simulation results are provided to evaluate the performance of M-PAFE in comparison with ESLIP, which is a well-known algorithm implemented in Cisco 12000 routers.展开更多
It is desirable in a distributed system to have the system load balanced evenly among the nodes so that the mean job response time is minimized. In this paper, we present.a dynamic load balancing mechanism (DLB). It a...It is desirable in a distributed system to have the system load balanced evenly among the nodes so that the mean job response time is minimized. In this paper, we present.a dynamic load balancing mechanism (DLB). It adopts a centralized approach and is network topology independent. The DLB mechanism employs a set of thresholds which are automatically adjusted as the system load changes. lt also provides a simple mechanism for the system to switch between periodic and instantaneous load balancing policies with ease. The performance of the proposed algorithm is evaluated by intensive simulations for various parameters. The simulAtion results show that the mean job response time in a system implementing DLB algorithm is significantly lower than the same system without load balancings. Furthermore, compared with a previously proposed algorithm, DLB algorithm demonstrates improved performance, especially when the system is heavily loaded and the load is unevenly distributed.展开更多
基金Supported by the National Natural Science Foundation of China (60672051)
文摘Performance of wireless mesh networks can be greatly improved by spatial reuse （SR）, therefore, lots of algorithms have been proposed to maximize the number of concurrent transmis- sions. However, most methods only considered the interference brought by the sender nodes. In this paper, we study the interfer- ence model in WiMAX mesh networks and propose a minimal SR-pair interference model to perform concurrent transmissions in both uplink and downlink directions. Simulation results show that our model is more efficient and stable, i.e., it increases the number of concurrent transmissions and its performance is constant and independent of transmission directions.
文摘This paper proposes a new switching scheme of switch fabric, which is named Multicast-enabled Protocol Agnostic Forwarding Engine (M-PAFE). M-PAFE is a central scheduling crossbar-based switch fabric with embedded Combined Input and Output Queue from the queuing view. An extra switching path is dedicated for multicast cell processing in M-PAFE. And the simulation results are provided to evaluate the performance of M-PAFE in comparison with ESLIP, which is a well-known algorithm implemented in Cisco 12000 routers.
文摘It is desirable in a distributed system to have the system load balanced evenly among the nodes so that the mean job response time is minimized. In this paper, we present.a dynamic load balancing mechanism (DLB). It adopts a centralized approach and is network topology independent. The DLB mechanism employs a set of thresholds which are automatically adjusted as the system load changes. lt also provides a simple mechanism for the system to switch between periodic and instantaneous load balancing policies with ease. The performance of the proposed algorithm is evaluated by intensive simulations for various parameters. The simulAtion results show that the mean job response time in a system implementing DLB algorithm is significantly lower than the same system without load balancings. Furthermore, compared with a previously proposed algorithm, DLB algorithm demonstrates improved performance, especially when the system is heavily loaded and the load is unevenly distributed.
