zoukankan      html  css  js  c++  java
  • python-UDP传输模型

     1 #!/usr/bin/python  
     2 #coding=utf-8
     3 #服务器端
     4 from socket import *
     5 from time import ctime
     6 HOST="192.168.1.33"
     7 PORT=1235
     8 BUFSIZE=1024
     9 ADDR=(HOST,PORT)
    10 
    11 sockob=socket(AF_INET,SOCK_DGRAM)
    12 sockob.bind(ADDR)
    13 while 1:
    14     print "waiting for message..."
    15     data,addr=sockob.recvfrom(BUFSIZE)
    16     print "client addr",addr
    17     sockob.sendto("[%s]:%s"%(ctime(),data),addr)
    18 sockob.close()
     1 #!/usr/bin/python
     2 #coding=utf-8
     3 #客户端
     4 from socket import *
     5 import sys
     6 HOST=sys.argv[1]
     7 PORT=int(sys.argv[2])
     8 BUFSIZE=1024
     9 ADDR=(HOST,PORT)
    10 
    11 sockob=socket(AF_INET,SOCK_DGRAM)
    12 #sockob.bind(ADDR)    #这里不能加这个是因为操作在同一台机器.
    13 while 1:
    14     data=raw_input('>',)
    15     if not data:
    16         break
    17     sockob.sendto(data,ADDR)   #sendto的返回值是字符数量
    18     data,ADDR=sockob.recvfrom(BUFSIZE)
    19     print data
    20 
    21 sockob.close()
  • 相关阅读:
    [openjudge] 2797最短前缀 Trie
    [poj]1050 To the Max dp
    [openjudge] 1455:An Easy Problem 贪心
    [poj] Catch That Cow--bfs
    = =
    dinic算法实现
    Dinic
    走进链式前向星的秘密
    树链剖分前传
    树链剖分
  • 原文地址:https://www.cnblogs.com/chengyunshen/p/7196039.html
Copyright © 2011-2022 走看看