Abstract To support multi-source data stream generated from Internet of Things devices, edge computing emerges as a promising pattern with low latency and high bandwidth compared to cloud computing. enhance the performance within limited communication computation resources, we study cloud-edge-end architecture, where one server multiple computational access points can collaboratively process co...

In cellular networks, channels must be assigned to call requests so that interference constraints are respected and bandwidth is minimized. The number of call requests per cell is continually changing, making channel assignment naturally an online problem. We describe two new online channel assignment algorithms for networks based on a regular hexagonal layout of cells, where interference level...

The access privileges in distributed systems are often organized as a hierarchy structure. Chien and Jan proposed an efficient hierarchical key assignment scheme without using the public key cryptosystem in 2003. Nevertheless, their scheme must use the smart card and the information published on the public board contains the essential secrets of the server and the corresponding users. We theref...

This paper analyzes and compares role-based access control (RBAC) features supported in the most recent versions of three popular commercial database management systems: Informix Online Dynamic Server Version 7.2, Oracle Enterprise Server Version 8.0 and Sybase Adaptive Server Release 11.5. We categorize RBAC features under three broad areas: user role assignment, support for role relationships...

The ability to execute remote operations on a storage server promises to reduce the bandwidth requirements between storage servers and clients. This contribution proposes a computer-aided parallelization (CAP) framework for creating parallel applications running on a multiprocessor multidisk storage server. Parallel operations are specified as a schedule of sequential operations with clearly de...

For a Markovian queueing network with two stations in tandem, finite intermediate buffer, and M flexible servers, we study how the servers should be assigned dynamically to stations in order to obtain optimal long-run average throughput. We assume that each server can work on only one job at a time, that several servers can work together on a single job, and that the travel times between statio...

Differentiated service has been proposed as a potential solution for bandwidth allocation and expected to be supported in the next generation Internet. However, a service differentiating Internet with best-effort servers may not meet the overall goals of the differentiated service. In this paper, approaches and performance issues on providing differentiated services from an Internet server are ...

Maintaining the availability of critical servers and routers is an important concern for many organizations. At the lowest level, IP addresses represent the global namespace by which services are accessible on the Internet. We introduce Wackamole, a completely distributed software solution based on a provably correct algorithm that negotiates the assignment of IP addresses among the currently a...

A server for an interactive distributed multimedia system may require thousands of gigabytes of storage space and high I/O bandwidth. In order to maximize system utilization, and thus minimize cost, the load must be balanced among the server’s disks, interconnection network and scheduler. Many algorithms for mnvim;hnn ~ot~;~~,nl rnmnr;fw f-nm fho ctnvwno cwrfom “Y”LY”YY”Y,“y ,I,*, YYYW” ““y”cYY...

In this model we propose Algorithm to optimize the performance of the distributed systems over the internet. Their consist of large number of clients and servers. The servers consist of large number of clients for this the load is increases on the server to process the data. Here the goal of our proposed system is to assign the clients to the servers and reduce the load on server and minimize t...