11,064 research outputs found

    An Energy-Efficient Reconfigurable Circuit Switched Network-on-Chip

    Get PDF
    Network-on-Chip (NoC) is an energy-efficient on-chip communication architecture for multi-tile System-on-Chip (SoC) architectures. The SoC architecture, including its run-time software, can replace inflexible ASICs for future ambient systems. These ambient systems have to be flexible as well as energy-efficient. To find an energy-efficient solution for the communication network we analyze three wireless applications. Based on their communication requirements we observe that revisiting of the circuit switching techniques is beneficial. In this paper we propose a new energy-efficient reconfigurable circuit-switched Network-on-Chip. By physically separating the concurrent data streams we reduce the overall energy consumption. The circuit-switched router has been synthesized and analyzed for its power consumption in 0.13 ¿m technology. A 5-port circuit-switched router has an area of 0.05 mm2 and runs at 1075 MHz. The proposed architecture consumes 3.5 times less energy compared to its packet-switched equivalen

    Active Queue Management for Fair Resource Allocation in Wireless Networks

    Get PDF
    This paper investigates the interaction between end-to-end flow control and MAC-layer scheduling on wireless links. We consider a wireless network with multiple users receiving information from a common access point; each user suffers fading, and a scheduler allocates the channel based on channel quality,but subject to fairness and latency considerations. We show that the fairness property of the scheduler is compromised by the transport layer flow control of TCP New Reno. We provide a receiver-side control algorithm, CLAMP, that remedies this situation. CLAMP works at a receiver to control a TCP sender by setting the TCP receiver's advertised window limit, and this allows the scheduler to allocate bandwidth fairly between the users

    TCP smart framing: a segmentation algorithm to reduce TCP latency

    Get PDF
    TCP Smart Framing, or TCP-SF for short, enables the Fast Retransmit/Recovery algorithms even when the congestion window is small. Without modifying the TCP congestion control based on the additive-increase/multiplicative-decrease paradigm, TCP-SF adopts a novel segmentation algorithm: while Classic TCP always tries to send full-sized segments, a TCP-SF source adopts a more flexible segmentation algorithm to try and always have a number of in-flight segments larger than 3 so as to enable Fast Recovery. We motivate this choice by real traffic measurements, which indicate that today's traffic is populated by short-lived flows, whose only means to recover from a packet loss is by triggering a Retransmission Timeout. The key idea of TCP-SF can be implemented on top of any TCP flavor, from Tahoe to SACK, and requires modifications to the server TCP stack only, and can be easily coupled with recent TCP enhancements. The performance of the proposed TCP modification were studied by means of simulations, live measurements and an analytical model. In addition, the analytical model we have devised has a general scope, making it a valid tool for TCP performance evaluation in the small window region. Improvements are remarkable under several buffer management schemes, and maximized by byte-oriented schemes

    Real-time characteristics of switched ethernet for "1553B" -embedded applications : simulation and analysis

    Get PDF
    In our previous work , Full Duplex Switched Ethernet was put forward as an attractive candidate to replace the MIL-STD 1553B data bus, in next generation "1553B"-embedded applications. An analytic study was conducted, using the Network Calculus formalism, to evaluate the deterministic guarantees offered by our proposal. Obtained results showed the effectiveness of traffic shaping techniques, combined with priority handling mechanisms on Full Duplex Switched Ethernet in order to satisfy 1553B-like real-time constraints. In this paper, we extend this work by the use of simulation. This gives the possibility to capture additional characteristics of the proposed architecture with respect to the analytical study, which was basically used to evaluate worst cases and deterministic guarantees. Hence, to assess the real-time characteristics of our proposed interconnection technology, the results yielded by simulation are discussed and average latencies distributions are considered

    An energy-efficient distributed dynamic bandwidth allocation algorithm for Passive Optical Access Networks

    Get PDF
    The rapid deployment of passive optical access networks (PONs) increases the global energy consumption of networking infrastructure. This paper focuses on the minimization of energy consumption in Ethernet PONs (EPONs). We present an energy-efficient, distributed dynamic bandwidth allocation (DBA) algorithm able to power off the transmitter and receiver of an optical network unit (ONU) when there is no upstream or downstream traffic. Our main contribution is combining the advantages of a distributed DBA (namely, a smaller packet delay compared to centralized DBAs, due to less time being needed to allocate the transmission slot) with energy saving features (that come at a price of longer delays due to the longer queue waiting times when transmitters are switched off). The proposed algorithm analyzes the queue size of the ONUs in order to switch them to doze/sleep mode when there is no upstream/downstream traffic in the network, respectively. Our results show that we minimized the ONU energy consumption across a wide range of network loads while keeping delay bounded.Postprint (published version
    corecore