A recursive method for constructing uniquely decodable codes for overloaded synchronous CDMA systems, Where large signature codes With groWing overloading factors are reconstructed from the small ones. A class of uniquely decod able signature matrices (or encoders) for overloaded synchro nous CDMA are also devised. A decoder for synchronous CDMA systems to extract the user data by a number of c...

One major concern for mobile networks consists of finding efficient ways of handling user mobility so that the handover process has minimum effect on users’ ongoing sessions. Although COAP provides an efficient way for mobility management in IEEE 802.11 wireless mesh networks, it does not control load among multiple MAPs in the network. Thus, in many cases, the attached MAP is overloaded, and e...

1. Problem Statement Why discover bottleneck links? The ability to identify overloaded network links has utility for both network operators as well as end-users. For network operators, access to an up-to-date snapshot of overloaded links can help quickly detect outages. Continual monitoring of overloaded links can also help verify the efficacy of load-balancing mechanisms used at the edges of a...

We consider extending a functional database language to support subtyping, inheritance and method overloading. We do so by extending previous work on type inference with subtypes for the pure calculus to cater for structured types, ML-style parametric polymorphism and overloaded function deenitions. We attach semantics to overloaded functions by developing a generalisation of best-t pattern-mat...

Load managing method on road became necessary since overloaded vehicles occur damage on road facilities and existing systems for preventing this damage still show many problems.Accordingly, efficient managing system for preventing overloaded vehicles could be organized by using the road itself as a scale by applying genetic algorithm to analyze the load and the drive information of vehicles.The...

In order to meet their temporal constraints, current applications such as Web-based services and electronic commerce use the technique of data replication. To take the replication benefit, we need to develop concurrency control mechanisms with high performance even when the distributed system is overloaded. In this paper, we present a protocol that uses a new notion called importance value whic...

web servers, session-based workload, performance, simulation, overloaded server, admission control mechanism, web quality of service In this paper, we introduce a new, session-based workload for measuring a web server performance. We define a session as a sequence of client's individual requests. We then measure server throughput as a number of successfully completed sessions. Using a simulatio...

In present days cloud computing is one of the greatest platform which provides storage of data in very lower cost and available for all time over the internet.But it has more critical issue like security, load management and fault tolerance. In this paper we are discussing Load Balancing approach. Many types of load concern with cloud like memory load, CPU load and network load. Load balancing ...

EDF (Early Deadline First) algorithm is a very important scheduling algorithm for realtime systems . The EDF algorithm assigns priorities to each job according to their absolute deadlines and has good performance when the real-time system is not overloaded. When the real-time system is overloaded, many misdeadlines will be produced. But these misdeadlines are not uniformly distributed, which us...

Many applications need to solve the deadline guaranteed packet scheduling problem. However, it is a very difficult problem if three or more deadlines are present in a set of packets to be scheduled. The traditional approach to dealing with this problem is to use EDF (Earliest Deadline First) or similar methods. Recently, a non-EDF based algorithm was proposed that constantly produces a higher t...