Location:
Search - go back n java
Search list
Description: 呵呵，交大网络作业；可靠的数据传输，go back to N；呵呵，错过了就可惜了-Oh, Chiao Tung network operations; Reliable data transmission, go back to N; Oh, it missed on the pity
Platform: |
Size: 74752 |
Author: 河南 |
Hits:
Description: 用java实现计算机网络原理中的gobackn协议演示程序-use the computer network tenets of the agreement gobackn Demonstration Program
Platform: |
Size: 4096 |
Author: 赵若琳 |
Hits:
Description: 本程序是用java编写的一些关于arq协议实现的小程序，欢迎参考-this program is to prepare some of java arq protocol on the small procedures, welcomed the reference
Platform: |
Size: 752640 |
Author: 李涛 |
Hits:
Description: 压缩文件内有两个文件，一个是服务器端，一个是客户端，是关于“编程实现可靠数据传输原理-Go-Back-N”的。-Compressed file, there are two documents, one is the server-side, one is the client is on Programming Principles of reliable data-Go-Back-N s.
Platform: |
Size: 2048 |
Author: 肖宗花 |
Hits:
Description: Go back n protocol with hamming code implementation. this is made in java 5.
Platform: |
Size: 7168 |
Author: bhuwan |
Hits:
Description: 用JAVA实现GBN（go back N）协议。UDP滑动窗口协议是建立在UDP上的应用层协议之上的。传输层使用的仍是UDP,但在应用层使用滑动窗口技术,并通过模拟TCP的一些机制以保证UDP的低协议处理开销和获得高通信可靠性。-JAVA implementation by GBN (go back N) protocol. UDP sliding window protocol is based on UDP protocol on the application layer above. Transport layer is still using UDP, but in the application layer using a sliding window, and some of the mechanisms by simulating TCP UDP to ensure that the low protocol processing overhead and achieve high communication reliability.
Platform: |
Size: 11264 |
Author: zhaoshu |
Hits:
Description: 走迷宫游戏！计算机解迷宫通常用的是“穷举求解”方法，即从入口出发，顺着某一个方向进行探索，若能走通，则继续往前进；否则沿着原路退回，换一个方向继续探索，直至出口位置，求得一条通路。假如所有可能的通路都探索到则未能到达出口，则所设定的迷宫没有通睡。可以二维数组存储迷宫数据，通常设定入口点的下标为（1，1），出口点的下标为（n,n）。为处理方便起见，可以迷宫的四周加一圈障碍。对于迷宫任一位置，均可约定有东、南、西、北四个方向可通。 -Maze game! Computer Solutions maze usually is " exhaustive solving" approach, starting from the entrance, along a certain direction to explore, if we go through, then continue to move forward or back along the same route, for a direction to continue to explore, until the exit position, and seek a path. If all possible paths are explored to the failure to reach the exit, then the set through the maze without sleep. Two-dimensional array of data can be stored in the maze, set the entry point is usually the subscript is (1,1), the export point is labeled (n, n). To address convenience, you can add a circle around the maze of obstacles. For the maze any location, can be agreed with the east, south, west and north direction can pass.
Platform: |
Size: 3891200 |
Author: daidawe |
Hits:
Description: 关于Java的GBN(Go Back N)协议的实现，具体的设计原理和相对应的代码在Word中都有。-GBN---Go Back N
Platform: |
Size: 37888 |
Author: Forrest |
Hits:
Description: 滑动窗口协议模拟 java实现 go-back-n-sild window go-back-n
Platform: |
Size: 10052608 |
Author: 王杰 |
Hits:
Description: 运用各种编程语言实现基于Go-Back-N的可靠数据传输软件。
PS：这里使用的是JAVA语言-Yùnyòng gè zhǒng biānchéng yǔyán shíxiàn jīyú qù tuì N de kěkào shùjù zhuàn shū ruǎnjiàn. PS: Zhèlǐ shǐyòng de shì JAVA yǔyán
Platform: |
Size: 3072 |
Author: du |
Hits:
Description: JAVA实现旅行商问题，有简单的可视化界面
有N个城市，要求从其中某个问题出发，唯一遍历所有城市，再回到出发的城市，求最短的路线。使用模拟退火算法可以比较快的求出TSP的一条近似最优路径。-JAVA traveling salesman problem, a simple visual interface
There are N cities, which to ask a question, the only way to traverse all cities, and then go back to the city, the shortest route. The use of simulated annealing algorithm can be faster to find an approximate optimal path TSP.
Platform: |
Size: 3072 |
Author: 辜丽梅 |
Hits: