One of the major challenges in next-generation Internet is to allocate services to nodes in the network. This problem, known as the service placement problem, can be solved by layered graph approach. However, due to the existence of resource bottleneck, the requests are rejected from the beginning in the resource constrained network. In this paper we propose two iterative algorithms for efficie...

This paper presents a new mathematical model of AIMD (Additive Increase Multiplicative Decrease) TCP for general networks that we believe is better than those previously used when it is driven by bottleneck capacities. Extending the paper by Edmonds, Datta, and Dymond that solves the single bottleneck case, we view AIMD as a distributed scheduling algorithm and prove that with extra resources, ...

Complex vision tasks, e.g., face recognition or wavelet based image compression, impose severe demands on computational resources to meet the real-time requirements of the applications. Clearly, the bottleneck in computation can be identified in the first processing steps, where basic features are computed from full size images, as motion cues and Gabor or wavelet transform coefficients. This p...

The divergent predictions of 2 models of dual-task performance are investigated. The central bottleneck and central capacity sharing models argue that a central stage of information processing is capacity limited, whereas stages before and after are capacity free. The models disagree about the nature of this central capacity limitation. The central bottleneck model claims that central processin...

The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...

This paper gives some opinions about grid bottleneck problem, and makes some suggestions about grid structure. It also introduces how to construct the global grid with sub grids, and to make use of the advantages of administrative hierarchy. The paper presents the conceptions of static resources, dynamic resources and the ways of scheduling resources. Also, the functions of resource marketplace...

With CAD/CAM technology moving from myth to mainstream applications, most foundries are caught between change and survival. This is especially true in the case of small and medium foundries. This paper attempts to answer the question: “Is CAD/CAM necessary and economically justifiable for small and medium foundries?” by focussing on four aspects: key developments, benefits, bottlenecks and stra...