Tarik Taleb
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Tarik Taleb has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
Yoshiaki Nemoto
Graduate School of Information Sciences, Tohoku University, Japan
2 shared publicationsAbbas Jamalipour
Department of Electrical and Information Engineering, University of Sydney, Australia
1 shared publication- Daisuke Mashimo
Graduate School of Information Sciences, Tohoku University, Japan
1 shared publication - Juan Carlos Fernandez
Graduate School of Information Sciences, Tohoku University, Sendai, Japan
1 shared publication Kazuo Hashimoto
Graduate School of Information Sciences, Tohoku University, Sendai, Japan
1 shared publication- Kazuo Hashimoto
Graduate School of Information Sciences, Tohoku University, Japan
1 shared publication
Latest Publications
- 11 August 2008
- Published by Wiley in Security and Communication Networks
- Vol. 2 (1) , 11-28
Combating against internet worms in large‐scale networks: an autonomic signature‐based solution
In this paper, we propose a signature‐based hierarchical email worm detection (SHEWD) system to detect e‐mail worms in large‐scale networks. The proposed system detects novel worms and instantly generates their signatures. This feature helps to check the spread of any kind of worm—knownorunknown.We envision a two‐layer hierarchical architecture comprising local security managers (LSMs), metropolitan security managers (MSM), and a global security manager (GSM). Local managers collectsuspiciousflows and hand them to metropolitan managers. Metropolitan managers then use cluster analysis to sort worms from the suspicious flows. The sorted worms are used to generate the worm signature which is relayed to the global manager and then to all the collaborating networks. A separate scheme is proposed to automatically select suitable values of the system parameters. This parameter selection procedure takes into account the current network state and thethreat levelof the ongoing attack. The performance of the whole system is investigated using real network traffic with traces of worms. Experimental results demonstrate that the proposed scheme is capable to accurately detect email worms during the early phase of their propagations. Copyright © 2008 John Wiley & Sons, Ltd.
- 11 August 2008
- Published by Wiley in Security and Communication Networks
- Vol. 2 (1) , 11-28
Combating against internet worms in large‐scale networks: an autonomic signature‐based solution
In this paper, we propose a signature‐based hierarchical email worm detection (SHEWD) system to detect e‐mail worms in large‐scale networks. The proposed system detects novel worms and instantly generates their signatures. This feature helps to check the spread of any kind of worm—knownorunknown.We envision a two‐layer hierarchical architecture comprising local security managers (LSMs), metropolitan security managers (MSM), and a global security manager (GSM). Local managers collectsuspiciousflows and hand them to metropolitan managers. Metropolitan managers then use cluster analysis to sort worms from the suspicious flows. The sorted worms are used to generate the worm signature which is relayed to the global manager and then to all the collaborating networks. A separate scheme is proposed to automatically select suitable values of the system parameters. This parameter selection procedure takes into account the current network state and thethreat levelof the ongoing attack. The performance of the whole system is investigated using real network traffic with traces of worms. Experimental results demonstrate that the proposed scheme is capable to accurately detect email worms during the early phase of their propagations. Copyright © 2008 John Wiley & Sons, Ltd.
- 1 November 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 73-77
Multi-path Scheduling Algorithm for Real-Time Video Applications in Next-Generation Wireless Networks
In wireless mobile networks, ensuring quality of service (QoS) for real-time video applications is a challenge due to resource limitations. Nowadays, such a problem can be alleviated by exploiting the features of mobile computers equipped with multiple wireless interfaces, which can be used simultaneously for transmission/reception of data belonging to a single application. This increases the throughput but is tied to the packets reordering issue. This paper proposes a scheme for scheduling packets through different paths and minimizing the reordering delay at the receiver side. We consider a QoS negotiation system where active users have a specific amount of bandwidth negotiated with the network by each available interface. To allocate such negotiated bandwidth to users, the network implements a time slot division- based strategy. A new scheduling mechanism is developed by taking into consideration such QoS system. Its performance is evaluated and compared against the most popular scheduling schemes via simulations. The results show that our algorithm outperforms the former scheduling algorithms.
- 1 November 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 73-77
Multi-path Scheduling Algorithm for Real-Time Video Applications in Next-Generation Wireless Networks
In wireless mobile networks, ensuring quality of service (QoS) for real-time video applications is a challenge due to resource limitations. Nowadays, such a problem can be alleviated by exploiting the features of mobile computers equipped with multiple wireless interfaces, which can be used simultaneously for transmission/reception of data belonging to a single application. This increases the throughput but is tied to the packets reordering issue. This paper proposes a scheme for scheduling packets through different paths and minimizing the reordering delay at the receiver side. We consider a QoS negotiation system where active users have a specific amount of bandwidth negotiated with the network by each available interface. To allocate such negotiated bandwidth to users, the network implements a time slot division- based strategy. A new scheduling mechanism is developed by taking into consideration such QoS system. Its performance is evaluated and compared against the most popular scheduling schemes via simulations. The results show that our algorithm outperforms the former scheduling algorithms.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 14-19
On how to Mitigate the Packet Reordering Issue in the Explicit Load Balancing Scheme
Efficient load balancing is an important requirement for intelligent engineering of traffic over all-IP satellite networks. In this regard, the authors have recently proposed an explicit load balancing (ELB) scheme for next-generation LEO/MEO satellite systems. In ELB, a congesting satellite requests its neighboring satellites to forward a portion of data, originally destined to travel through the satellite, via alternative paths that do not involve the satellite. While this feature yields better traffic distribution and reduces the overall packet drops that may occur at the congesting satellite, it raises the so-called packet reordering issue. In connection-oriented protocols such as TCP, an out-of-order reception of packets generates duplicate acknowledgments that result in a gratuitous halving of the congestion window. This ultimately degrades the overall throughput of the network. To cope with packet reordering issue in ELB, we suggest some minor modifications to the TCP implementation at the receiver side to enable receivers to judge the actual reason beneath the out of order reception of packets. We compare the performance of our method to that of standard TCP and TCP-PR, a recently proposed scheme for persistent packet reordering. Depending on the traffic characteristics and the satellite constellation type, discussion on the advantages and pitfalls of each scheme is given.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 14-19
On how to Mitigate the Packet Reordering Issue in the Explicit Load Balancing Scheme
Efficient load balancing is an important requirement for intelligent engineering of traffic over all-IP satellite networks. In this regard, the authors have recently proposed an explicit load balancing (ELB) scheme for next-generation LEO/MEO satellite systems. In ELB, a congesting satellite requests its neighboring satellites to forward a portion of data, originally destined to travel through the satellite, via alternative paths that do not involve the satellite. While this feature yields better traffic distribution and reduces the overall packet drops that may occur at the congesting satellite, it raises the so-called packet reordering issue. In connection-oriented protocols such as TCP, an out-of-order reception of packets generates duplicate acknowledgments that result in a gratuitous halving of the congestion window. This ultimately degrades the overall throughput of the network. To cope with packet reordering issue in ELB, we suggest some minor modifications to the TCP implementation at the receiver side to enable receivers to judge the actual reason beneath the out of order reception of packets. We compare the performance of our method to that of standard TCP and TCP-PR, a recently proposed scheme for persistent packet reordering. Depending on the traffic characteristics and the satellite constellation type, discussion on the advantages and pitfalls of each scheme is given.