Sharif Digital Repository

We propose a new algorithm for object tracking in crowded video scenes by exploiting the properties of undecimated wavelet packet transform (UWPT) and interframe texture analysis. The algorithm is initialized by the user through specifying a region around the object of interest at the reference frame. Then, coefficients of the UWPT of the region are used to construct a feature vector (FV) for every pixel in that region. Optimal search for the best match is then performed by using the generated FVs inside an adaptive search window. Adaptation of the search window is achieved by interframe texture analysis to find the direction and speed of the object motion. This temporal texture analysis... 

By occurring failures in computer networks, routing protocols are triggered to update routing and forwarding tables. Because of invalid tables during update-time, transient loop may occur and packet-drop rate and end-to-end delay increase which means that the quality of service decreases. This paper studies the effect of routing-tables update-time on networks' performability, i.e. the ability of network to deliver services at predefined level. A sample network is studied and the simulation results show that faster updates of routing table, improve network's performability in the presence of failures. Since it may not worth or even be practical to accelerate all routers in the network, this... 

Network survivability refers to the ability of a network to maintain uninterrupted service regardless of the scale, magnitude, duration, and the type of failures. There is growing interest in attempts to quantify the network survivability in presence of various failures. We perceive that both performance and availability are integral components of survivability. Therefore, we propose a general composite model for survivability performance evaluation which is applicable to a wide range of networks. In this model, the excess loss due to failure (ELF) analysis is used to find the loss due to failure when the system is operating in gracefully degraded states. Fault tree method is used to model... 

Software Defined Networking (SDN) provides a logically centralized view of the state of the network, and as a result opens up new ways to manage and monitor networks. In this paper we introduce a novel approach to network intrusion detection in SDNs that takes advantage of these attributes. Our approach can detect compromised routers that produce faulty messages, copy or steal traffic or maliciously drop certain types of packets. To identify these attacks and the affected switches, we correlate the forwarding state of network - i.e. installed forwarding rules - with the forwarding status of packets - i.e. the actual route packets take in the network and detect anomaly in routes. Thus, our... 

Resilient Packet Ring (RPR) that has been standardized as IEEE 802.17 is a MAC layer protocol designed for data centric metropolitan area network applications. A well-designed RPR network would be able to offer QoS guarantee for throughput and delay sensitive data classes in addition to providing other types of low cost best effort services. Careful network planning would be required to allow successful provisioning of classA services with strict delay and jitter requirements over RPR networks. This would require the knowledge of the dependency of delay and jitter for classA traffic on the load that is added to the ring. In this article, we propose an algorithm to estimate the dependency of... 

A SEnsor Network with Mobile Agents (SENMA) is an architecture proposed for large scale sensor networks in which the access point moves above the network and gathers information from a limited number of nodes. However, the performance of such system is limited by estimation errors and packet errors due to collision. In this paper, we first derive the equations of distortion in a general scenario and use this model to obtain four best node positions in order to achieve min-max estimation error in a square. In addition, an opportunistic MAC is proposed that considers both collision effects and estimation error based on Channel State Information (CSI). As the simulation results show the... 

In this paper, we aim to improve the performance and power metrics of packet-switched network-on-chips (NoCs) and benefits from the scalability and resource utilization advantages of NoCs and superior communication performance of point-to-point dedicated links. The proposed method sets up the virtual point-to-point (VIP) connections over one virtual channel (which bypasses the entire router pipeline) at each physical channel of the NoC. We present two schemes for constructing such VIP circuits. In the first scheme, the circuits are constructed for an application based on its task-graph at design time. The second scheme addresses constructing the connections at run-time using a light-weight... 

This paper presents an analytical study of average delay and throughput in a two-way relay network exploiting network coding to exchange source packets, where arrival and departure of packets are stochastic. In this case, a fundamental problem for the relay node is whether to wait in order to obtain a coding opportunity, leading to reduction of the number of transmissions, or sending a packet (coded/uncoded) whenever it has a transmission opportunity, leading to reduction of the packet delay. In order to address the fundamental trade-off between packet delay and transmission power, we develop three network coding schemes based on power-delay constraint of the application. We devise a... 

Abstract Reducing the NoC power is critical for scaling up the number of nodes in future many-core systems. Most NoC designs adopt packet-switching to benefit from its high throughput and excellent scalability. These benefits, however, come at the price of the power consumption and latency overheads of routers. Circuit-switching, on the other hand, enjoys a significant reduction in power and latency of communication by directing data over pre-established circuits, but the relatively large circuit setup time and low resource utilization of this switching mechanism is often prohibitive. In this paper, we address one of the major problems of circuit-switching, i.e. the circuit setup time... 

In this paper, we aim to improve the performance and power metrics of packet-switched network-on-chips (NoCs) and benefits from the scalability and resource utilization advantages of NoCs and superior communication performance of point-to-point dedicated links. The proposed method sets up the virtual point-to-point (VIP) connections over one virtual channel (which bypasses the entire router pipeline) at each physical channel of the NoC. We present two schemes for constructing such VIP circuits. In the first scheme, the circuits are constructed for an application based on its task-graph at design time. The second scheme addresses constructing the connections at run-time using a light-weight... 

