Learn More
In network-on-chip (NoC), computing worst-case delay bounds for packet delivery is crucial for designing predictable systems but yet an intractable problem. This paper presents an analysis technique to derive per-flow communication delay bound. Based on a network contention model, this technique, which is topology independent, employs network calculus to(More)
In packet-switched network-on-chip, computing worst-case delay bounds is crucial for designing predictable and costeffective communication systems but yet an intractable problem due to complicated resource sharing scenarios. For wormhole networks with credit-based flow control, the existence of cyclic dependency between flit delivery and credit generation(More)
Barrier coverage is a hot issue in wireless sensor networks for its various applications, such as border surveillance and intrusion detection. In wireless sensor networks, it is a very important problem that how to prolong the network life time. In this paper, we focus on the problem that how to prolong the network lifetime for barrier coverage application.(More)
Active Queue Management (AQM) is a very active research area in networking. The main objective of an AQM mechanism is to provide low delay and low loss service in best-effort service networks. In this paper we propose a new AQM algorithm based on the feedback compensation technique in control theory. The algorithm is called Proportional Integral based(More)
In network-on-chip, computing worst-case delay bound for packet delivery is crucial for designing predictable systems but yet an intractable problem due to complicated resource contention scenarios. In this paper, we present an analysis technique to derive the communication delay bound for individual flows. Based on a network contention model, this(More)
On-chip traffic of many applications exhibits self-similar characteristics. In this paper, we intend to apply network calculus to analyze the delay and backlog bounds for self-similar traffic in networks on chips. We first prove that self-similar traffic can not be constrained by any deterministic arrival curve. Then we prove that self-similar traffic can(More)
In this paper, we propose SAFE (Security Aware FlexRay scheduling Engine), to provide a problem definition and a design framework for FlexRay static segment schedule to address the new challenge on security. From a high level specification of the application, the architecture and communication middleware are synthesized to satisfy security requirements, in(More)