TY - GEN
T1 - Scalable and persistent multimedia data management system using the Distribute Interval Trees
AU - Yoshinaga, Hirokazu
AU - Tsuchiya, Takeshi
AU - Koyanagi, Keiichi
PY - 2009/12/1
Y1 - 2009/12/1
N2 - A lot of multimedia service and systems using video or music appears with broadband of the Internet including the FTTH. These multimedia data is transmitted to users when it is requested and find it from the storage server. At this time, systems must response to all users quickly using the CDN although many users request a same file. The CDN uses cache or replication method for the load balancing. Also, storage systems must manage files permanently although disks are collapsed. To meet these demand, we proposea a multimedia data management system and it manages multimedia data efficiently in the network of any kind of scale. The system is based on an overlay network construction using a P2P technology, and its hash space is created in an application layer. Each peer manages neighborhood in it's routing table and it is possible to connect with each other. And more, the Distributed Interval Trees is constructed on top of an overlay network. Each peer manages own Interval Trees, and a file is stored to suitable peers by using a hash value from the file. By using the Distributed Interval Trees, we can construct scalable and persistent storage system.
AB - A lot of multimedia service and systems using video or music appears with broadband of the Internet including the FTTH. These multimedia data is transmitted to users when it is requested and find it from the storage server. At this time, systems must response to all users quickly using the CDN although many users request a same file. The CDN uses cache or replication method for the load balancing. Also, storage systems must manage files permanently although disks are collapsed. To meet these demand, we proposea a multimedia data management system and it manages multimedia data efficiently in the network of any kind of scale. The system is based on an overlay network construction using a P2P technology, and its hash space is created in an application layer. Each peer manages neighborhood in it's routing table and it is possible to connect with each other. And more, the Distributed Interval Trees is constructed on top of an overlay network. Each peer manages own Interval Trees, and a file is stored to suitable peers by using a hash value from the file. By using the Distributed Interval Trees, we can construct scalable and persistent storage system.
KW - Distributed storage
KW - Interval Trees
KW - Multimedia data management
KW - P2P
KW - Replication
UR - http://www.scopus.com/inward/record.url?scp=74549124269&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=74549124269&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:74549124269
SN - 9780889868021
T3 - Proceedings of the 5th IASTED European Conference on Internet and Multimedia Systems and Applications, EuroIMSA 2009
SP - 86
EP - 92
BT - Proceedings of the 5th IASTED European Conference on Internet and Multimedia Systems and Applications, EuroIMSA 2009
T2 - 5th IASTED European Conference on Internet and Multimedia Systems and Applications, EuroIMSA 2009
Y2 - 13 June 2009 through 15 June 2009
ER -