• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권6호
• /
• pp.1311-1326
• /
• 2010

Peer-to-peer (P2P) networks consume the most bandwidth in the current Internet and file sharing accounts for the majority of the P2P traffic. Thus it is important for a P2P file sharing application to be efficient in bandwidth consumption. Bandwidth consumption as much as downloaded file sizes is inevitable, but those in file search and bad downloads, e.g. wrong, corrupted, or malicious file downloads, are overheads. In this paper, we target to reduce these overheads even in the presence of high volume of malicious users and their bad files. Sybil attacks are the example of such hostile environment. Sybil attacker creates a large number of identities (Sybil nodes) and unfairly influences the system. When a large portion of the system is subverted, either in terms of the number of users or the number of files shared in the system, the overheads due to the bad downloads rapidly increase. We propose ELiSyR, a file search protocol that can tolerate such a hostile environment. ELiSyR uses social networks for P2P file search and finds benign files in 71% of searches even when more than half of the users are malicious. Furthermore, ELiSyR provides similar success with less bandwidth than other general efforts against Sybil attacks. We compare our algorithm to SybilGuard, SybilLimit and EigenTrust in terms of bandwidth consumption and the likelihood of bad downloads. Our algorithm shows lower bandwidth consumption, similar chances of bad downloads and fairer distribution of computation loads than these general efforts. In return, our algorithm takes more rounds of search than them. However the time required for search is usually much less than the time required for downloads, so the delay in search is justifiable compared to the cost of bad downloads and subsequent re-search and downloads.

• 대한전자공학회논문지TC
• /
• 제41권3호
• /
• pp.179-179
• /
• 2004

가까운 미래에 우리는 기존의 정액제 요금에서 종량제가 첨가되는 것과 같은 인터넷서비스의 요금체계에 변화를 맞이할 것이다. 본 논문은 이와 같은 움직임에 대비하여 차세대 네트워크에서 서비스품질이 보장되는 인터넷 서비스에 대한 사용량기반의 과금체계를 제안하고자 한다. 먼저, IP 네트워크에서 가장 주류를 이룰 Assured service에 의해서 발생되는 적응성이 있는 트래픽의 특성을 살펴보고, 이어서 네트워크 대역의 사용량에 기반한 과금방안을 제안한다. 그리고, 어떤 형태의 Assured service에도 적용 가능한 과금함수를 제안하고, 간단한 수치계산을 통하여 제안하는 방법의 유효성에 대하여 기술한다.

• 대한전자공학회논문지TC
• /
• 제41권3호
• /
• pp.21-28
• /
• 2004

가까운 미래에 우리는 기존의 정액제 요금에서 종량제가 첨가되는 것과 같은 인터넷서비스의 요금체계에 변화를 맞이할 것이다. 본 논문은 이와 같은 움직임에 대비하여 차세대 네트워크에서 서비스품질이 보장되는 인터넷 서비스에 대한 사용량기반의 과금체계를 제안하고자 한다. 먼저, IP 네트워크에서 가장 주류를 이룰 Assured service에 의해서 발생되는 적응성이 있는 트래픽의 특성을 살펴보고, 이어서 네트워크 대역의 사용량에 기반한 과금방안을 제안한다. 그리고, 어떤 형태의 Assured service에도 적용 가능한 과금함수를 제안하고, 간단한 수치계산을 통하여 제안하는 방법의 유효성에 대하여 기술한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권2호
• /
• pp.191-204
• /
• 2010

There is a well-defined propagation model, named the random constant spread (RCS) model, which explains worms that spread their clones with a random scanning strategy. This model uses the number of infected hosts in a domain as a factor in the worms' propagation. However, there are difficulties in explaining the characteristics of new Internet worms because they have several considerable new features: the denial of service by network saturation, the utilization of a faster scanning strategy, a smaller size in the worm's propagation packet, and to cause maximum damage before human-mediated responses are possible. Therefore, more effective factors are required instead of the number of infected hosts. In this paper, the network bandwidth usage rate is found to be an effective factor that explains the propagations of the new Internet worms with the random scanning strategy. The analysis and simulation results are presented using this factor. The simulation results show that the scan rate is more sensitive than the propagation packet for detecting worms' propagations.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2005년도 추계학술대회 및 정기총회
• /
• pp.361-364
• /
• 2005

As increasing the Internet traffic, many researches on access network are reported for end-to-end high-speed broadband network, where E-PON(Ethernet-Passive Active Network) is one of reasonable candidate fur the network with respect to cost and bandwidth utilization. For the high-speed access network, E-PON need an efficient bandwidth allocation method. This paper suggests a WFA(Water-Filling Allocation) algorithm for the efficient bandwidth allocation with various simulation test.

• 인터넷정보학회논문지
• /
• 제8권4호
• /
• pp.41-49
• /
• 2007

