| Presentation | 1996/12/6 A fastest file compression transfer on a file process net Chikashi OZAKI, Satoshi ADACHI, Yoshihiro KANEKO, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Recently computer networks are widely popularized, where we can easily transfer and duplicate files or data we need. In this situation, large sized files are often compressed in ahead of transfer. The total time from the beginning of compressing a file in some computer (source) till the end of transferring the file to other computer (sink) depends on the performances of those computers and the capacity of communication links. If we can compress or expand (uncompress) files on other computers as well as source and sink, we might transfer files faster than now. On this assumption, a problem of file optional compression scheduling is to choose some computers where we compress and expand the file to be transferred in the shortest time. As far, this problem is known to be stetted in linear time for the case with solid route between source and sink and with some constraints of compression time and expansion time at each vertex. In this report, the problem can be reduced to a shortest path problem for the case that several rootless between source and sink exist and that compression time and expansion time are independent. Moreover, by a different algorithm from that of short path problem, the problem is settled in linear time for the case with a solid route |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | file compression / file transfer / polynomial time / shortest path problem |
| Paper # | COMP96-50 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 1996/12/6(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A fastest file compression transfer on a file process net |
| Sub Title (in English) | |
| Keyword(1) | file compression |
| Keyword(2) | file transfer |
| Keyword(3) | polynomial time |
| Keyword(4) | shortest path problem |
| 1st Author's Name | Chikashi OZAKI |
| 1st Author's Affiliation | Faculty of Engineering, Gifu University() |
| 2nd Author's Name | Satoshi ADACHI |
| 2nd Author's Affiliation | Faculty of Engineering, Gifu University |
| 3rd Author's Name | Yoshihiro KANEKO |
| 3rd Author's Affiliation | Faculty of Engineering, Gifu University |
| Date | 1996/12/6 |
| Paper # | COMP96-50 |
| Volume (vol) | vol.96 |
| Number (no) | 398 |
| Page | pp.pp.- |
| #Pages | 9 |
| Date of Issue | |