scispace - formally typeset
S

Seyed Vahid Azhari

Researcher at Iran University of Science and Technology

Publications -  29
Citations -  228

Seyed Vahid Azhari is an academic researcher from Iran University of Science and Technology. The author has contributed to research in topics: Scheduling (computing) & Computer science. The author has an hindex of 5, co-authored 25 publications receiving 207 citations. Previous affiliations of Seyed Vahid Azhari include Ciena & McMaster University.

Papers
More filters
Patent

Wlan-to-wwan handover methods and apparatus using a wlan support node having a wwan interface

TL;DR: In this paper, a network support node which is utilized to facilitate such transitioning has a first communication interface (e.g. an Ethernet interface) for connection with a communication network which includes the WLAN and a second communication interface for communicating with a base station of the WWAN over a wireless communication link.
Journal ArticleDOI

Overload control in SIP networks using no explicit feedback: A window based approach

TL;DR: This paper proposes a distributed and end-to-end adaptive window based overload control algorithm, which does not use explicit feedback from the downstream server, and achieves higher throughput and is also fair among different upstream servers under different network latencies.
Journal ArticleDOI

Energy-aware and load-balanced parent selection in RPL routing for wireless sensor networks

TL;DR: This paper proposes a dynamic parent selection in RPL that takes both load and energy constraints into consideration and extends network lifetime and improves network performance in terms of end-to-end delay and packet delivery ratio.
Proceedings ArticleDOI

QoS based aggregation in high speed IEEE802.11 wireless networks

TL;DR: A novel frame aggregation algorithm with statistical delay guarantee for high speed IEEE802.11 networks considering link quality fluctuations and outperforms Earliest Deadline First (EDF) scheduling with maximum aggregation size and pure deadline-based aggregation, both in terms of maximum number of stations and channel efficiency.
Journal ArticleDOI

Delay sensitive resource allocation over high speed IEEE802.11 wireless LANs

TL;DR: The proposed scheme outperforms the Earliest Deadline First (EDF) scheduling with maximum aggregation size and pure deadline-based schemes, both in terms of the maximum number of stations and channel efficiency by 10–30%.