International Journal of Advanced Networking and Applications

4125-4141

Authors: Esraa A. Afify, Mona A. Kadry

Customer Complaints are considered vital and significant information that can be utilized to attain customers’ satisfaction. Consequently, establishing a complaint handling system is essential towards addressing customer dissatisfaction and preventing similar problems from reoccurring. The main objective of this paper is to investigate the degree of association between customers’ complaint behaviors and their complaints about the goods or services they get. Therefore, the paper proposes a generic approach for the Customer Complaint Management System that can be effective in reducing customers’ complaints through urging customers to participate in controlling the quality of the services or goods offered to them. The "Service" has been used to connect different databases from different platforms to retrieve certain data. The system starts by discussing the service implementation with the web-application interface development. Afterward, the "Service" is used to connect the three main Services used in the proposed e-complaint web service. These services have been explored to obtain the Citizen and Staff data and find out about how they are working. Then, they have been implemented in the web application, each according to the operation that calls the service to restore certain data. Moreover, the most important reports extracted from the evaluation results have also been explored. For implementing the model, a web application has been developed to exhibit both the ability of the model and the efficiency in e-Gov, since that web application could be developed thoroughly. It was supposed that to complete the e-complaint system cycle, there is a need for five modules to implement this cycle; the first module is related to the "Citizen" who wants to fill his/her complaint; the second is the "Admin" who manages the system users; the third is the "Agent" who will handle the Citizen complaints; the fourth is the "Staff" who will analyze the causes and actions of each complaint; and the fifth module is the "Supervisor" who views the overviews reports and takes decisions for improvements.

4150-4154

Authors: Sannia; Varsha

Routing in wireless sensor network is a key challenge. The appropriate routing is done in wsn by using swarm intelligence approach. Various swarm intelligence techniques are available like ant colony optimization, particle swarm optimization, artificial bee colony optimization etc. But hybrid approach of TABU and PSO is a promising one. The integration of TS to PSO allows algorithm to sustain the population diversity and avoiding directing to misguiding local optima. Average energy consumption is high in TS as comparison with PSO and less calculation time is utilized in TS than PSO. The output of the experiment show that the optimize algorithm not only reduce the number of paths but also finding the shortest path at the place of largest path. The simulation result shows that combination of TABU-PSO performs better than Energy Efficient PSO in terms of dead nodes, alive nodes and throughput of the network.

4162-4170

Authors: Dilip Rathod; Dr. Girish Chowdhary

The Internet of Things (IoT) extends the Internet wherein real world things are part of a computing network. The IoT has seen exponential growth and according to Cisco prediction about 50 billion devices will be connected by 2020. Handling this massive scale is challenging research issue. In this paper, we use cloud-fog-edge based IoT middleware for distributed IoT service provisioning. We model IoT middleware using queueing network, perform analytical analysis of IoT middleware components. Followed by dynamic scaling algorithm which considers contention and coherency as limiting factors for scalability. It is used for quantitative analysis of IoT middleware with the increasing workload. The scalability function was evaluated using the simulation for important performance and scalability parameters namely throughput, CPU utilization and response time. It is observed that because of contention and coherency overhead, the proposed approach is able to scale sub-linearly which is practical compared ideal scalability of multi-server queueing network and not very restrictive as given universal scalability law(USL) applied for tightly coupled systems.

4177-4183

Authors: Saurabh Gupta; Sangeeta Rani; Dr. Amit Dixit; Dr. Harsh Dev

The delivery of Cloud computing is a method for delivering information /services in which resources are retrieved from the Internet through web-based tools and applications, as opposed to a direct connection to a server rather than keeping files on a proprietary hard drive or local storage device. We have studied a lot of algorithm for reducing the response time of load balancing algorithm in cloud computing environment. We also measured the execution time of different algorithms. In this paper we will compare execution time, processing time of data center, response time of various algorithms.