{"action":"opened","issue":{"url":"https://api.github.com/repos/pions/webrtc/issues/48","repository_url":"https://api.github.com/repos/pions/webrtc","labels_url":"https://api.github.com/repos/pions/webrtc/issues/48/labels{/name}","comments_url":"https://api.github.com/repos/pions/webrtc/issues/48/comments","events_url":"https://api.github.com/repos/pions/webrtc/issues/48/events","html_url":"https://github.com/pions/webrtc/issues/48","id":344122842,"node_id":"MDU6SXNzdWUzNDQxMjI4NDI=","number":48,"title":"Add simple PMTU calculation with heartbeats","user":{"login":"kc5nra","id":231018,"node_id":"MDQ6VXNlcjIzMTAxOA==","avatar_url":"https://avatars1.githubusercontent.com/u/231018?v=4","gravatar_id":"","url":"https://api.github.com/users/kc5nra","html_url":"https://github.com/kc5nra","followers_url":"https://api.github.com/users/kc5nra/followers","following_url":"https://api.github.com/users/kc5nra/following{/other_user}","gists_url":"https://api.github.com/users/kc5nra/gists{/gist_id}","starred_url":"https://api.github.com/users/kc5nra/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/kc5nra/subscriptions","organizations_url":"https://api.github.com/users/kc5nra/orgs","repos_url":"https://api.github.com/users/kc5nra/repos","events_url":"https://api.github.com/users/kc5nra/events{/privacy}","received_events_url":"https://api.github.com/users/kc5nra/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2018-07-24T16:58:14Z","updated_at":"2018-07-24T16:58:14Z","closed_at":null,"author_association":"CONTRIBUTOR","body":"Calculate the maximum MTU size that can travel the entire path machine1<->machine2.\r\n\r\nThe easiest way is probably to craft heartbeat messages starting at the maximum value until they are successfully returned.  Potentially listen to ICMP PacketTooBig"}}
{"actor":{"display_login":"kc5nra"}}