Iran Telecom Research Center

Tehrān, Iran

Iran Telecom Research Center

Tehrān, Iran
Time filter
Source Type

Gharaee H.,Iran Telecom Research Center | Hosseinvand H.,Shahed University
2016 8th International Symposium on Telecommunications, IST 2016 | Year: 2017

Intrusion detection systems (IDS) are the main components of network security. IDSs monitor events of a system in a network, analyze the behavior in order to detect intrusions. One of the IDS models is anomaly based IDS which train to distinguish between normal and abnormal traffic. One of the anomaly based IDSs is based on Genetic algorithm as an evolutionary optimization algorithm. This paper has proposed an anomaly based IDS using Genetic algorithm and Support Vector Machine (SVM) with a new feature selection method. The new model has used a feature selection method based on Genetic with an innovation in fitness function reduce the dimension of the data, increase true positive detection and simultaneously decrease false positive detection. In addition, the computation time for training will also have a remarkable reduction. Results show that the proposed method can reach high accuracy and low false positive rate (FPR) simultaneously, though it had earlier been achieved in earlier studies separately. This study proposes a method which can achieve more stable features in comparison with other techniques. The proposed model experiment and test on KDD CUP 99 and UNSW-NB15 datasets. Numeric Results and comparison to other models have been presented. © 2016 IEEE.

Yadegari M.,Tarbiat Modares University | Gharaee H.,Iran Telecom Research Center
2016 8th International Symposium on Telecommunications, IST 2016 | Year: 2017

one of the key factors of the acceptance of information systems is privacy. Everyday Information systems and networks become complicated, so organizations are collecting growing amounts of personal information. Accordingly personal information is vulnerable to a variety of risks, including damage, loss, misuse, unauthorized access, and unauthorized disclosure. Information privacy assured by the Safe, Secure, proper, and consistent collection, processing, transmission, use and disposition of personal information all over its life cycle. Digitally-Based Personal information is networked all over its life cycle. In recent years some privacy models proposed but they are general-purpose models and focused on personal information. To the best of our knowledge, In spite of the importance of implementing privacy requirements in network, there is no privacy model dedicated to network context. In this paper we propose a privacy framework based on ISO29100 privacy principals and provides a comprehensive perspective of privacy requirements in network. The proposed privacy framework focuses on the implementation of the privacy principles in computer networks and is applicable to all kinds of networks. © 2016 IEEE.

Zargari F.,Iran Telecom Research Center | Rahmani F.,Iran Telecom Research Center
2016 8th International Symposium on Telecommunications, IST 2016 | Year: 2017

Motion vectors histogram (MVH) is an effective feature vector in video indexing and analysis applications. One of the challenges in the use of motion vector histogram is that it is not robust to video aspect ratio (AR). As a result, it is not suitable for comparing videos with different ARs. In this paper a feature vector based on motion vectors in H.264/AVC is introduced which is robust to variations in aspect ratio. This feature vector, namely scaled motion vector histogram (SMVH), has superior performance compared to common MVH and experimental results indicates that SMVH achieves on average 10% improvement in similarity detection of videos with different ARs compared with MVH. © 2016 IEEE.

Mohammadzadeh Qaratlu M.,Iran Telecom Research Center | Ghanbari M.,University of Essex
Signal Processing: Image Communication | Year: 2011

A spatial loss concealment algorithm for reconstruction of the lost blocks in the I-frames of a video sequence is proposed. The algorithm is carried out in three steps. In the first step an edge directional analysis on the boundaries of the lost blocks is carried out. In the second step, the lost pixels are approximated from the available neighboring blocks of that boundary. In the third step, the derived approximations of all available boundaries are combined for final reconstruction of the lost pixels. Experimental results over an H.264/AVC codec show an improvement of about 0.51 dB over a similar spatial loss concealment algorithm. The subjective quality of loss concealed pictures is also evaluated through SSIM measure. © 2011 Elsevier B.V. All rights reserved.

Samimi H.,Iran Telecom Research Center | Azmi P.,Tarbiat Modares University
Journal of Optical Communications and Networking | Year: 2010

In this paper, the bit error rate (BER) performance of a subcarrier intensity-modulated (SIM) free-space optical (FSO) communications system using binary phase shift keying (BPSK) is investigated over a K-distributed turbulence channel. First, the performance is analyzed employing a negative exponential turbulence model, and an exact closed-form expression is derived for the BER. Then, it is shown that the probability density function (PDF) of the K distribution can be approximated accurately by a finite sum of weighted negative exponential PDFs. Based on this interesting result and by using the closed-form expression, which is derived for the case of a negative exponential model, an approximate, closed-form expression for the BER of the BPSK-based SIM FSO over a K channel is derived. Moreover, to improve the BER performance, spatial diversity using selection combining (SC) is considered. It is shown that the PDF of the resulting channel irradiance corresponding to the SC diversity scheme over a K channel can be approximated accurately by a finite linear combination of negative exponential functions. The derived approximate PDF accurately estimates the PDF of the channel irradiance for arbitrary values of diversity order and is valid for a wide range of channel parameters. Then, an approximate, closed-form expression is derived for the average BER of the BPSK-based SIM FSO system employing the SC diversity technique over a K channel. Numerical results presented in this paper show that the derived approximate expressions are very accurate and can be used as efficient tools for performance analysis of the system. © 2009 OSA.