We have developed a mathematical programming model for minimizing total flow time of the flow shop sequence dependent group scheduling (FSDGS) problem, typically classified as Fm|fmls, Splk, prmu|∑Cj. As the problem is shown to be strongly NP-hard, a tabu search (TS) algorithm as well as a hybrid ant colony optimization (HACO) algorithm have been developed to heuristically solve the problem. A lower bounding (LB) method based on the Branch-and-Price algorithm is also developed to evaluate the quality of the metaheuristic algorithms. In order to compare the performance of metaheuristic algorithms, random test problems, ranging in size from small, medium, to large are created and solved by... 

Network traffic classification has become more important with the rapid growth of Internet and online applications. Numerous studies have been done on this topic which have led to many different approaches. Most of these approaches use predefined features extracted by an expert in order to classify network traffic. In contrast, in this study, we propose a deep learning-based approach which integrates both feature extraction and classification phases into one system. Our proposed scheme, called “Deep Packet,” can handle both traffic characterization in which the network traffic is categorized into major classes (e.g., FTP and P2P) and application identification in which identifying end-user... 

This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The prioritized class-1 jobs are real-time, served either with the preemptive or non-preemptive Earliest- Deadline- First (EDF) policy and can preempt the non real-time class-2 jobs. The preempted service of the class-2 job is resumed from the time in instances where no class-1 job is in the system. The service discipline of class-2 jobs is FCFS. The required mean service times may depend on the class of the jobs. The real-time jobs have exponentially distributed relative deadlines until the end of service. The system is approximated by a Markovian model in the long run, which... 

In this paper, analysis of the throughput and delay in a spectrally phase-encoded optical code-division multiple-access (OCDMA) system, using a simplified slotted packet network protocol is conducted. Steady-state throughput and average packet delay of the system are derived. In evaluating the performance of the system, only multiple access interference is considered and other sources of noise are neglected. Comparing different systems with the fixed bit rate and chip duration leads us to conclude that increasing the code length will improve the performance of networks with small average activity; but in highly active networks, decreasing the code length will result in a significant... 

One of the man concerns of peer-to-peer video streaming over the internet is the cumulative impact of the Internet packet loss due to the decoding dependency of the compressed video frames. In this paper we study the efficiency of various packet loss recovery policies that can be used in peer-to-peer streaming. Our analytical and simulation results show how different packet loss recovery policies can be effective for peer-to-peer video streaming. © 2007 IEEE  

This paper introduces Adaptive Path Selection and Loading (APSL) as a multi-path data transmission scheme for mitigating the effects of misbehaving nodes in mobile ad-hoc networks. In APSL, misbehavior resilience is achieved by adaptively loading Reed-Solomon (RS) coded data into multiple node-disjoint paths. In order to maximize packet delivery ratio, paths are loaded according to Path State Information (PSI) which dynamically estimates the availability and stability of each path. We evaluated APSL through simulation in terms of packet delivery ratio, normalized average end-to-end delay and overhead. APSL can achieve more than 90% packet delivery ratio. Compared to adaptive single path and... 

Long Reed-Solomon codes over the prime field GF(216 + 1) are proposed as a low overhead channel code for reliable transmission of video over noisy and lossy channels. The added redundancy is near optimal from the information theoretic point of view contrary to the conventionally used intra-coding and sync (marker) insertion in video transmission that are not justified theoretically. Compared to known source-channel coding methods, we have achieved the quality of the output of source coder by providing nearly error free transmission. (By nearly error free we mean an arbitrarily small error probability.) The price paid for such remarkable video quality improvement and relatively low complexity... 

In this paper, the flexible flow shop sequence-dependent group scheduling problem (FFSDGS) with minimisation of makespan as the criterion (FF m|fmls, S plk|C max) is investigated. For the first time a mathematical model for the proposed research problem is developed. Since the problem is shown to be NP-hard, six metaheuristic algorithms based on tabu search (TS) are developed to efficiently solve the problem. The proposed metaheuristics are different to the only available metaheuristic algorithm in the literature based on TS. By applying randomised complete block design and using available test problems in the literature, the best of the proposed TS algorithms in this research is identified.... 

In this paper, we focus on a cognitive network scenario, comprised of a multi-hop IEEE 802.11-based WLAN overlaid on a cellular network. In this scenario, the wireless nodes in a WLAN, i.e., cognitive nodes, use the downlink frequency channels of the cellular network opportunistically, such that at each packet transmission all idle channels have been exploited. In order to evaluate the capability of the considered cognitive network scenario, we propose an open queueing network model such that different packet transmission phases are mapped onto different queueing nodes. We also map different types of collisions, i.e., collision on control signals as well as collision on data transmission due... 

In this study, the authors propose an analytical model to evaluate the maximum stable throughput for unicast services in vehicular ad hoc networks. In this respect, the authors employ two queueing networks (QNs) to model the mobility patterns of the vehicles as well as the multi-hop packet transmission scenario. In the proposed model, the authors map the features of IEEE 802.11, as well as the details of multi-hop packet transmission, regarding the dynamic status of vehicles, onto suitable parameters of the QNs. In the authors' modelling approach, they take the details of MAC and routing schemes into account by classifying the vehicles based on their mobility patterns and considering their...