zoukankan      html  css  js  c++  java
  • Netty

    Netty is an asynchronous event-driven network application framework for rapid development of maintainable high performance protocol servers & clients.

    Netty is a NIO client server framework which enables quick and easy development of network applications such as protocol servers and clients. It greatly simplifies and streamlines network programming such as TCP and UDP socket server.

    'Quick and easy' doesn't mean that a resulting application will suffer from a maintainability or a performance issue. Netty has been designed carefully with the experiences earned from the implementation of a lot of protocols such as FTP, SMTP, HTTP, and various binary and text-based legacy protocols. As a result, Netty has succeeded to find a way to achieve ease of development, performance, stability, and flexibility without a compromise.

    eatures

    Design

    • Unified API for various transport types - blocking and non-blocking socket
    • Based on a flexible and extensible event model which allows clear separation of concerns
    • Highly customizable thread model - single thread, one or more thread pools such as SEDA
    • True connectionless datagram socket support (since 3.1)

    Ease of use

    • Well-documented Javadoc, user guide and examples
    • No additional dependencies, JDK 5 (Netty 3.x) or 6 (Netty 4.x) is enough
      • Note: Some components such as HTTP/2 might have more requirements. Please refer to the Requirements page for more information.

    Performance

    • Better throughput, lower latency
    • Less resource consumption
    • Minimized unnecessary memory copy

    Security

    • Complete SSL/TLS and StartTLS support

    Community

    • Release early, release often
    • The author has been writing similar frameworks since 2003 and he still finds your feed back precious!

    Ref:The Netty project

  • 相关阅读:
    Spring中依赖注入的四种方式
    使用 EasyMock 更轻松地进行测试
    HDU2196 Computer(树形DP)
    BZOJ2125: 最短路(圆方树)
    虚树入门
    BZOJ2286: [Sdoi2011]消耗战(虚树/树形DP)
    Codeforces Round #487 (Div. 2)
    Educational Codeforces Round 45 (Rated for Div. 2)
    BZOJ3675: [Apio2014]序列分割(斜率优化)
    BZOJ2761: [JLOI2011]不重复数字(map)
  • 原文地址:https://www.cnblogs.com/ncore/p/7091949.html
Copyright © 2011-2022 走看看