Menghindari permintaan bottleneck
Tetap teratur dengan koleksi
Simpan dan kategorikan konten berdasarkan preferensi Anda.
Ringkasan
Audit ini mengidentifikasi permintaan yang berjalan lama yang memblokir permintaan
iklan pertama. Ini adalah permintaan yang dimulai dan juga menerima
respons sebelum permintaan iklan pertama dibuat. Mengurangi jumlah dan durasi
permintaan pemblokiran ini akan mengurangi latensi permintaan iklan pertama,
sehingga mempercepat pemuatan iklan.
Rekomendasi
Detail audit ini berisi 5 permintaan pemblokiran teratas (menurut biaya). Tujuannya di sini adalah untuk menghapus atau mengurangi
durasi permintaan ini untuk mempercepat pemuatan iklan. Beberapa tips untuk melakukannya
antara lain:
- Menghilangkan permintaan yang tidak perlu.
- Menunda permintaan yang tidak penting hingga setelah iklan dimuat.
- Menerbitkan permintaan secara paralel, bukan secara bertahap.
- Meningkatkan waktu respons dengan mengoptimalkan layanan backend, menggunakan HTTP/2, dll.
Audit ini menampilkan 5 permintaan bottleneck teratas menurut biaya. Biaya permintaan
dihitung sebagai berikut:
request duration + (request self-time * 3)
Saat waktu mandiri permintaan sama dengan durasi dikurangi waktu yang diblokir oleh permintaan
lain. Hanya permintaan dengan waktu mandiri lebih dari 250 md atau durasi
lebih dari 1 dtk yang dipertimbangkan.
Kecuali dinyatakan lain, konten di halaman ini dilisensikan berdasarkan Lisensi Creative Commons Attribution 4.0, sedangkan contoh kode dilisensikan berdasarkan Lisensi Apache 2.0. Untuk mengetahui informasi selengkapnya, lihat Kebijakan Situs Google Developers. Java adalah merek dagang terdaftar dari Oracle dan/atau afiliasinya.
Terakhir diperbarui pada 2025-07-25 UTC.
[null,null,["Terakhir diperbarui pada 2025-07-25 UTC."],[[["\u003cp\u003eThis audit focuses on identifying and mitigating long-running requests that delay the initial ad request, ultimately hindering ad loading speed.\u003c/p\u003e\n"],["\u003cp\u003eBy reducing or removing these "blocking requests," publishers can significantly improve the latency of their first ad request.\u003c/p\u003e\n"],["\u003cp\u003eOptimization strategies include eliminating unnecessary requests, deferring non-critical requests, parallelizing request execution, and enhancing backend service response times.\u003c/p\u003e\n"],["\u003cp\u003eThe audit highlights the top 5 most impactful blocking requests based on a calculated "cost" that factors in request duration and self-time.\u003c/p\u003e\n"],["\u003cp\u003eRequests with self-times exceeding 250ms or durations longer than 1s are flagged for potential optimization to improve ad loading performance.\u003c/p\u003e\n"]]],["The audit identifies long-running requests that delay the first ad request. It highlights the top five blocking requests based on their calculated cost. Actions to reduce delays include eliminating or deferring non-critical requests, issuing requests in parallel, and improving response times. The cost of a request is its duration plus three times its self-time (duration minus blocked time). Only requests with self-time above 250ms or duration above 1s are considered.\n"],null,["# Avoid bottleneck requests\n\nOverview\n--------\n\nThis audit identifies long-running requests that are blocking the first ad\nrequest. These are requests that were initiated and which also received a\nresponse before the first ad request was made. Reducing the number and duration\nof these blocking requests will reduce the latency of the first ad request,\nspeeding up ad loading.\n\nRecommendations\n---------------\n\nThe details of this audit contain the top 5 blocking requests\n([by cost](#more_information)). The goal here is to remove or reduce the\nduration of these requests to speed up ad loading. Some tips for doing this\ninclude:\n\n- Eliminating unnecessary requests.\n- Deferring non-critical requests until after ads are loaded.\n- Issuing requests in parallel rather than serially.\n- Improving response times by optimizing backend services, using HTTP/2, etc.\n\nMore information\n----------------\n\nThis audit displays the top 5 bottleneck requests by cost. The cost of a request\nis computed as follows:\n\n`request duration + (request self-time * 3)`\n\nWhere request self-time is equal to duration minus time spent blocked by other\nrequests. Only requests with a self-time greater than 250ms or a duration\ngreater than 1s are considered. \n[View audit source](https://github.com/googleads/publisher-ads-lighthouse-plugin/tree/HEAD/lighthouse-plugin-publisher-ads/audits/bottleneck-requests.js) [Improve this article](https://github.com/googleads/publisher-ads-lighthouse-plugin/tree/HEAD/docs/audits/bottleneck-requests.md) [Report an issue](https://github.com/googleads/publisher-ads-lighthouse-plugin/issues/new?labels=documentation&template=documentation-feedback.md&title=Documentation+feedback%3A+bottleneck-requests.md)\n\n\u003cbr /\u003e"]]
