aboutsummaryrefslogtreecommitdiffstats
path: root/aai-schema/src/main/resources/onap/oxm/v15
AgeCommit message (Collapse)AuthorFilesLines
2019-02-13Remove the aai-schema from aai-commonHarish Venkata Kajur1-8654/+0
Issue-ID: AAI-1871 Change-Id: I0d836c8105083f511877f74f08044cc86905e7be Signed-off-by: Harish Venkata Kajur <vk250x@att.com>
2018-12-05Improve the performance of resoures microservice1.4.0Kajur, Harish (vk250x)1-2/+2
Currently the findSubGraph is being invoked and causing additional calls to the database by backing a tree backed vertex and slowing the performance of GET ALLs Original intention of both of them was to pre fetch depth 0, 1, and 2 at once so we don't have to get them at each depth but since that was not done right there is extra amount of time After the aai-uri migration to ensure all vertexes have the aai-uri and also to make sure they are unique across graph we don't need to traverse a vertex to find the parents to build aai-uri it was done previously when there was no aai-uri to derive the uri of a given vertex and its not necessary anymore so there would be performance improvements of vserver when there are a lot of relationships Currently the edge labels are retrieved for each vertex a and b and the performance of the GET with relationships will be propotional to the GET request and how many cousin edges it has and the more cousin edges there are the more slower the response time will be as for each cousin vertex its trying to get the edge in between so the code is modified to only go to the database for the edge label when there are multiple edge labels (cousin edges) between a and b If there are only one edge label and its a cousin vertex then we can use the edge rule to be able to figure out the edge label Improve PUT on the cloud region by modifying the getEdgesBetween method which currently was retrieving all the parent child edges between a and b and then only using the first edge The traversal itself was too complicated and was costly in terms of database retrieval and calls and optimized the code to utilize the edge information so we can modify the query to db at runtime based on the information provided so when a 10000 vservers under a tenant adding a new vserver under tenant would be slow because of the old query performance as it was taking some time there but with this optimization, its only spending at most a millisecond or 2 in that method Also noticed that when a PUT operation takes place, the method calls the related objects to create a dmaap event which was in turn calling the findParents and actually utilizing the parents to create the dmaap event and would spend quite a lot of time here because of the expensive call of the findParents in this case we need those vertexes So optimized the code so based on a given vertex, we have the aai-uri and the newly added metadata uriTemplate to break the aai-uri into its parent aai-uri and grand parent aai-uri and so forth With this breakdown, we can get the list of aai-uris which are parents, grandparents and then use the aai-uri to look them up which is O(1) lookup time due to the fact they are unique indexes The time it takes when doing a traversal to find the parents is propotional to the number of edges but this will be optimistic Another area which was improved was the json path execution of the edge rules so when the edge rules get loaded into memory it creates a document object, it utilizes the jsonpath to query information about the edge rules but the only thing here is each time it gets called the query gets invoked and uses jsonpath to retrieve the edge rules when we can cached them based on the filter so that the user executed and if the filter is the same as before, the expected edge rules will return the same Too much time was spent making the query and retrieving and building the edgerules So a cache is a perfect way to optimize this part Issue-ID: AAI-1987 Change-Id: Ieb8237de3fd31136ceac14bf4a8216a7ab3b7179 Signed-off-by: Kajur, Harish (vk250x) <vk250x@att.com>
2018-11-29Make instance-group description optionalKajur, Harish (vk250x)1-3/+3
Issue-ID: AAI-1982 Change-Id: Ie572a40a7d0590a62d4919a76753a632c52c4766 Signed-off-by: Kajur, Harish (vk250x) <vk250x@att.com>
2018-11-01Update to add relationship to aggregate routeKajur, Harish (vk250x)1-1/+3
Issue-ID: AAI-1824 Change-Id: I68e5e900db8f6a1a3489c66cd8ae71bbe977e98f Signed-off-by: Kajur, Harish (vk250x) <vk250x@att.com>
2018-11-01Add upgrade cycle to cloud regionKajur, Harish (vk250x)1-0/+5
Issue-ID: AAI-1828 Change-Id: Ifee15d4824a26319f159ed030b0c7f1ab8500041 Signed-off-by: Kajur, Harish (vk250x) <vk250x@att.com>
2018-11-01Add required properties to schemaKajur, Harish (vk250x)1-710/+815
Issue-ID: AAI-1826 Change-Id: Ifc7122880e2c98888aa6b478cba3f70fb4c62e52 Signed-off-by: Kajur, Harish (vk250x) <vk250x@att.com>
2018-11-01Add aggregate route objectKajur, Harish (vk250x)1-1/+51
Issue-ID: AAI-1824 Change-Id: I3b1fd2b0dca1add9736b49b26ede67e413aa2586 Signed-off-by: Kajur, Harish (vk250x) <vk250x@att.com>
2018-11-01Support generic-vnf vendor informationKajur, Harish (vk250x)1-0/+58
Issue-ID: AAI-1823 Change-Id: Ifa4ab02584bf99565286dcbaab38339030c70228 Signed-off-by: Kajur, Harish (vk250x) <vk250x@att.com>
2018-11-01Add orchestration status to pnfKajur, Harish (vk250x)1-0/+5
Issue-ID: AAI-1822 Change-Id: Ic78c2f272d25cd0068241db409c0927aaa622471 Signed-off-by: Kajur, Harish (vk250x) <vk250x@att.com>
2018-11-01Add priority property to l-interfaceKajur, Harish (vk250x)1-0/+5
Issue-ID: AAI-1820 Change-Id: Iea36a1d1e4c94ea2bc1cd698c482b4fd1db163a9 Signed-off-by: Kajur, Harish (vk250x) <vk250x@att.com>
2018-11-01Add vrf schema and edge rulesKajur, Harish (vk250x)1-0/+61
Issue-ID: AAI-1813 Change-Id: I1c0f53d9c75ea9d568bd8020680b75ef0a4bf3f6 Signed-off-by: Kajur, Harish (vk250x) <vk250x@att.com>
2018-11-01Add support for v15 APIsKajur, Harish (vk250x)1-0/+8363
Issue-ID: AAI-1812 Change-Id: I2542371baf8f33da1ab2ea3b19073b1f1dc870f4 Signed-off-by: Kajur, Harish (vk250x) <vk250x@att.com>