Patents by Inventor Murali Kodialam
Murali Kodialam has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20160294699Abstract: Various exemplary embodiments relate to a method of offline traffic matrix unaware segment routing. The method may include determining the fraction of traffic between a node i and a node j is routed though node k, by minimizing the maximum value of any link e carrying traffic between node i and node j based upon the following constraints: using a dual variable ?(e,e?) where e? is an alternate link to e? for comparison, the fraction of traffic from i to j that is routed through intermediate node k is greater than or equal to zero; the total traffic from i to j that is routed through intermediate node k is equal to 1 for all (i,j) pairs; and determining when the total capacity for link e as constrained by the dual variable is less than or equal to the capacity, c of link e? for all e?.Type: ApplicationFiled: March 30, 2015Publication date: October 6, 2016Inventors: Murali Kodialam, Randeep Bhatia, Fang Hao, T.V. Lakshman
-
Publication number: 20160294700Abstract: Various exemplary embodiments relate to a method of online segment routing in a network having an ingress node, an egress node, and a plurality of links, l. The method may include determining for a plurality of links l dual weights ?(l); receiving a new flow; determining an intermediate node k providing a minimum weight two segment path from the ingress node to egress node for the new flow based upon the flow that results on link l from the new flow through intermediate node k and the dual weight values ?(l) for the links l; and routing the new flow to the intermediate node k along the minimum weight path when the minimum weight path has a weight less than or equal to one.Type: ApplicationFiled: March 30, 2015Publication date: October 6, 2016Inventors: Murali Kodialam, Randeep Bhatia, Fang Hao, T.V. Lakshman
-
Publication number: 20160294702Abstract: Various exemplary embodiments relate to a method of offline traffic matrix aware segment routing. The method may include receiving a traffic matrix based upon all the traffic between nodes i and j that is routed in the network; and determining the amount of traffic between nodes i and j will be routed through node k, based on minimizing a maximum link utilization for the traffic matrix by determining that the total amount of flow on a link e in the network is less than the link's capacity.Type: ApplicationFiled: March 30, 2015Publication date: October 6, 2016Inventors: Murali Kodialam, Randeep Bhatia, Fang Hao, T.V. Lakshman
-
Publication number: 20160277542Abstract: In a data processing system, a received data stream comprises a plurality of tuples having respective key values. The received data stream is separated into portions that are delivered to respective ones of a first set of servers in a manner that permits different tuples having the same key value to be processed by different servers of the first set. For each distinct key value, each of at least a subset of the servers of the first set maintains a corresponding partial key result based on one or more of the tuples having that key value that are received by that server. The partial key results are periodically delivered from the servers of the first set to servers of a second set of servers in a manner that ensures that different partial key results having the same key value are processed by the same server of the second set.Type: ApplicationFiled: March 18, 2015Publication date: September 22, 2016Inventors: Randeep S. Bhatia, Murali Kodialam, T.V. Lakshman
-
Publication number: 20150332191Abstract: A capability is provided for reducing the costs of data transfers for networks using pricing heterogeneity. For data to be transferred between an application of a first network and a user device, the data may be transferred directly without using a second network or indirectly using a second network including a transfer of the data between the first network and the second network. In a network-based file system, a first network is primarily used for write requests and a second network is primarily used for read requests, and a data block is transferred from the first network to the second network based on a determination that a threshold number of read requests for the data block have been received. The determination as to when to transfer data between networks may be determined based on various costs associated with the networks.Type: ApplicationFiled: July 24, 2015Publication date: November 19, 2015Applicant: ALCATEL LUCENTInventors: Krishna P. Puttaswamy Naga, Murali Kodialam, Matteo Varvello
-
Publication number: 20150199281Abstract: A data block storage management capability is presented. A file system includes a plurality of data blocks which are managed using a first storage service and a second storage service, where the first storage service has a lower storage cost and a higher input-output cost than the second storage service. The data blocks stored using the second storage service have associated therewith respective expected storage durations indicative of respective lengths of time for which the data blocks are to be stored using the second storage service (which may be the same or different across the ones of the data blocks stored using the second storage service). The expected storage durations of the data blocks are modified based on a comparison of an expected hit rate of the second storage service and a current hit rate of the second storage service or current hit rates of the data blocks.Type: ApplicationFiled: January 20, 2015Publication date: July 16, 2015Inventors: Krishna P. Puttaswamy Naga, Murali Kodialam
-
Patent number: 9081996Abstract: The set T of all categories in a population of RFID tags is estimated within a specified error bound. For each of one or more frames, a reader broadcasts a probability p, a multiplicity d, a frame size M, and a seed value R to the present tags. A deterministic algorithm on each tag, and known to the reader, calculates (i) whether the tag will transmit in this frame, and, if so, (ii) in which slots the tag will transmit a single “1.” When the tags have responded, the reader calculates set T by initially assuming that all possible categories are in set T and then eliminating those categories that would have transmitted in those slots in which no tag transmitted. Alternatively, the reader initially assumes that set T is empty, and adds those categories that would have transmitted in those slots in which one or more tags did transmit.Type: GrantFiled: May 21, 2009Date of Patent: July 14, 2015Assignee: Alcatel LucentInventors: Murali Kodialam, Thyaga Nandagopal, Wing C. Lau
-
Publication number: 20150163157Abstract: A capability is provided for allocating and migrating cloud resources in a distributed cloud system. A cloud resource request is received and an associated cloud resource allocation is determined. The cloud resource request includes cloud resource request information. The cloud resource request information includes a cloud resource allocation parameter associated with allocation of requested cloud resources responsive to the cloud resource request and a cloud resource migration parameter associated with migration of cloud resources allocated responsive to the cloud resource request. The cloud resource allocation includes cloud resource allocation information specifying allocation of cloud resources within the cloud system responsive to the cloud resource request and cloud resource migration information specifying migration of cloud resources allocated within the cloud system responsive to the cloud resource request.Type: ApplicationFiled: December 9, 2013Publication date: June 11, 2015Applicant: Alcatel-Lucent USA Inc.Inventors: Fang Hao, Murali Kodialam, Tirunell V. Lakshman, Sarit Mukherjee
-
Patent number: 8943269Abstract: A data block storage management capability is presented. A file system includes a plurality of data blocks which are managed using a first storage service and a second storage service, where the first storage service has a lower storage cost and a higher input-output cost than the second storage service. The data blocks stored using the second storage service have associated therewith respective expected storage durations indicative of respective lengths of time for which the data blocks are to be stored using the second storage service (which may be the same or different across the ones of the data blocks stored using the second storage service). The expected storage durations of the data blocks are modified based on a comparison of an expected hit rate of the second storage service and a current hit rate of the second storage service or current hit rates of the data blocks.Type: GrantFiled: April 13, 2012Date of Patent: January 27, 2015Assignee: Alcatel LucentInventors: Krishna P. Puttaswamy Naga, Murali Kodialam
-
Publication number: 20140188656Abstract: A constrained ski-rental problem is defined. In the constrained ski-rental problem, a determination as to whether a first action having a first cost associated therewith or a second action having a second cost associated therewith is more cost effective is performed based on moment information associated with events related to the first action or the second action. The moment information may include a moment of the occurrences distribution of events related to the first and second actions. The moment information may include a moment of a number of occurrences of events related to the first and second actions, a moment of the inter-event times of occurrences of events related to the first and second actions, or the like. The moment information may include a first moment, a second moment, or the like.Type: ApplicationFiled: December 27, 2012Publication date: July 3, 2014Inventors: Krishna P. Puttaswamy Naga, Murali Kodialam, Ali Khanafer
-
Publication number: 20140089510Abstract: A capability is provided for allocating cloud and network resources in a distributed cloud system including a plurality of data centers. A request for resources is received. The request for resources includes a request for cloud resources and an indication of an amount of cloud resources requested. The request for resources also may include a request for network resources or one or more constraints. A set of feasible resource mappings is determined based on the request for resources and information associated with the distributed cloud system. A resource mapping to use for the request for resources is selected from the set of feasible resource mappings. The selected resource mapping includes a mapping of the requested cloud resources to cloud resources of one or more of the data centers and an identification of network resources configured to support communications for the cloud resources of the one or more data centers.Type: ApplicationFiled: September 27, 2012Publication date: March 27, 2014Inventors: Fang Hao, Murali Kodialam, Tirunell V. Lakshman, Sarit Mukherjee
-
Publication number: 20140067994Abstract: A capability is provided for reducing the costs of data transfers for networks using pricing heterogeneity. For data to be transferred between an application of a first network and a user device, the data may be transferred directly without using a second network or indirectly using a second network including a transfer of the data between the first network and the second network. In a network-based file system, a first network is primarily used for write requests and a second network is primarily used for read requests, and a data block is transferred from the first network to the second network based on a determination that a threshold number of read requests for the data block have been received. The determination as to when to transfer data between networks may be determined based on various costs associated with the networks.Type: ApplicationFiled: August 29, 2012Publication date: March 6, 2014Inventors: Krishna P. Puttaswamy Naga, Murali Kodialam, Matteo Varvello
-
Publication number: 20130290539Abstract: Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving, at the cloud controller, a request message including a first request for a first cloud resource; identifying a set of potential devices for providing the first cloud resource; calculating a plurality of weight values corresponding to at least a portion of the set of potential devices for providing the first cloud resource, wherein the plurality of weight values are calculated based on a plurality of delta values associated with the at least a portion of the set of potential devices; selecting a device based on the plurality of weight values to provide the first cloud resource; and updating the delta value associated with the selected device.Type: ApplicationFiled: April 30, 2012Publication date: October 31, 2013Applicant: Alcatel-Lucent USA Inc.Inventors: Murali Kodialam, Fang Hao, T.V. Lakshman, Sarit Mukherjee
-
Patent number: 8566373Abstract: A data-leakage prevention capability is presented herein. The data-leakage prevention capability prevents leakage of data, of a file set having a plurality of files, from a secure network using online fingerprint checking of data flows at a boundary of the secure network. The online fingerprint checking is performed using a set of data structures configured for the file set. The data structures for the file set are configured based on file set characteristics information of the file set and a target detection lag indicative of a maximum number of bits within which a data leakage event for the file set is to be determined. The data structure configuration is computed for a plurality of data structures configured for use in monitoring the files of the file set. The data structure configuration includes a plurality of data structure locations and data structure sizes for the respective plurality of data structures.Type: GrantFiled: February 7, 2012Date of Patent: October 22, 2013Assignee: Alcatel LucentInventors: Fang Hao, Krishna P. Puttaswamy Naga, Murali Kodialam, Tirunell V. Lakshman
-
Publication number: 20130275669Abstract: A data block storage management capability is presented. A file system includes a plurality of data blocks which are managed using a first storage service and a second storage service, where the first storage service has a lower storage cost and a higher input-output cost than the second storage service. The data blocks stored using the second storage service have associated therewith respective expected storage durations indicative of respective lengths of time for which the data blocks are to be stored using the second storage service (which may be the same or different across the ones of the data blocks stored using the second storage service). The expected storage durations of the data blocks are modified based on a comparison of an expected hit rate of the second storage service and a current hit rate of the second storage service or current hit rates of the data blocks.Type: ApplicationFiled: April 13, 2012Publication date: October 17, 2013Inventors: Krishna P. Puttaswamy Naga, Murali Kodialam
-
Publication number: 20130204903Abstract: A data-leakage prevention capability is presented herein. The data-leakage prevention capability prevents leakage of data, of a file set having a plurality of files, from a secure network using online fingerprint checking of data flows at a boundary of the secure network. The online fingerprint checking is performed using a set of data structures configured for the file set. The data structures for the file set are configured based on file set characteristics information of the file set and a target detection lag indicative of a maximum number of bits within which a data leakage event for the file set is to be determined. The data structure configuration is computed for a plurality of data structures configured for use in monitoring the files of the file set. The data structure configuration includes a plurality of data structure locations and data structure sizes for the respective plurality of data structures.Type: ApplicationFiled: February 7, 2012Publication date: August 8, 2013Inventors: Fang Hao, Krishna P. Puttaswamy Naga, Murali Kodialam, Tirunell V. Lakshman
-
Publication number: 20120136846Abstract: Example embodiments are directed to methods of hashing for networks and systems thereof. At least one example embodiment provides a method of processing elements in a system. The method includes receiving a first element, generating a first plurality of hash values based on the first element and a first plurality of hash functions, determining a first plurality of buckets in a table based on the first plurality of hash values, each of the first plurality of buckets associated with a different one of the hash values, selecting one of the first plurality of buckets, storing a first associated value in the selected bucket, the first associated value being associated with the first element, and encoding an identifier (ID) of the hash function generating the hash value associated with the selected bucket into a filter based on the hash value.Type: ApplicationFiled: November 30, 2010Publication date: May 31, 2012Inventors: Haoyu SONG, Murali KODIALAM, Fang HAO, T.V. LAKSHMAN
-
Patent number: 8179898Abstract: Packets are processed (e.g., routed or classified) in accordance with a braided trie, which represents the combination of two or more different original tries (e.g., representing different forwarding/classification tables). The different tries are combined by twisting the mappings for specific trie nodes to make the shapes of the different tries more similar. Each node in the braided trie contains a braiding bit for at least one original trie indicating the mapping for that trie's node. Trie braiding can significantly reduce the number of nodes used to represent the different original tries, thereby reducing memory usage and improving scalability. Braided tries can be used for such applications as virtual routers and packet classification in which different forwarding/classification tables are represented by a single braided trie stored in shared memory.Type: GrantFiled: June 11, 2009Date of Patent: May 15, 2012Assignee: Alcatel LucentInventors: Haoyu Song, Murali Kodialam, Fang Hao, Tirunell V. Lakshman
-
Patent number: 8054760Abstract: A line-rate, real-time-traffic detector classifies a network traffic flow as real-time when it determines the smoothness of the packet arrival rate of the network traffic flow is bounded by an empirically derived bound. In some embodiments, to improve performance, a tighter smoothness bound is applied to the smoothness calculations performed on a first set of packet arrival times, while a looser smoothness bound is applied to a second set of packet arrival times, the second set inclusive of and larger than the first.Type: GrantFiled: August 19, 2009Date of Patent: November 8, 2011Assignee: Alcatel LucentInventors: Fang Hao, Murali Kodialam, Tirunell V. Lakshman
-
Publication number: 20110044201Abstract: A line-rate, real-time-traffic detector classifies a network traffic flow as real-time when it determines the smoothness of the packet arrival rate of the network traffic flow is bounded by an empirically derived bound. In some embodiments, to improve performance, a tighter smoothness bound is applied to the smoothness calculations performed on a first set of packet arrival times, while a looser smoothness bound is applied to a second set of packet arrival times, the second set inclusive of and larger than the first.Type: ApplicationFiled: August 19, 2009Publication date: February 24, 2011Applicant: Alcatel-Lucent USA Inc.Inventors: Fang Hao, Murali Kodialam, T. V. Lakshman