Basima Elshqeirat

University of Jordan | UJ · Department of Computer Information Systems

Big Data refers to vast and complex datasets that require processing and analysis to uncover valuable insights beneficial to businesses and organizations. This has become a fundamental approach for acquiring, processing, and analyzing large volumes of data to extract useful information. Big Data encounters challenges such as Volume, Velocity, Varie...

The rapid expansion of government and corporate services to the online sphere has spurred a notable surge in internet usage among individuals. However, this increased connectivity also amplifies the risks posed by cyber threats, as hackers exploit external networking avenues and corporate networks for personal activities. Consequently, proactive me...

The domain name system (DNS) plays a vital role in network services for name resolution. By default, this service is seldom blocked by security solutions. Thus, it has been exploited for security breaches using the DNS covert channel (tunnel). One of the greatest current data leakage techniques is DNS tunneling, which uses DNS packets to exfiltrate...

Over the last few years, the arena of mobile application development has expanded considerably beyond the demand of the world's software markets. With the growing number of mobile software companies and the increasing sophistication of smartphone technology, developers have been establishing several categories of applications on dissimilar platform...

Over the last few years, the arena of mobile application development has expanded considerably beyond the balance of the world's software markets. With the growing number of mobile software companies, and the mounting sophistication of smartphones’ technology, developers have been building several categories of applications on dissimilar platforms....

This paper addresses an NP-complete problem of designing a network topology (NT) with the maximum 2-terminal reliability (R) subject to a cost constraint (C). More specifically, given the locations of the various computer centers (nodes), their connecting links, each link’s reliability and cost, and the maximum budget cost to install the links, the...

This paper provides an algorithm to design a communication network topology with minimal cost (C) and maximum (s, t) reliability (R) subject to a pre-defined bandwidth (Bmin) constraint, given (i) locations of the various computer nodes, (ii) their connecting links, (iii) each link’s reliability, cost and bandwidth, and (iv) a minimum bandwidth for...

This paper provides an algorithm to design a communication network topology with minimal cost (C) and maximum (s, t) reliability (R) subject to a predefined bandwidth (Bmin) constraint, given (i) locations of the various computer nodes, (ii) their connecting links, (iii) each link's reliability, cost and bandwidth, and (iv) a minimum bandwidth for...

This paper addresses an NP-hard problem, called NTD-CB/R, whose solution is of importance to applications requiring one or more Quality of Service (QoS). Specifically, the problem calls for a network topology that meets two objectives, i.e., minimal cost and maximum bandwidth, subject to a predefined (s, t) reliability constraint. We approach the p...

This paper addresses an NP-hard problem, refered to as Network Topology Design with minimum Cost subject to a Reliability constraint (NTD-CR), to design a minimal-cost communication network topology that satisfies a pre-defined reliability constraint. The paper describes a dynamic programming (DP) scheme to solve the NTD-CR problem, and proposes a...

This thesis addresses four reliable network topology design problems that consider reliability, cost, and/or bandwidth performance metrics. The optimization problems include one or two objectives and one constraint, each of which is known NP-hard. All problems consider all-terminal and/or two-terminal reliability measures. Four heuristic dynamic pr...

This paper addresses an NP-hard problem to design a network topology with maximum all-terminal reliability subject to a cost constraint, given the locations of the various computer centers (nodes), their connecting links, each link's reliability and cost, and the maximum budget cost to install the links. Because cost is always a major focus in netw...

This paper addresses an NP-hard problem, called NTD-CR, to design a minimal-cost communication network topology that satisfies a pre-defined reliability constraint. Since reliability is always a major issue in the network design, the problem is practical for critical applications requiring minimized cost. The paper formulates a dynamic progra...

This paper addresses an NP-hard problem, called NTD-CR, to design a minimal-cost communication network topology that satisfies a pre-defined reliability constraint. Since reliability is always a major issue in the network design, the problem is practical for critical applications requiring minimized cost. The paper formulates a dynamic programming...

This paper addresses an NP-complete problem, called NTD-CR, to design a minimal-cost communication network topology that satisfies a pre-defined two terminal reliability constraint, given the locations of the various computer centers (nodes), their connecting links, each link's reliability and cost, and the required reliability for the network to o...

This paper addresses an NP-hard problem of designing a network topology with maximum (s, t) reliability subject to given constraints, such as the computer centers location (nodes), their connecting links reliability and cost, and the maximum budget cost to install the links. Cost is a major issue in the network design, and thus the problem is appli...