Hasil Pencarian  ::  Simpan CSV :: Kembali

"Saat ini banyak digunakan sebuah jaringan yang dapat mendukung layanan suara, data dan video tanpa adanya downtime, sehingga dibutuhkan back up jaringan serta protokol redundansi (active-standby) untuk menunjang terciptanya jaringan komunikasi yang stabil dan efisien. VRRP dan CARP merupakan salah satu protokol yang sering digunakan untuk mendapatkan level layanan yang tinggi. Rancangan pada skripsi ini akan dibuat dalam beberapa skenario yaitu ping tes, flooding, download dokumen serta streaming dengan parameter RTD (delay time), packet loss, throughput dan waktu failover. Dari hasil simulasi bahwa protokol CARP membutuhkan rata – rata waktu lebih cepat dalam melakukan failover yaitu 5 detik daripada protokol VRRP dengan rata-rata waktu 7 detik. Untuk trafik yang besar protokol VRRP dan CARP mampu melewatkan throughput besar saat dilakukan failover, nilai throughputnya hampir mendekati throughput maksimalnya 6 Mbps, untuk rata-rata packet loss yang didapat sebesar 5-6%.

---

Today, there are many network could support voice service, data, video conference without any downtime occurred on network. Backup method is required to support all that services and also protocol redundancy (active- standby) which could make a stable and efficient network communications. VRRP and CARP are the frequently used protocols to create a high level of network service. The scheme of this thesis will be made in several scenarios, they are ping test, flooding, download document also streaming by RTD (delay time) parameters, packet loss, throughput and failover time.

The result from simulation showing that CARP protocol need the faster average time that is 5 seconds, but VRRP protocol need 7 seconds of the average time. CARP and VRRP protocol is able to pass up wide throughput while doing failover on the large traffic, its throughput value almost approaches the maximal value of 6 Mbps and average of packet loss are 5-6%."

"Pada routing multi-hop, cluster head yang dekat dengan base station berperan sebagai node perantara bagi cluster head yang jauh dari base station untuk menyampaikan paket data dari node reguler ke base station. Cluster head sebagai relay akan menghabiskan energi lebih cepat sehingga menyebabkan masalah hotspot. Makalah ini mengusulkan algoritma routing multi-hop dinamis bernama Data Similarity Aware untuk Dynamic Multi-hop Routing Protocol DSA-DMRP untuk memecahkan masalah hotspot, meningkatkan masa hidup jaringan dan skalabilitas jaringan, dan memenuhi persyaratan aplikasi yang dipertimbangkan kesamaan data dari node yang berdekatan. DSA-DMRP menggunakan teknik agregasi fuzzy untuk mengukur kemiripan data mereka agar partisi jaringan menjadi cluster ukuran yang tidak sama. Dalam mekanisme ini, setiap node dapat mengenali dan mencatat simpul tetangga yang serupa. Selanjutnya, aturan K-hop Clustering Algorithm KHOPCA yang dimodifikasi digunakan untuk memilih cluster head dan membuat rute untuk transmisi intra cluster dan interkluster. DSA-DMRP dibandingkan dengan KHOPCA untuk menjustifikasi kinerjanya. Hasil simulasi menunjukkan bahwa, DSA DMRP dapat memperbaiki masa hidup jaringan dibanding KHOPCA, dan memecahkan masalah hotspot.

---

In multi hop routing, cluster heads close to the base station role as intermediate nodes for farther cluster heads to relay the data packet from regular nodes to base station. The cluster heads as relays will deplete their energy more quickly that causes hot spot problem. This paper proposes a dynamic multi hop routing algorithm named Data Similarity Aware for Dynamic Multi hop Routing Protocol DSA DMRP to solve the hot spot problem, improve the lifetime and scalability of the network, and satisfy the requirement of applications that consider the data similarity of adjacent nodes. The DSA DMRP uses fuzzy aggregation technique to measure their data similarity degree in order to partition the network into unequal size clusters.

In this mechanism, each node can recognize and note its similar neighbor nodes. Next, the modified K hop Clustering Algorithm KHOPCA rules by adding a priority factor that considers residual energy and distance to the base station is used to select cluster heads and create the best routes for intra cluster and inter cluster transmission. The DSA DMRP was compared against the KHOPCA to justify the performance. Simulation results show that, the DSA DMRP can improve the network lifetime longer than the KHOPCA, and solve the hotspot problem."

"Thorough and comprehensive coverage from one of the foremost experts in browser security.' --Tavis Ormandy, Google Inc. Modern web applications are built on a tangle of technologies that have been developed over time and then haphazardly pieced together. Every piece of the web application stack, from HTTP requests to browser-side scripts, comes with important yet subtle security consequences. To keep users safe, it is essential for developers to confidently navigate this landscape.In The Tangled Web, Michal Zalewski, one of the world's top browser security experts, offers a compelling narrative that explains exactly how browsers work and why they're fundamentally insecure. Rather than dispense simplistic advice on vulnerabilities, Zalewski examines the entire browser security model, revealing weak points and providing crucial information for shoring up web application security. You'll learn how to: Perform common but surprisingly complex tasks such as URL parsing and HTML sanitization Use modern security features like Strict Transport Security, CSP, and CORS Leverage many variants of the same-origin policy to safely compartmentalize complex web applications and protect user credentials in case of XSS bugs Build mashups and embed gadgets without getting stung by the tricky frame navigation policy Embed or host user-supplied content without running into the trap of content sniffing For quick reference, "Security Engineering Cheat Sheets' at the end of each chapter offer ready solutions to problems you're most likely to encounter. With coverage extending as far as planned HTML5 features, The Tangled Web will help you create secure web applications to stand the test of time."