Hierarchy-aware distributed overlays in data centers using DC2

Nagaraj, Karthik; Khandelwal, Hitesh; Killian, Charles; Kompella, Ramana Rao

doi:10.1109/comsnets.2012.6151314

Cited by 10 publications

(10 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Trie node starts with the root node containing an array of number with size 10, which has numbers from 0 to 9. When a file name is given by the user, a unique hash key value will be generated, and a corresponding hash value will be stored in the tree structure starting from the root node …”

Section: The Proposed Methodsmentioning

confidence: 99%

“…When a file name is given by the user, a unique hash key value will be generated, and a corresponding hash value will be stored in the tree structure starting from the root node. [16][17][18][19] For example, in the case of numeric keys, each node has an array of ten pointers to its branches, one for each of the ten numbers. The keys as file names are stored in the leaf nodes.…”

Section: Digit Compact Prefix Insertion and Searchingmentioning

confidence: 99%

See 1 more Smart Citation

File retrieval and storage in the open source cloud tool using digital bipartite and digit compact prefix indexing method

Ponnuswamy

Priya

Shabariram

2019

Concurrency and Computation

View full text Add to dashboard Cite

Summary Cloud computing plays a major role in data centers, and its important services are used by the data centers. Data centers are large number of computers that are interrelated to make the cloud services available. Data centers are increasing nowadays to provide a platform to store files, data applications, etc. Data centers with large storage capacity are the foundation for cloud computing services such as web searching and network storage. Data traffic takes place within and outside the data centers and needs to forward data between servers in the network. In this paper, a new method called digital bipartite and digit compact prefix with hashing technique is used to store and retrieve data in the cloud. The idea is to create a volume of storage for a user within the data center to store their files. Digital bipartite and Digit compact prefix are implemented to store and retrieve the user files efficiently. The implementation is done in OpenStack with a multinode setup. The proposed method compares the insertion time, search time, and throughput with the number of nodes, the number of compute instances, and the number of files for the two algorithms.

show abstract

Section: The Proposed Methodsmentioning

confidence: 99%

Section: Digit Compact Prefix Insertion and Searchingmentioning

confidence: 99%

File retrieval and storage in the open source cloud tool using digital bipartite and digit compact prefix indexing method

Ponnuswamy

Priya

Shabariram

2019

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…Paths through the highest layer of the tree may even be 240:1 oversubscribed [8,13]. The large oversubscription introduced in current electronic data center network designs fragments the server pool by preventing idle servers from being assigned to services.…”

Section: Challenges Of Data Center Networkingmentioning

confidence: 99%

Optical Switching in Next Generation Data Centers

Testa¹,

Pavesi²

2018

View full text Add to dashboard Cite

This thesis presents advanced optical connectivity solutions for next-generation data centers, spanning millions of processing cores. The wavelength routing of optical packets based on arrayed waveguide gratings (AWGs), tunable wavelength converters (TWCs), and fiber delay lines (FDLs) is a disruptive technology for capacity, footprint, and flexibility requirements of massive cloud data centers. We develop a wavelength-division multiplexed (WDM) design based on Birkhoff-von Neumann architecture as a bitrate transparent, scalable solution to switching bottlenecks in data center networks. As no mature all-optical buffering technology is currently available, central to our design is the buffering strategy that we adopt to store contending packets. Due to the limited number of FDLs, packet drops are common in optical packet switching (OPS) data centers and limit the network throughput. In a practical scenario, physical layer impairments, predominantly amplified spontaneous emission (ASE) noise and crosstalk, degrade Q-factor and lead to additional packet drops. To examine the performance of optical buffer units more accurately, we develop a unified analysis framework, integrating the network layer and the physical layer effects. Using this framework, we refine our architectures and provide guidelines for minimizing the physical layer impact. Besides, optical switch designs should not neglect the diversity of data center traffic patterns when developing connectivity solutions. Empirical studies of data center network traffic reveal that server traffic exhibits strong spatial and temporal correlations. We examine the effectiveness of an AWG-based load balancer with round-robin tuning TWCs in resolving congestion penalties in the data center network. Our cross-layer analysis suggests that the physical layer impairments due to the load balancer hardware could counteract its potential gains and lead to significant throughput degradation. To resolve this challenge, we develop a novel modular router architecture based on WDM shared recirculation buffers that integrates the functions of load balancing and routing and maximizes the optical buffering gains. The router employs a load-balancing scheduler to maximize throughput and minimize delay. Our mathematical analysis and Monte Carlo simulations show that the consolidation of optical buffer slots into WDM FDLs accompanied with internal load balancing leads to a virtually lossless router, resilient to data center traffic anomalies.ii

show abstract

“…Procedure CHECK-CAPABILITY(e W axay , e W auat ) 1: for all a ∈ Sa uat do 2: if the capability constraint of access point a is not satisfied then 3…”

Section: Algorithm 2 Node Joiningmentioning

confidence: 99%

“…For distributed execution engines such as MapReduce [2], the master node assigns tasks to a group of servers for cooperative computations. In social networks (e.g., Facebook, Twitter, etc) [3], users frequently share their messages, photos and videos with their friends, and group communications are also needed. In group communications, a source node has to transmit one copy of the data to multiple destination nodes.…”

Section: Introductionmentioning

confidence: 99%

Efficient Multicast Delivery for Data Redundancy Minimization Over Wireless Data Centers

Chuang

Pang

et al. 2016

IEEE Trans. Emerg. Topics Comput.

View full text Add to dashboard Cite

With the explosive growth of cloud-based services, large-scale data centers are widely built for housing critical computing resources to gain significant economic benefits. In data centers, the cloud services are generally accomplished by multicast-based group communications. Recently, many well-known industries, such as Microsoft, Google, and IBM, adopt highspeed wireless technologies to augment network capacity in data centers. However, those well-known multicast delivery schemes for traditional wired data centers do not consider the unique characteristics of wireless communications, which may result in unnecessary data transmissions and network congestions. Under the coexisting scenario of wired and wireless links, this paper studies multicast tree construction and maintenance problems. The objective is to minimize the total multicast traffic. We prove the problems are N P-hard and propose efficient heuristic algorithms for the two problems. Based on real traces and practical settings obtained from commercial data centers, a series of experiments are conducted, and the experimental results show that our proposed algorithms are effective for reducing multicast data traffic. The results also provide useful insights into the design of multicast tree construction and maintenance for wireless data center networks.

show abstract

Hierarchy-aware distributed overlays in data centers using DC2

Cited by 10 publications

References 14 publications

File retrieval and storage in the open source cloud tool using digital bipartite and digit compact prefix indexing method

File retrieval and storage in the open source cloud tool using digital bipartite and digit compact prefix indexing method

Optical Switching in Next Generation Data Centers

Efficient Multicast Delivery for Data Redundancy Minimization Over Wireless Data Centers

Contact Info

Product

Resources

About