Unit Instance

HTTP 200 OK
Allow: GET, PUT, PATCH, DELETE, HEAD, OPTIONS
Content-Type: application/json
Vary: Accept

{
    "translation": "https://weblate.info.ucl.ac.be/api/translations/cnp3-ebook/principlessharing/cs/?format=api",
    "source": [
        "In large networks, fairness is always a compromise. The most widely used definition of fairness is the `max-min fairness`. A bandwidth allocation in a network is said to be `max-min fair` if it is such that it is impossible to allocate more bandwidth to one of the flows without reducing the bandwidth of a flow that already has a smaller allocation than the flow that we want to increase. If the network is completely known, it is possible to derive a `max-min fair` allocation as follows. Initially, all flows have a null bandwidth and they are placed in the candidate set. The bandwidth allocation of all flows in the candidate set is increased until one link becomes congested. At this point, the flows that use the congested link have reached their maximum allocation. They are removed from the candidate set and the process continues until the candidate set becomes empty."
    ],
    "previous_source": "",
    "target": [
        ""
    ],
    "id_hash": -8762930453123508778,
    "content_hash": -8762930453123508778,
    "location": "../../principles/sharing.rst:101",
    "context": "",
    "note": "",
    "flags": "",
    "state": 0,
    "fuzzy": false,
    "translated": false,
    "approved": false,
    "position": 19,
    "has_suggestion": false,
    "has_comment": false,
    "has_failing_check": false,
    "num_words": 150,
    "source_unit": "https://weblate.info.ucl.ac.be/api/units/34512/?format=api",
    "priority": 100,
    "id": 17958,
    "web_url": "https://weblate.info.ucl.ac.be/translate/cnp3-ebook/principlessharing/cs/?checksum=663d12e4e1ed5d6",
    "url": "https://weblate.info.ucl.ac.be/api/units/17958/?format=api",
    "explanation": "",
    "extra_flags": "",
    "pending": false,
    "timestamp": "2019-10-14T10:39:24.432834+02:00"
}