登录
首页 » Windows开发 » Darwin Streaming Server

Darwin Streaming Server

于 2023-05-05 发布 文件大小:21.41 MB
0 75
下载积分: 2 下载次数: 1

代码说明:

对于并发量并不大而且对性能要求不是很高的流媒体传输模块,live555还是很好的选择,下面说一下我所实现的流媒体代理服务器(目前只能实现对H264单视频的转发) 代理转发主要分为对RTSP的转发与对RTP的转发(没有实现对rtcp的转发),尽量做到不破坏原有程序框架,所以还是要将整个代理过程融合于ServerMediaSubsession、Source、Sink的循环中,按照流程,RTSP OPTIONS不是必需进行转发,直接转到DESCRIBE的转发过程。

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • btp 2.0.2 tutorial source codes
    btp 2.0.2 tutorial source codes
    2022-07-14 09:49:16下载
    积分:1
  • 用Servlet获取提交的页面信息
    设计一个注册界面register.jsp,用户填写的信息包括:姓名、性别、出生年月、民族、个人介绍等,用户点击注册后将注册信息通过output.jsp显示出来。要求:使用Servlet获取提交的信息,然后跳转到显示结果页面。
    2022-04-14 13:33:02下载
    积分:1
  • 蛇 game.best 在 cg 的小型项目。
    intrestng 贪吃蛇游戏 / / 最好的项目。很容易。.code 可以理解 b easily.just 写在 c + + 编译的帮 b 中得到它。
    2022-04-20 10:41:31下载
    积分:1
  • testadddll运用DLL实现最简单的加法计算器
    testadddll运用DLL实现最简单的加法计算器-testadddll the use of DLL to achieve the most simple addition calculator
    2022-09-19 04:40:02下载
    积分:1
  • 以深度为k的满二叉树(n=2k
    以深度为k的满二叉树(n=2k-1)为例,假设表中每个记录的查找概率相等,即 pi=1/n(1≤i≤n),而树的第i层上有2i-1个结点,因此,折半查找的平均查找长度为: 所以,折半查找的平均时间复杂度为O(log2n)。 -To a depth of k over the binary tree (n = 2k-1) as an example, suppose the table to find the probability of each record the same, that is, pi = 1/n (1 ≤ i ≤ n), and the tree layer of the first i There are 2i-1 nodes, therefore, to find half the average length of search as follows: Therefore, to find half the average time complexity is O (log2n).
    2023-08-09 03:30:03下载
    积分:1
  • 查看接入主机的USB设备,并显示序列号,断口信息
    查看接入主机的USB设备,并显示序列号,断口信息-See USB device host access SetupDiGetDeviceInterfaceDetail(hDevInfo,&strtInterfaceData,NULL,0,&strSzie,NULL)
    2022-02-01 11:46:30下载
    积分:1
  • 基于 vb 的图书馆系统
    图书馆管理系统
    2022-10-09 10:00:03下载
    积分:1
  • how to make high
    如何制作高精度的WINDOWS定时器-how to make high-precision timer WINDOWS
    2022-04-29 22:00:08下载
    积分:1
  • 访问时间测试
    CF card access time test
    2022-05-20 20:59:04下载
    积分:1
  • This lab consists of two parts: 1. A preparatory case study with a standard Kal...
    Start with the runlocalization track.m which is the entrance function to your lab. This function reads two les determined by simout le and map le input arguments which contain information about sensor readings and the map of the environment respectively, runs a loop for all the sensor readings and calls the ekf localize.m to perform one iteration of EKF localization on the readings and plots the estimation(red)/ground truth(green) and odometry(blue) information.-This lab consists of two parts: 1. A preparatory case study with a standard Kalman lter where you learn more about the behavior of the Kalman lter. Very little extra code is needed. 2. The main lab 1 problem in which you need to complete an implementation of an Extended Kalman lter based robot localization.
    2022-11-09 03:30:03下载
    积分:1
  • 696518资源总数
  • 105873会员总数
  • 12今日下载