{ "items" : [
    { "id" : "http://webisa.webdatacommons.org/307550611"
      "properties" : {
        "http://www.w3.org/1999/02/22-rdf-syntax-ns#type" : [ "http://www.w3.org/ns/prov#Entity" ] ,
        "http://www.w3.org/ns/prov#value" : [ "This enables the bandwidth usehistory to fade with time, allowing a channel to use more than its allocation during certain periods when bandwidth is available, while still maintaining the bandwidth guarantees when bandwidth becomes tight again.While the above-described scheduling method is suitable for all kinds of systems that have multiple requesters competing for a shared resource, it is partic" ] ,
        "http://www.w3.org/ns/prov#wasQuotedFrom" : [ "patentgenius.com" ] } },

    { "id" : "http://webisa.webdatacommons.org/prov/156158577"
      "properties" : {
        "http://www.w3.org/ns/prov#wasDerivedFrom" : [ "http://webisa.webdatacommons.org/307550611"] } } }
