Mehboob Yasin

TLM POWER3: Power estimation methodology for SystemC TLM 2.0

We report on a SystemC add-on library which extends every SystemC module with non-functional data regarding power consumption and physical layout and which accumulates and estimates dynamic energy usage. It supports both phase/mode power modelling and energy-per-transaction logging for TLM (transactional-level modelling). Wiring energy is computed by counting bit-level activity within the TLM generic payload. Each leaf component can also register its physical dimensions to facilitate a wire length estimator that traverses the SystemC model hierarchy using either full placement or Rents rule estimators. It also supports dynamic voltage islands and inter-chip wiring, where each transaction can consume energy according to the current supply voltage of the relevant islands and the nature of the interconnect. We report on basic peformance from some SPLASH-2 benchmarks running on a modelled OpenRISC quad-core platform.

A study of host-based IDS using system calls

Intrusion detection systems (IDS) are complimentary to other security mechanisms such as access control and authentication. While signature based IDS are limited to known attacks only, anomaly based IDS are capable of detecting novel attacks. However, anomaly based systems usually trade performance for efficiency. We analyze various anomaly based IDS and list the strengths and weaknesses of different schemes. We conclude that the abstract stack model proposed by D. Wagner and D. Dean (see Proc. IEEE Symp. on Security and Privacy, 2001) shows best performance in detecting various types of attacks, while it suffers from substantial runtime overhead owing to its non deterministic nature. In a recently published approach utilizing code instrumentation, J.T. Giffin et al. (see Proc. NDSS Conf., 2004) minimize the runtime overhead while approaching the detection capability of the abstract stack model.

Adaptive Anycast: A New Anycast Protocol for Performance Improvement in Delay Tolerant Networks

Delay/disruption tolerant networks (DTNs) are characterized by frequent and long duration partitions and end-to-end connectivity may never be present between the source and the destination at the message origination time. Any cast is an important service used for many applications in DTN such as information exchange in hazards/crisis situation, recourse discovery etc. In this paper we study anycasting for a specific type of DTN, where the mobile nodes arc sparsely distributed, communicating via low radio range, experience frequent and long duration partition and end-to-end path may not be present at the time of message generation. We also propose a Receiver Based Forwarding (RBF) scheme for anycasting in DTN, which considers the path length as well as the number of receivers in forwarding the any cast bundle to the next hop. NS simulation results show that the RBP performs better than the normal forwarding (NF) in term of data delivery ratio, average end-to-end delay and overall data efficiency because the probability of available receivers increases.

Effect of Group Size on Anycasting with Receiver Base Forwarding in Delay Tolerant Networks

Delay/disruption tolerant networks (DTNs) are known for frequent and long duration partitions and end-to-end connectivity may be absent between the source and the destination. Anycast service is used for applications such as information exchange in hazards/crisis situation, recourse discovery, etc in Delay Tolerant Networks. For a specific type of DTN, where the mobile nodes are sparsely distributed, communicating via low radio range experience frequent and long duration partition and end-to-end path may not be present at the time of message generation. We have proposed a Receiver Based Forwarding (RBF) scheme for anycasting in DTN, which considers the path length as well as the number of receivers in forwarding the anycast bundle to the next hop Group size plays an important role in DTN anycasting, the group size varies in different scenarios. In this paper we have studied the effect of group size on our proposed Anycasting protocol by varying the group size from 3 to 15. Our simulation results have shown that the RBF performs better than the normal forwarding (NF) in term of data delivery ratio, average end-to-end delay and overall data efficiency because the probability of available receivers increases.