• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.4
• /
• pp.581-587
• /
• 2021

Real-time video streaming scheme for multimedia content delivery and remote conference services is one of technologies that are significantly sensitive to data transmission delay. Recently, because of COVID-19, real-time video streaming contents for the services are significantly increased such as personal broadcasting and remote school class. In order to support the services, there is a growing emphasis on low transmission delay and secure content delivery, respectively. Therefore, our research proposed a packet aggregation algorithm to reduce the transmission delay of selectively encrypted video transmission for real-time video streaming services. Through the application of the proposed algorithm, the selectively encrypted video framework can control the amount of MPEG-2 TS packets for low latency transmission with a consideration of packet priorities. Evaluation results on testbed show that the application of the proposed algorithm to the video framework can reduce approximately 11% of the transmission delay for high and low resolution video.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8B
• /
• pp.691-700
• /
• 2006

Based on the destination IP address of incoming packets, the Internet routers determine next hops and forward packets toward final destinations through If address lookup. The bandwidth of communication links increases exponentially fast as well as the routing table size grows significant as the number of single host networks attached to the Internet increases. Since packets should be processed at wire-speed, the increased link speed reduces the processing time of a packet in routers, and hence more efficient and fast IP address lookup algorithms and architectures are required in the next generation routers. Most of the previous IP lookup schemes compare routing prefixes of shorter length first with a given input IP address. Since IP address lookup needs to find the most specific route of the given input, search continues until the longest matched prefix is found while it keeps remembering the current test matching prefix. In this paper, based on binary search on prefix length, we proposed a new IP address lookup algorithm which compares longer prefixes first. The proposed scheme is consisted of multiple tries with prefixes on leaves only. The trie composed of the longest prefixes is primarily searched whether there is a match with the given input. This processing is repeated for the trio of the next longer prefixes until there finds a match. Hence the proposed algorithm provides the fast search speed. The proposed algorithm also provides the incremental update of prefixes while the previous binary search on length scheme does not provide the incremental update because of pre-processing requirement. In this paper, we performed extensive simulations and showed the performance comparisons with related works.