Nowadays, the mobile communication networks have become a consistent part of our everyday life by transforming huge amount of data through communicating devices, that leads to new challenges. According to the Cisco Networking Index, more than 29.3 billion networked devices will be connected to the network during the year 2023. It is obvious that the existing infrastructures in current networks will not be able to support all the generated data due to the bandwidth limits, processing and transmission overhead. To cope with these issues, future mobile communication networks must achieve high requirements to reduce the amount of transferred data, decrease latency and computation costs. One of the essential challenging tasks in this subject area is the optimal self-organized service placement. In this paper a heuristic-based algorithm for service placement in future networks was presented. This algorithm achieves the ideal placement of services replicas by monitoring the load within the server and its neighborhood, choosing the node that contributes with the highest received load, and finally replicating or migrating the service to it based on specific criteria, so that the distance of requests coming from clients becomes as small as possible because of placing services within nearby locations. It was proved that our proposed algorithm achieves an improved performance by meeting the services within a shorter time, a smaller bandwidth, and thus a lower communication cost. It was compared with the traditional client-server approach and the random placement algorithm. Experimental results showed that the heuristic algorithm outperforms other approaches and meets the optimal performance with different network sizes and varying load scenarios.
Current study was Based on the variables interact with each other to form a general framework of the pricing of banking services, and the role of profitability in the banking activity, because profit is the most important goal of commercial banks, that included the study United Bank, North Bank and Bank of Baghdad, and the each formation of bank were was collected about the prices (Iraqi dinar and the U.S. dollar) and interest percentages and then revenue (Iraqi Dinars) through banking channels, and each channel service included a group of well-known banking operations.
The study found that the effect of prices, and interest on profitability and clear. There have been a correlation between the rates, and interes
... Show MoreBusiness organizations have faced many challenges in recent times, most important of which is information technology, because it is widely spread and easy to use. Its use has led to an increase in the amount of data that business organizations deal with an unprecedented manner. The amount of data available through the internet is a problem that many parties seek to find solutions for. Why is it available there in this huge amount randomly? Many expectations have revealed that in 2017, there will be devices connected to the internet estimated at three times the population of the Earth, and in 2015 more than one and a half billion gigabytes of data was transferred every minute globally. Thus, the so-called data mining emerged as a
... Show MoreThe aim object of research is to show the computerized services library of Salahaldeen University in Erbil city in Iraq, so the research treatment all side of library such as building, location ,staff ,finance, resource collection and services ,we refer to. problem which face library such as administration and finance through the using Of case study method, reference source ,meeting , online comment and data record .The study focus develop in library departments, users services, management ,staff, the resource collection, building and location.
The study ending with many results and recommendation to develop the library services by using modern Information system to all users inside and outside the university and link them with other
Finding a path solution in a dynamic environment represents a challenge for the robotics researchers, furthermore, it is the main issue for autonomous robots and manipulators since nowadays the world is looking forward to this challenge. The collision free path for robot in an environment with moving obstacles such as different objects, humans, animals or other robots is considered as an actual problem that needs to be solved. In addition, the local minima and sharp edges are the most common problems in all path planning algorithms. The main objective of this work is to overcome these problems by demonstrating the robot path planning and obstacle avoidance using D star (D*) algorithm based on Particle Swarm Optimization (PSO)
... Show MoreInsurance companies seeking to develop programs to promote and market their services and to increase its customer through the use of modern technical marketing and reduce its dependence on agents and take advantage of work of the banks by alliances with them and including reinforcing get the parties to competitive advantages in the financial market , the insurance services intangible service stops marketed over the insurance awareness and requires exceptional promotional efforts. &nbs
... Show MoreNowadays, cloud computing has attracted the attention of large companies due to its high potential, flexibility, and profitability in providing multi-sources of hardware and software to serve the connected users. Given the scale of modern data centers and the dynamic nature of their resource provisioning, we need effective scheduling techniques to manage these resources while satisfying both the cloud providers and cloud users goals. Task scheduling in cloud computing is considered as NP-hard problem which cannot be easily solved by classical optimization methods. Thus, both heuristic and meta-heuristic techniques have been utilized to provide optimal or near-optimal solutions within an acceptable time frame for such problems. In th
... Show MoreHigh vehicular mobility causes frequent changes in the density of vehicles, discontinuity in inter-vehicle communication, and constraints for routing protocols in vehicular ad hoc networks (VANETs). The routing must avoid forwarding packets through segments with low network density and high scale of network disconnections that may result in packet loss, delays, and increased communication overhead in route recovery. Therefore, both traffic and segment status must be considered. This paper presents real-time intersection-based segment aware routing (RTISAR), an intersection-based segment aware algorithm for geographic routing in VANETs. This routing algorithm provides an optimal route for forwarding the data packets toward their destination
... Show MoreAbstract
In this work, two algorithms of Metaheuristic algorithms were hybridized. The first is Invasive Weed Optimization algorithm (IWO) it is a numerical stochastic optimization algorithm and the second is Whale Optimization Algorithm (WOA) it is an algorithm based on the intelligence of swarms and community intelligence. Invasive Weed Optimization Algorithm (IWO) is an algorithm inspired by nature and specifically from the colonizing weeds behavior of weeds, first proposed in 2006 by Mehrabian and Lucas. Due to their strength and adaptability, weeds pose a serious threat to cultivated plants, making them a threat to the cultivation process. The behavior of these weeds has been simulated and used in Invas
... Show MoreIn many applications such as production, planning, the decision maker is important in optimizing an objective function that has fuzzy ratio two functions which can be handed using fuzzy fractional programming problem technique. A special class of optimization technique named fuzzy fractional programming problem is considered in this work when the coefficients of objective function are fuzzy. New ranking function is proposed and used to convert the data of the fuzzy fractional programming problem from fuzzy number to crisp number so that the shortcoming when treating the original fuzzy problem can be avoided. Here a novel ranking function approach of ordinary fuzzy numbers is adopted for ranking of triangular fuzzy numbers with simpler an
... Show More