EPON(Ethernet Passive Optical Network)는 적은 비용으로 고품질 서비스를 제공하기 위한 차세대 기술로써, EPON을 구성하는 모든 ONU(Optical Network Unit)들은 한정된 업링크 채널을 나누어 사용한다. 대용량 LAN에 사용자들의 대역폭 요구를 충족시키기 위해서, OLT(Optical Line Terminal)는 효과적인 방법으로 업링크 채널의 시간슬롯을 각 ONU에게 분할 할당한다. 본 논문에서는 효율적인 업링크 채널의 시간슬롯 분배(대역폭 할당)를 위해 기존 연구 IPACT(Interleaved Polling with Adaptive Cycle Time)와 SLICT(Sliding Cycle Time)방식에 대해 살펴보고, 새로운 대역폭 할당 방식인 DRSM(Dynamic Right Sizing of Maximum-windows)을 제안한다. 이 방식은 과거 모든 ONU에게 할당된 대역폭 정보를 기반으로 다음 구간에서 ONU에 할당 가능한 최대 대역폭을 계산하고, 계산된 최대 전송 가능 대역폭과 ONU의 대역폭 요구량으로 각 ONU의 전송 윈도우의 크기를 결정한다. 제안한 방식은 모든 ONU의 대역폭 요구를 허용 범위 내에서 최대한 충족시키고, ONU들간 균등한 대역폭 할당을 추구한다.

• 한국인터넷방송통신학회논문지
• /
• 제11권3호
• /
• pp.9-15
• /
• 2011

리플렉트어레이 안테나는 반사경 안테나의 단점을 보완하여 대체할 새로운 형태의 안테나로 대두되고 있다. 하지만 반사판이 단층구조일 경우 대역폭이 매우 좁다는 단점이 있고, 대역폭을 넓히기 위하여 다층구조의 반사판을 사용할 경우 설계가 어렵고 제작 단가가 높아지게 된다. 본 논문에서는 이러한 단점들을 극복하기 위하여 단층구조를 사용하여 제작 단가를 낮추면서 협대역 특성을 극복할 수 있는 정사각형에 U자 모양 슬롯을 낸 패치를 이용하여 리플렉트어레이 안테나를 설계하였다. 제안된 리플렉트어레이 안테나는 12.5 GHz에서 55.5 %의 효율과 14 % 이상의 1 dB gain bandwidth 특성을 갖는다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권5호
• /
• pp.444-460
• /
• 2009

In this paper, we propose an expanded patching technique in order to reduce the server network bandwidth requirements to support true VoD services in VoD Systems. Double Patching, which is a typical multicast technique, ensures that a long patching stream delivers not only essential video data for the current client but also extra video data for future clients. Since the extra data may include useless data, it results in server network bandwidth wastage. In order to prevent a server from transmitting useless data, the proposed patching technique uses a new kind of stream called a linking stream. A linking stream is transmitted to clients that have received short patching streams, and it plays a linking role between a patching stream and a regular stream. The linking stream enables a server to avoid transmitting unnecessary data delivered by a long patching stream in Double Patching, so the server never wastes its network bandwidth. Mathematical analysis shows that the proposed technique requires less server network bandwidth to support true VoD services than Double Patching. Moreover, simulation results show that it has better average service latency and client defection rate compared with Double Patching.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권2호
• /
• pp.386-404
• /
• 2013

In broadband satellite multimedia (BSM) system, burst time plan (BTP) is always periodically generated. We find that this method can have a great effect on the system response ability to bandwidth requests. A general analysis model of BTP generation method is given. An optimized BTP generation (O-BTPG) method is presented by deducing the optimal bandwidth allocation period (BAP) and bandwidth allocation latency (BAL) without considering the signaling overhead caused by BTP. Then a novel asynchronous BTP generation (A-BTPG) method in which the BTP is generated asynchronously according to the traffic load from users' bandwidth requests is proposed. Simulation results show that A-BTPG can flexibly realize a trade-off between the system response ability and BTP signaling overhead. What's more, it can be widely used in various regenerative onboard switching BSM systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권6호
• /
• pp.989-1005
• /
• 2010

Cooperative diversity is a technique with which a virtual multiple antenna array is established among the single antenna users of the wireless network to realize space diversity. Signal space diversity (SSD) is a bandwidth-efficient diversity technique, which uses constellation rotation and interleaving techniques to achieve diversity gain. A new cooperative diversity scheme with rotated constellations (RCCD) is proposed in this paper. In this scheme, data are modulated by using a rotated constellation, and the source and the relays transmit different components of the modulated symbols. Since any one of the components contains full information of the symbols, the destination can obtain multiple signals conveying the same information from different users. In this way, space diversity is achieved. The RCCD scheme inherits the advantage of SSD - being bandwidth-efficient but without the delay problem of SSD brought by interleaving. The symbol error rate of the RCCD scheme is analyzed and simulated. The analysis and simulation results show that the RCCD scheme can achieve full diversity order of two when the inter-user channel is good enough, and, with the same bandwidth efficiency, has a better performance than amplify-and-forward and detect-and-forward methods.