Socket 多线程简例
来源:互联网 发布:snmp监控linux 编辑:程序博客网 时间:2024/06/01 10:23
多线程服务端,单独线程处理客户端连接,多个客户端之间不会阻塞
服务器端:
public class Server {ServerSocket serverSocket;Socket socket;public Server() throws IOException {serverSocket = new ServerSocket(10086);while (true) {socket = serverSocket.accept();// 启动多线程处理 socketnew SocketHandler(socket).start();}}public static void main(String[] args) {try {new Server();} catch (IOException e) {e.printStackTrace();}}}
Socket多线程处理类:
public class SocketHandler extends Thread {private Socket socket;public SocketHandler(Socket socket) {this.socket = socket;}@Overridepublic void run() {try {accept(this.socket);} catch (IOException e) {e.printStackTrace();}}private void accept(Socket socket) throws IOException {BufferedReader socketIn = new BufferedReader(new InputStreamReader(socket.getInputStream()));String msg = socketIn.readLine();System.out.println("Client: " + msg);socketIn.close();}}
客户端:
public class Client {Socket socket;public Client() throws UnknownHostException, IOException {// 连续发送while (true) {send();}}private void send() throws IOException {socket = new Socket("localhost", 10086);PrintWriter socketOut = new PrintWriter(socket.getOutputStream());System.out.print("Say: ");BufferedReader input = new BufferedReader(new InputStreamReader(System.in));socketOut.write(input.readLine());socketOut.close();}public static void main(String[] args) {try {new Client();} catch (IOException e) {e.printStackTrace();}}}
阅读全文
0 0
- Socket 多线程简例
- socket多线程
- 多线程 socket
- socket多线程
- 多线程&socket
- socket多线程
- Socket 多线程
- socket(多线程)
- Socket,Thread,多线程Socket
- linux 多线程socket
- linux多线程socket服务器
- Socket多线程问题【转载】
- 多线程异步Socket通信
- 简单实现多线程Socket
- 多线程Socket编程
- C#Socket多线程实例
- java socket多线程代码
- java多线程Socket例子
- BZOJ2154,BZOJ2693 (Mobius反演)
- C++文件的复制
- web概述、HTML概述、文本处理、图像、超链接、表格、表单
- JSP中的TAG文件和TLD文件
- PAT 乙级 1035. 插入与归并(25)
- Socket 多线程简例
- Struts2知识点回顾(一)Struts工作流程
- Django 中遇到的问题(1)TypeError: context must be a dict rather than Context.
- 40个比较重要的Android面试题
- bootstrap自定义样式-bootstrap侧边导航栏的实现
- 动态规划(dynamic programming)
- JavaScript初接触
- 稳定排序
- LeetCode 108 Convert Sorted Array to Binary Search Tree(二分 + 递归建树)