Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Cascaded I/O shipping based on shortest (latency & load) path to destination node and further optimizations, in a flexible-storage-sharing clustered environment.

IP.com Disclosure Number: IPCOM000230961D
Publication Date: 2013-Sep-20
Document File: 5 page(s) / 360K

Publishing Venue

The IP.com Prior Art Database

Related People

Pankaj Tandon: INVENTOR

Abstract

Form and persistently store a weighted graph of nodes in the cluster. Where nodes are vertices, links are edges and latency & current load evaluates weight of the edges. For every I/O shipping request, find out the shortest latency (& load, pending I/O shipping requests) path to target node and/or any overlapping sub paths for writes to mirrors (especially campus cluster setup), then do cascaded I/O shipping. Refresh the graph based on events or/and periodically.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 53% of the total text.

Page 01 of 5

Cascaded I/O shipping based on shortest (latency & load) path to destination node and further optimizations, in a

flexible-storage-sharing clustered environment.

  Pankaj Tandon Symantec Corporation

Abstract

Form and persistently store a weighted graph of nodes in the cluster. Where nodes are vertices, links are edges and latency & current load evaluates weight of the edges. For every I/O shipping request, find out the shortest latency (& load, pending I/O shipping requests) path to target node and/or any overlapping sub paths for writes to mirrors (especially campus cluster setup), then do cascaded I/O shipping. Refresh the graph based on events or/and periodically. Copyright © 2013 Symantec Corporation. All rights reserved.

1


Page 02 of 5

Copyright © 2013 Symantec Corporation. All rights reserved. Symantec and the Symantec Logo are trademarks or registered trademarks of Symantec Corporation or its affiliates in the U.S. and other countries. Other names may be trademarks of their respective owners. For a full list of Symantec trademarks, please visit http://www.symantec.com/about/profile/policies/trademarks/currentlist.jsp

Any Symantec products described in this document are distributed under licenses restricting their use, copying, distribution, and decompilation/reverse engineering. No part of this document may be reproduced in any form by any means without prior written authorization of Symantec Corporation and its licensors, if any.

THE DOCUMENTATION IS PROVIDED "AS IS" AND ALL EXPRESS OR IMPLIED CONDITIONS, REPRESENTATIONS AND WARRANTIES, INCLUDING ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT, ARE DISCLAIMED, EXCEPT TO THE EXTENT THAT SUCH DISCLAIMERS ARE HELD TO BE LEGALLY INVALID. SYMANTEC CORPORATION SHALL NOT BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES IN CONNECTION WITH THE FURNISHING, PERFORMANCE, OR USE OF THIS DOCUMENTATION. THE INFORMATION CONTAINED IN THIS DOCUMENTATION IS SUBJECT TO CHANGE WITHOUT NOTICE.

Symantec Corporation 350 Ellis Street Mountain View, CA 94043 United States

http://www.symantec.com 2

Copyright © 2013 Symantec Corporation. All rights reserved.


Page 03 of 5

Cascaded I/O shipping based on shortest (latency & load) path to destination node and further optimizations, in a flexible-storage-sharing clustered environment.

Problem Statement

DESCRIPTION:

Flexible Storage Sharing:

This feature enables network sharing of local storage, cluster wide. Local storage can be in the form of Direct Attached Storage (DAS) or internal disk drives. The network sharing of storage is enabled through the use of a network interconnect between the nodes of the cluster. The feature allows network shared storage to co-exist with physically shared storage - hence the name "Flexible Storage Sharing".

Campus Cluster:

In campus cluster, hosts and stora...