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.
This paper addresses the problem of cloud and networking resources mapping in distributed and hybrid cloud environments. In this context private and public resources are acquired and combined to set up tenant dedicated virtual infrastructures to fulfil distributed applications requirements. An exact algorithm is proposed to map jointly nodes and links of the requested virtual infrastructure graph...
Server security is necessary to avoid all attack that will happen. IPS (Intrusion Prevention System) is an example of right solution for the security system. IPS can prevent an attack by using the IDS (Intrusion Detection System) and firewall features. In this paper, bro IPS on the server will be tested with some attack include DOS (Denial of Service), port scanning, and ftp brute force to ensure...
High throughput is of particular interest in data center and HPC networks. Although myriad network topologies have been proposed, a broad head-to-head comparison across topologies and across traffic patterns is absent, and the right way to compare worst-case throughput performance is a subtle problem. In this paper, we develop a framework to benchmark the throughput of network topologies, using a...
Information-centric networking has been proposed to achieve efficient and reliable distribution of content. We propose a model to assign content locators to content names. Information routing decision is made based on geometric routing using the assigned locators. We consider a geometric routing scheme known as geodesic geometric routing. We demonstrate on the iLab.t virtual wall the successful operation...
Advances in data intensive computing and high performance computing facilitate rapid scaling of data center networks, resulting in a growing body of research exploring new network architectures that enhance scalability, cost effectiveness and performance. Understanding the tradeoffs between these different network architectures could not only help data center operators improve deployments, but also...
Content-Centric Networking (CCN) is a promising framework for evolving the current network architecture, advocating ubiquitous in-network caching to enhance content delivery. Consequently, in CCN, each router has storage space to cache frequently requested content. In this work, we focus on the cache allocation problem: namely, how to distribute the cache capacity across routers under a constrained...
The capability to analyze systems and applications is commonly needed in data centers to address diverse problems such as root cause analysis of performance problems and failures, investigation of security attack propagation, and problem determination for predictive maintenance. Such analysis is typically facilitated by a hodgepodge of procedural code and scripts representing heuristics to be applied,...
Data center networks (DCNs) are inherently failure-prone owing to the existence of many links, switches and servers. Many times the failures of the components may be correlated resulting a set of connected components failing together. This correlated failure behaviour could be captured through the use of fault regions [1]. This paper explores the effect of such failures in DCNs, using four topologies,...
The Internet Autonomous System (AS) topology has important implications on end-to-end routing, network economics and security. Despite the significance of the AS topology research, it has not been possible to collect a complete map of the AS interconnections due to the difficulties involved in discovering peering links. The problem of topology incompleteness is amplified by the increasing popularity...
We present an evaluation of the fault-tolerance characteristics of several important data center network topologies, including Fat-tree, DCell, HyperBCube and BCube using several metrics, including average path length, aggregated bottleneck throughput and connection failure ratio. These enable us to present an objective comparison of the network topologies under faulty conditions.
Designing data centers with adequate performance and at the right scale is a difficult task. The load in terms of network and CPU utilization is hard to estimate without appropriate tools. In this paper we introduce a data center performance estimation system which can support planning data centers and application deployments. The tool takes data center topologies and applications and calculates the...
Network topology information of peer-to-peer applications is useful for examining their characteristics as well as defining an accurate model to simulate their behaviors. Unfortunately, dynamic behaviors of peers such as join and leave make it difficult to obtain the accurate network topology information. In this paper, we propose a method to accurately measure the topology of a Winny network even...
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.