The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we describe a global scale cluster system that we designed. The global scale cluster system is a part of "Cost Effective and Large Scale Global Internet Service Solution" project named GLORY(global resource management system for future Internet services) that was started to support global Internet Data Centers (IDCs) centers using up to 1,000,000 PC's clusters. It includes...
Network graphs, in general, successfully model a wide variety of interactions and relationships among entities, including both physical and logical connections. In this work, we study the problem of mapping a logical network on to a physical network; such a problem arises in various scenarios, for example, assignment of virtual machines on to physical servers in cloud computing, assignment of services...
In this paper we study an optimal server allocation problem, where a single server is shared among multiple queues based on the queue backlog information. Due to the physical nature of the system this information is delayed, in that when the allocation decision is made, the server only has the backlog information from an earlier time. Queues have different arrival processes as well as different buffering/holding...
The current Internet is vulnerable to attacks and failures. The past events have illustrated the Internet's vulnerability to distributed denial of service (DDoS) attacks. This paper proposes a general, and not attack specific, defense strategy through pushback and resource regulation to mitigate the effect of such attacks. Routers cooperate with victim in implementing the defense strategy. Pushback...
Recently, there has been much interest in building stream processing applications. In these typical applications, data are usually unbounded, continuous, huge in amount, fast arriving, time various and out bursting. Delays in data stream processing are very difficult to control because of the outbursting of data incoming and the unpredictable pattern of resource consumption. In order to implement...
In this paper we describe how the grid computing resource brokering approach, classically divided into matchmaking discovery and optimize selection, is applied to five dimensional environmental data distribution. This result is achieved thanks to the integration of a resource broker service we developed from scratch. This service implements the key feature of autonomic mapping of Globus toolkit index...
Recently, many geographic information systems (GIS) utilize peer-to-peer (P2P) systems to overcome the current problems with client/server GIS systems such as non-scalability, high bandwidth requirement and single point of failure. In this paper, we propose an efficient scheme to support efficient range query processing over structured P2P systems, while balancing the storage load. The paper proposes...
Service-oriented architectures can be used to provide multiple simultaneous sessions to users that wish to communicate over a variety of media. This gives rise to rich, highly effective communication sessions that can greatly enhance userspsila interaction. For example, a health services virtual organization seeks to use such tools for a variety of purposes: virtual patient simulation, anatomical...
To solve the FTP server-clusterpsilas global balancing problem, this paper proposes a novel load balancing scheme, including the choice of FTP load balancing strategies and the construct of the uniform distributed platform which is implemented by JXTA. The paper adopts the self-adaptive FTP load balancing strategy, called global-local-secondary global, to schedule the download requests of clients...
The PSC has developed a prototype distributed file system infrastructure that vastly accelerates aggregated write bandwidth on large compute platforms. Write bandwidth, more than read bandwidth, is the dominant bottleneck in HPC I/O scenarios due to writing checkpoint data, visualization data and post-processing (multi-stage) data. We have prototyped a scalable solution that will be directly applicable...
Collaborative design is a new technique for mechanical design. Multi-agent system (MAS) can cooperate with others to solve problems by network of software agents. Collaborative design system includes design agent, manage agent, conflict resolution agent and so on. A method based on MAS is present to solve the resource finding among agents. Firstly, the relationship between multi-agent systems and...
Distributed hash tables (DHT) with order-preserving hash functions require load balancing to ensure an even item-load over all nodes. While previous item-balancing algorithms only improve the load imbalance, we argue that due to the cost of moving items, the competing goal of minimizing the used network traffic must be addressed as well. We aim to improve on existing algorithms by augmenting them...
The purpose of Grid monitoring and management is to monitor services in Grid environment for fault detection, performance analysis, performance tuning, load balancing and scheduling. This paper emphasis on presenting a new framework namely iNet-Grid deployed for Grid monitoring and troubleshooting purposes. The iNet-Grid is integrated on top of Ganglia. iNet-Grid has been tested and successfully accomplished...
In unstructured P2P content distribution systems, the most important algorithms to ensure optimal flow of content along multiple dynamically created distribution trees are piece selection algorithms and load balancing algorithms. This paper models practical load balancing algorithms and derives a number of insights.
A service provisioning system is examined, where a number of servers are used to offer different types of services to paying customers. A customer is charged for the execution of a stream of jobs; the number of jobs in the stream and the rate of their submission is specified. On the other hand, the provider promises a certain quality of service (QoS), measured by the average waiting time of the jobs...
Multicore processors promise continued hardware performance improvements even as single-core performance flattens out. However they also enable increasingly complex application software that threatens to obfuscate application-level performance. This paper applies operational analysis to the problem of understanding and predicting application-level performance in parallel servers. We present operational...
In this paper, we consider a single-server queue with Poisson inputs and two distinct service rates. The service rate employed at any given instant is decided by a resource allocation policy, based on the queue occupancy. We deal with the question of how often control information needs to be sent to the rate scheduler so as to stay below a certain probability of congestion. We first consider some...
It is the responsibility of an e-commerce provider to provision resources to ensure that the performance of the services provided by an e-commerce application is acceptable. A quantitative estimate of the performance expected from the site, obtained from the expected workload imposed on the application, may allow the provider to make informed decisions with respect to the right level of resources...
A link load balancing technique that uses a normalized link metric based on a new wavelength utilization and link metric is proposed. The new normalized link metric is a combination of a previous link metric and wavelength utilization. The shortest path algorithm selects the lowest normalized link metric, so that heavily loaded links are avoided if possible. Due to the development of WDM optical network...
Replica placement problem is to select a subset from a group of potential nodes to put replicas in Content Distribution Network (CDN). It is derived from the set cover problem which is known to be NP-hard. So it is difficult to calculate the large-scale replica placement problem on a program counter-based processor. Several greedy algorithms are proposed in order to decrease calculation time. However,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.