The paper introduces a reliable system, providing a sufficient solution for the associated nodes during hand-offs. • It investigates different QoS mechanisms, deploying each mechanism into various interfaces, and overall network performance when nodes switch between available interfaces. • It compares overall performance and feasibility of QoS mechanisms with the single-homed and multi-homed networks/nodes (site/host multi-homing) fluctuating resource availability.The user's hand-off is still an arguable issue that many mobile communication systems face, especially with the exploded growth of users and internet-based applications. Hence, there is a critical need for adequate quality of service (QoS) to meet the stringent requirements. This paper aims to study the overall performance and feasibility of several QoS mechanisms with the single-homed and multi-homed networks/nodes fluctuating resource availability. It investigates the adaptability of multi-interfaced multi-homed techniques to enhance the essential governing parameters, i.e., throughput, end-to-end latency, processing time, and jitter. Moreover, the paper introduces an interface selectivity technique for the multi-homed node to adopt the optimal interface, which offers the best services to explore the enhancements of the overall network performance. The overall results show how the introduced mechanism managed to keep the communication going on the multi-homed node. Furthermore, the results show that site multi-homing provides a better overall end-to-end latency over host multi-homing as it supports the entire network.

The current wireless communication system in Iraq faces several challenges during users’ handoff, especially with the fast growth of users and demands. This is also a global issue; therefore, quality of service (QoS) measures have rapidly become more important and developed over the years. The complexity of communication between diverse applications and underlying QoS architectures leads to these deployment problems, which decreases the utility of QoS provisioning. This paper studies different QoS aggregation mechanisms in order to improve the overall operational efficiency of the multi-homed node. The main QoS mechanisms, i.e., IntServ, DiffServ, best-effort, and IntServ-DiffServ were investigated and compared thoroughly. Furthermore, it focuses on the multi-homed network that aims to develop a scalable system with better performance, reliability, and optimized communication networks. In this paper, multi-homed network enhancements are carried out with the comparable site and host multi-homing. The results show how the IntServ-DiffServ has achieved the best overall performance compared to the other mechanisms as it combines the advantages of the IntServ and DiffServ mechanisms. Another important finding was that the multi-homing managed to keep the communication going on the multi-homed node, whereas the site-multi-homing gave a better overall end-to-end latency over the host-multi-homing.

Quality of service metrics and differentiated service mechanism policies are the most important criteria to deliver essential Internet requirements, especially during user handover, due to the rapid growth of users, multimedia applications, and traffic. DiffServ routers provide per-hop behaviors to manage traffic for services, whereas their policies have been applied to several types of Internet traffic, such as hypertext transfer protocol, file transfer protocol, and content-based routing. Multihoming aims to improve the reliability, scalability, and performance of data communications networks. This paper evaluated DiffServ various policies compared in a systematic manner (in two stages) over the multihomed networks to utilize and adopt the best policy for communicating packets, and enhanced the overall performance in terms of throughput, end-to-end latency, and processing time. Moreover, the paper introduced an interface-selection technique for multihomed nodes to select a proper interface, which provides the best services and links the behaviors that this interface yields. The overall results showed how the introduced multihoming-based interface-selection mechanism managed to maintain communication with the multihomed node. Furthermore, our results showed that the DiffServ time-sliding window with a three-color marking policy achieved the best system performance compared with the remaining policies.

When it comes to web search, information retrieval (IR) represents a critical technique as web pages have been increasingly growing. However, web users face major problems; unrelated user query retrieved documents (i.e., low precision), a lack of relevant document retrieval (i.e., low recall), acceptable retrieval time, and minimum storage space. This paper proposed a novel advanced document-indexing method (ADIM) with an integrated evolutionary algorithm. The proposed IRS includes three main stages; the first stage (i.e., the advanced documents indexing method) is preprocessing, which consists of two steps: dataset documents reading and advanced documents indexing method (ADIM), resulting in a set of two tables. The second stage is the query searching algorithm to produce a set of words or keywords and the related documents retrieving. The third stage (i.e., the searching algorithm) consists of two steps. The modified genetic algorithm (MGA) proposed new fitness functions using a cross-point operator with dynamic length chromosomes with the adaptive function of the culture algorithm (CA). The proposed system ranks the most relevant documents to the user query by adding a simple parameter (∝) to the fitness function to guarantee the convergence solution, retrieving the most relevant user’s document by integrating MGA with the CA algorithm to achieve the best accuracy. This system was simulated using a free dataset called WebKb containing Worldwide Webpages of computer science departments at multiple universities. The dataset is composed of 8280 HTML-programed semi-structured documents. Experimental results and evaluation measurements showed 100% average precision with 98.5236% average recall for 50 test queries, while the average response time was 00.46.74.78 milliseconds with 18.8 MB memory space for document indexing. The proposed work outperforms all the literature, comparatively, representing a remarkable leap in the studied field.

The document indexing process aims to store documents in a manner that facilitates the process of retrieving specific documents efficiently in terms of accuracy and time complexity. Many information retrieval systems encounter security issues and execution time to retrieve relevant documents. In addition, these systems lead to ample storage. Therefore, it requires combining confidentiality with the indexed document, and a separate process is performed to encrypt the documents. Hence, a new indexing structure named tree browser (TB) was proposed in this paper to be applied to index files of the large document set in an encrypted manner. This method represents the keywords in a variable-length binary format before being stored in the index. This binary format provides additional encryption to the information stored and reduces the index size. The proposed method (TB) is applied to the WebKB dataset. This dataset is related to web page documents (semi-structured documents). The experimental results demonstrated that the storage size is reduced by using TB-tree to 48.5 MB, while the traditional index is 307 MB.