Samimi H.,Iran Telecom Research Center
International Journal of Communication Systems | Year: 2011

A new composite channel model is proposed for the performance analysis of shadowed fading channels. This model is represented as a mixture of generalized Gamma (GG) multipath fading and lognormal shadowing. GG distribution includes the Rayleigh, Nakagami, and Weibull as special cases; hence the presented model, which is referred to as GG-L, is a generic model that covers many well-known composite fading models, including the Rayleigh-lognormal (R-L), Nakagami-lognormal (N-L), and Weibull-lognormal (W-L). The main drawback of the lognormal-based composite models is that the composite probability density function (PDF) is not in closed form, thereby making the performance evaluation of communication links in these channels cumbersome. To bypass this problem, an approximation method is developed which makes it possible to derive a closed-form, analytical expression for GG-L composite distribution. The proposed method only needs the mean and the variance of the underlying lognormal distribution, and hence, bypasses the required complicated integration needed to calculate the PDF of the received signal envelope in GG-L channel. Based on this method, the most statistical characteristics, such as cumulative density function (CDF) and moments of the GG-L composite distribution, are derived and used for the performance analysis of a single receiver operating over GG-L fading channel. Copyright © 2010 John Wiley & Sons, Ltd.

Goudarzi P.,Iran Telecom Research Center
Telecommunication Systems | Year: 2014

Video transmission over error-prone cognitive radio wireless networks is a challenging task. In much of the traditional tight admission control algorithms for video cognitive users (CUs) in cognitive networks, CUs are admitted sequentially based on the strict quality of service and interference constraints imposed on the cognitive and primary users respectively. The sequential admittance of CUs may impose some form of the queuing delay for time-sensitive CUs which may be unacceptable. On the other hand, traditional admission control schemes do not consider the quality of experience of video users for admitting newly incoming ones. For addressing these issues and obtaining a more flexible quality-centric admission control policy by which the admission system can admit eligible cognitive users in parallel, and to cope with uncertainties in the acceptable levels of the video quality for different CUs (which may use different softwares/hardwares with different capabilities) and interference levels imposed on the primary users, a soft admission control (SAC) technique (named FQAC) is proposed by which the admission probability level for the parallel CUs can intelligently be controlled based on some linguistic input variables. Numerical analysis has been performed to validate the efficiency of the proposed quality-centric SAC mechanism in sparse and dense networking scenarios. © 2014, Springer Science+Business Media New York.

Goudarzi P.,Iran Telecom Research Center
Journal of Information Science and Engineering | Year: 2014

Due to the proliferation of the diversity in user behaviors and traffic demands, traffic engineering mechanisms have become an inevitable task in data networks. Nowadays, most commonly used algorithm in end hosts is the popular TCP and its variants (such as MulTCP). These are loss based schemes therefore exhibit oscillatory behavior which reduces network performance. Moreover, since the price for all sessions is normally based on the aggregate throughput, losses that are caused by TCP may affect other sessions as well and aggressively reduce their throughput and also have a drastic effect on the overall throughput/goodput of the network. In this paper a novel traffic engineering mechanism in the form of the selective pricing is proposed in which different prices are imposed on the network resources for different users. The proposed mechanism not only reduces the packet loss ratio, but also increases the goodput performance of the non-TCP elastic sessions such as Proportional or Minimum Potential Delay schemes. Stability property of the algorithms are investigated and some numerical analysis is presented to validate the results.

Goudarzi P.,Iran Telecom Research Center | Qaratlu M.M.,Iran Telecom Research Center
IEEE Multimedia | Year: 2010

A rate-allocation strategy based on a constrained optimization framework minimizes packet loss caused by wireless environments and network congestion in multihop, wireless ad hoc networks. These wireless ad hoc networks are can be contrasted with managed wireless networks, in which a special node, an access point, manages communication among other nodes. Using multiple paths between any source destination pair can improve reliability and availability. For smooth playback of a live video, transmitted packets must meet a maximum allowed delay constraint. The multipath routing is enabled and four disjoint paths introduced for carrying the source-destination pair's traffic. The main application of the proposed algorithm is in rate allocation to those subsets of real-time traffic that require stringent maximum packet loss and minimum bandwidth.

Ahmadi M.R.,Iran Telecom Research Center | Maleki D.,Iran Telecom Research Center
24th IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2010 | Year: 2010

Expansion of IT applications creates serious needs for environments with huge storage. In storage systems, capacity and agility are two factors which face limitations. This article evaluates the role of different techniques with regard to the possible methods for accessing to the storage systems. We have prepared three different scenarios using direct, semi-virtual, and virtual attachment models. We have evaluated the proposed models with several workloads including OLTP database, data streaming, file server, web server, etc. Results of evaluation with different criteria confirm that the virtual technique is a successful alternative for accessing to the storage systems especially in large capacity applications. This technique can therefore be an effective solution for expansion of storage area and reduction of access time. In this way, storage virtualization has the potential to provide high virtual capacity with good scalability as well as a better performance. Results of different evaluation and measurements demonstrate that the full virtual storage technique provides better performance and more agility as well as more effective utilization of the available resources. © 2010 IEEE.

Loading Iran Telecom Research Center collaborators
Loading Iran Telecom Research Center collaborators