الباحثون

Abderezak Touzene

· ORCID 0000-0001-6612-2084

المنشورات 5

مقال بحثي وصول مفتوح

Reinforcement Learning-Driven Decision-Making for Live Virtual Machine Migration in Fog Computing

Shahd Suleiman Alqam, Nasser Al- Zidi, Abderezak Touzene وآخرون · المجلة العُمانية للبحوث الهندسية · 2024 · 10.53540/tjer.vol20iss2pp113-122

Virtualization is an essential mechanism in fog computing that enables elasticity and isolation, which in turn helps achieve resource efficiency. To bring high flexibility in a fog environment, migration of virtual machines from one node to another is required. This can be achieved by live virtual machine migration to …

مقال بحثي وصول مفتوح

An Overview Survey of Recent Routing Protocols for Underwater Wireless Sensor Networks

Al-Salti Faiza A., Al-Zeidi Nasser M., Day Khaled وآخرون · مجلة جامعة السلطان قابوس للعلوم · 2018 · 10.24200/squjs.vol23iss2pp95-110

With the recent advances in underwater sensor devices and technologies, underwater wireless sensor networks (UWSNs) enable a variety of applications such as underwater exploration and monitoring, disaster prevention, and military surveillance and reconnaissance. However, these kinds of networks faces a number of challe …

مقال بحثي وصول مفتوح

On Directed Edge-Disjoint Spanning Trees in Product Networks, An Algorithmic Approach

Abderezak Touzene, Khaled Day · المجلة العُمانية للبحوث الهندسية · 2014 · 10.24200/tjer.vol11iss2pp79-88

In (Ku et al. 2003), the authors have proposed a construction of edge-disjoint spanning trees EDSTs in undirected product networks. Their construction method focuses more on showing the existence of a maximum number (n1+n2-1) of EDSTs in product network of two graphs, where factor graphs have respectively n1 and n2 EDS …

مقال بحثي وصول مفتوح

The Conditional Fault-Diameter of the K-ary n-Cube

Khaled Day, Abderezak Touzene · مجلة جامعة السلطان قابوس للعلوم · 2005 · 10.24200/squjs.vol10iss0pp63-75

We obtain the conditional fault diameter of the k-ary n-cube interconnection network. It has been previously shown that under the condition of forbidden faulty sets (i.e. assuming each non-faulty node has at least one non-faulty neighbor), the k-ary n-cube, whose connectivity is 2n, can tolerate up to 4n-3 faulty nodes …

مقال بحثي وصول مفتوح

Conditional Fault-Diameter of Torus Networks

Abderezak Touzene, Khaled Day · مجلة جامعة السلطان قابوس للعلوم · 2005 · 10.24200/squjs.vol10iss0pp51-62

We obtain the conditional fault-diameter of the square torus interconnection network under the condition of forbidden faulty sets (i.e. assuming that each non-faulty processor has at least one non-faulty neighbor). We show that under this condition, the square torus, whose connectivity is 4, can tolerate up to 5 faulty …

المؤلفون المشاركون