Tarik Taleb
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Tarik Taleb has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Nei Kato
Tohoku University
3 shared publications - Yoshiaki Nemoto
Graduate School of Information Sciences, Tohoku University, Sendai, Japan 980-8579
3 shared publications - Abbas Jamalipour
The University of Sydney
2 shared publications Abbas Jamalipour
Graduate School of Information Sciences, Tohoku University, Sendai, Japan
1 shared publication- Hiroki Nishiyama
Graduate School of Engineering, Tohoku University, Sendai, Japan
1 shared publication - Juan Carlos Fernandez
Graduate School of Information Sciences, Tohoku University, Sendai, Japan
1 shared publication
Latest Publications
- 11 September 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 11 (6) , 1082-1093
Bandwidth Aggregation-Aware Dynamic QoS Negotiation for Real-Time Video Streaming in Next-Generation Wireless Networks
In next generation wireless networks, Internet service providers (ISPs) are expected to offer services through several wireless technologies (e.g., WLAN, 3G, WiFi, and WiMAX). Thus, mobile computers equipped with multiple interfaces will be able to maintain simultaneous connections with different networks and increase their data communication rates by aggregating the bandwidth available at these networks. To guarantee quality-of-service (QoS) for these applications, this paper proposes a dynamic QoS negotiation scheme that allows users to dynamically negotiate the service levels required for their traffic and to reach them through one or more wireless interfaces. Such bandwidth aggregation (BAG) scheme implies transmission of data belonging to a single application via multiple paths with different characteristics, which may result in an out-of-order delivery of data packets to the receiver and introduce additional delays for packets reordering. The proposed QoS negotiation system aims to ensure the continuity of QoS perceived by mobile users while they are on the move between different access points, and also, a fair use of the network resources. The performance of the proposed dynamic QoS negotiation system is investigated and compared against other schemes. The obtained results demonstrate the outstanding performance of the proposed scheme as it enhances the scalability of the system and minimizes the reordering delay and the associated packet loss rate.
- 11 September 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 11 (6) , 1082-1093
Bandwidth Aggregation-Aware Dynamic QoS Negotiation for Real-Time Video Streaming in Next-Generation Wireless Networks
In next generation wireless networks, Internet service providers (ISPs) are expected to offer services through several wireless technologies (e.g., WLAN, 3G, WiFi, and WiMAX). Thus, mobile computers equipped with multiple interfaces will be able to maintain simultaneous connections with different networks and increase their data communication rates by aggregating the bandwidth available at these networks. To guarantee quality-of-service (QoS) for these applications, this paper proposes a dynamic QoS negotiation scheme that allows users to dynamically negotiate the service levels required for their traffic and to reach them through one or more wireless interfaces. Such bandwidth aggregation (BAG) scheme implies transmission of data belonging to a single application via multiple paths with different characteristics, which may result in an out-of-order delivery of data packets to the receiver and introduce additional delays for packets reordering. The proposed QoS negotiation system aims to ensure the continuity of QoS perceived by mobile users while they are on the move between different access points, and also, a fair use of the network resources. The performance of the proposed dynamic QoS negotiation system is investigated and compared against other schemes. The obtained results demonstrate the outstanding performance of the proposed scheme as it enhances the scalability of the system and minimizes the reordering delay and the associated packet loss rate.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4, 1921-1926
A Fair TCP-Based Congestion Avoidance Approach for One-to-Many Private Networks
Over the past few years, a number of private networks have emerged. In these private networks, a server provides its subscribed clients with Internet services, forming a one-to-many network topology. Given the fact that users are located at different distances from the server, usage of the Transmission Control Protocol (TCP) for communication results in drastically unfair bandwidth allocations among the users. In this regard, this paper addresses the fairness and efficiency issues of TCP in such one-to-many IP (Internet Protocol) networks. The efficiency of TCP is controlled by matching the aggregate traffic rate of all TCP connections to the sum of the link capacity and total buffer size. On the other hand, its unfairness issue is mitigated by allocating bandwidth among individual flows in relative proportion with their RTTs. Simulation results elucidate that the proposed method makes better utilization of the network resources, reduces the number of packet drops, and provides a fair service to users.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4, 1921-1926
A Fair TCP-Based Congestion Avoidance Approach for One-to-Many Private Networks
Over the past few years, a number of private networks have emerged. In these private networks, a server provides its subscribed clients with Internet services, forming a one-to-many network topology. Given the fact that users are located at different distances from the server, usage of the Transmission Control Protocol (TCP) for communication results in drastically unfair bandwidth allocations among the users. In this regard, this paper addresses the fairness and efficiency issues of TCP in such one-to-many IP (Internet Protocol) networks. The efficiency of TCP is controlled by matching the aggregate traffic rate of all TCP connections to the sum of the link capacity and total buffer size. On the other hand, its unfairness issue is mitigated by allocating bandwidth among individual flows in relative proportion with their RTTs. Simulation results elucidate that the proposed method makes better utilization of the network resources, reduces the number of packet drops, and provides a fair service to users.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5, 2364-2369
An Efficient Signature-Based Approach for Automatic Detection of Internet Worms over Large-Scale Networks
Internet Worms pose a serious threat to today's Internet. Signature matching is an important approach to detect worms. However, as most signature development processes are manual, they require significant time. They are thus not efficient in reducing the damage worms may cause. In this paper, an efficient signature-based method is proposed for automatic detection of worms over large-scale networks. In the proposed system, detection is performed in a hierarchical manner. Security managers of local networks collect worm-like or suspicious flows and handle these flows to high-hierarchy metropolitan managers. In response, the latter use this information to generate robust signature. The global manager which lies on top of the hierarchy, multicasts the signature to local managers via metropolitan managers. This enables local managers to detect worms that try to penetrate into their networks. The proposed system is evaluated using an off-line real network traffic that contains traces of worms. Experimental results indicate that the proposed system exhibits high detection rates with low false alarm rates.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5, 2364-2369
An Efficient Signature-Based Approach for Automatic Detection of Internet Worms over Large-Scale Networks
Internet Worms pose a serious threat to today's Internet. Signature matching is an important approach to detect worms. However, as most signature development processes are manual, they require significant time. They are thus not efficient in reducing the damage worms may cause. In this paper, an efficient signature-based method is proposed for automatic detection of worms over large-scale networks. In the proposed system, detection is performed in a hierarchical manner. Security managers of local networks collect worm-like or suspicious flows and handle these flows to high-hierarchy metropolitan managers. In response, the latter use this information to generate robust signature. The global manager which lies on top of the hierarchy, multicasts the signature to local managers via metropolitan managers. This enables local managers to detect worms that try to penetrate into their networks. The proposed system is evaluated using an off-line real network traffic that contains traces of worms. Experimental results indicate that the proposed system exhibits high detection rates with low false alarm rates.
- 31 August 2003
- Published by Elsevier in Signal Processing: Image Communication
- Vol. 18 (7) , 515-526
Neighbors-buffering-based video-on-demand architecture
- 31 August 2003
- Published by Elsevier in Signal Processing: Image Communication
- Vol. 18 (7) , 515-526
Neighbors-buffering-based video-on-demand architecture