• 한국컴퓨터정보학회논문지
• /
• 제19권1호
• /
• pp.43-55
• /
• 2014

SPDY는 기존 HTTP(Hypertext Transfer Protocol)/1.1의 문제점을 보완하여 웹 속도를 향상시키기 위한 목적으로 구글에서 새롭게 제안한 프로토콜이다. 본 논문은 다양한 환경에서의 성능 측정을 실시함으로써 SPDY 프로토콜의 특징을 알아보고 기존 프로토콜과의 차이점을 비교 분석하였으며 나아가 SPDY의 Flow Control에 대해서 좀 더 자세히 살펴보았다. 측정 실험들을 통해 SPDY 프로토콜은 3G 환경에서는 성능 향상을 보이지만 고속의 무선랜 환경과 이동체 환경에서는 뚜렷한 성능 향상을 보이지 못하는 문제점이 있음을 파악하였으며 Flow Control 역시 제대로 동작하지 않고 있음을 확인하였다. 마지막으로 성능 측정 실험 결과와 이에 대한 분석을 바탕으로 하여 SPDY 프로토콜의 개선방향을 제시하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권8호
• /
• pp.3542-3566
• /
• 2018

In this paper, we investigate a buffer-aided wireless powered cooperative communication network (WPCCN), in which the source and relay harvest the energy from a dedicated power beacon via wireless energy transfer, then the source transmits the data to the destination through the relay. Both the source and relay are equipped with an energy buffer to store the harvested energy in the energy transfer stage. In addition, the relay is equipped with a data buffer and can temporarily store the received information. Considering the buffer-aided WPCCN, we propose two buffer-aided relaying protocols, which named as the buffer-aided harvest-then-transmit (HtT) protocol and the buffer-aided joint mode selection and power allocation (JMSPA) protocol, respectively. For the buffer-aided HtT protocol, the time-averaged achievable rate is obtained in closed form. For the buffer-aided JMSPA protocol, the optimal adaptive mode selection scheme and power allocation scheme, which jointly maximize the time-averaged throughput of system, are obtained by employing the Lyapunov optimization theory. Furthermore, we drive the theoretical bounds on the time-averaged achievable rate and time-averaged delay, then present the throughput-delay tradeoff achieved by the joint JMSPA protocol. Simulation results validate the throughput performance gain of the proposed buffer-aided relaying protocols and verify the theoretical analysis.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2011년도 춘계학술발표대회
• /
• pp.590-593
• /
• 2011

Time goes on, Ad Hoc network is hot issues. So far, there are a lot of protocols have been proposed for Ad Hoc routing protocol to support the mobility. This paper presents an enhanced DSDV(Destination-Sequenced Distance Vector) routing protocol which nominates one node to take care of a specific area. Simply Area-Aware(AA) DSDV routing protocol has one nominee to take care of some area. It has two jobs. One is to take care of its neighbour and another is to transfer the routing table to its other node as it works. It is called as Area Nominee(AN). The new scheme extends the routing table to include the nominee in the area. The general node is the same as the previous DSDV routing protocol. In the other hands, the node which is nominated has two routing protocols. One is for Regional Routing(RR) table which is the same routing table in DSDV. Another is Global Routing(GR) table which is about the area round its area which it cares nearby. GR table is the table for the designated node like the nominee. Each area has one nominee to transfer between ANs. It has only nominee's information about every area. This concept decreases the topology size and makes the information of topology more accurate.

• Journal of Information Processing Systems
• /
• 제3권1호
• /
• pp.21-25
• /
• 2007

We propose several practical SMC protocols for privacy-preserving cooperative scientific computations. We consider two important scientific computations which involve linear equations: the linear systems of equations problem and the linear least-square problem. The protocols proposed in this paper achieve acceptable security in the sense of Du-Zhan's paradigm and t-wise collusion-resistance, and their communication complexity is O(tm), where t is a security parameter and m is the total number of participants. The complexity of our protocol is significantly better than the previous result O($m^2/{\mu}$) of [4], in which the oblivious transfer protocol is used as an important building block.

• 대한의용생체공학회:의공학회지
• /
• 제14권4호
• /
• pp.315-320
• /
• 1993

This paper deals with a subject for implementation of L+ayer 1 and Layer 2(LAPD) of ISDN user-network interface on the basis of CCITT recommandation I.411, I.412, I.441 (Q.921), I.450(Q.930) and I.451 (Q.931) for ultrasonic image transfer. For the implementa tion of LAPD protocol of ISDN in this study. PC-CARD based hardware(TA :Terminal Adopt) is proposed and operating system (PC-XINU) supporting the Multiprocessing is transplanted to it. As the Service Access Point(SAP) is accessed by using the port of XINU and Layers which consist of transmitting and receiving part are independantly processed for each other in this proposed system. It can be easy and flexible to implement LAPD protocol for the message transfer.

• 한국콘텐츠학회논문지
• /
• 제6권8호
• /
• pp.30-37
• /
• 2006

현재 CDMA 규격으로 정의되어 있는 TIA/EIA/IS-637-A의 단문메시지 전송 규격에는 보안을 위한 별도의 대책이 포함되어 있지 않다. 따라서 필요할 경우 이러한 단문메시지에 별도의 보안대책을 강구하는 것이 바람직할 것으로 보인다. 이 논문에서는 기존의 단문메시지 서비스에 높은 수준의 기밀성과 무결성의 보안을 제공하고 아울러 적정한 수준의 인증 기능을 제공함으로써 단문메시지를 통한 개인 정보의 유출을 방지하여 예상치 못한 사고에 대비하고 사생활을 보호할 수 있는 단문 메시지 서비스를 위한 보안 알고리즘을 제안한다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 II
• /
• pp.927-930
• /
• 2003

In this paper, a design of processor IP for TCP/IP protocol stack is described. The processor consists of input and output buffer memory with dual bank structure, 32-bit RISC microprocessor core, DMA unit with on-the-fly checksum capability. To handle the various modes of TCP/IP protocol, hardware and software co-design approach is used rather than the conventional state machine based design. To eliminate delay time due to the data transfer and checksum operation, DAM module which can execute the checksum operation on-the-fly along with data transfer operation is adopted. By programming the on-chip code ROM of RISC processor differently. the designed stack processor can support the packet format conversion operations required in the various TCP/IP protocols.

• 디지털산업정보학회논문지
• /
• 제8권1호
• /
• pp.47-53
• /
• 2012

Sensor networks and car networks that have different structure from that of conventional TCP/IP network require extreme network environment due to frequent change of connectivity. Because such extreme network environment has characteristics like unreliable link connectivity, long delay time, asymmetrical data transfer rate, and high error rate, etc., it is difficult to perform normally with the conventional TCP/P-based routing. DTNs (delay and disruption tolerant network) was designed to support data transfer in extreme network environment with long delay time and no guarantee for continuous connectivity between terminals. This study suggests an algorithm that limits the maximum number of copying transferred message to L by improving the spray and wait routing protocol, which is one of the conventional DTNs routing protocols, and using the azimuth and density data of the mobile nods. The suggested algorithm was examined by using ONE, a DTNs simulator. As a result, it could reduce the delay time and overhead of unnecessary packets compared to the conventional spray and wait routing protocol.

• 한국정보처리학회논문지
• /
• 제7권5S호
• /
• pp.1657-1665
• /
• 2000

Mobile agents based e-commerce system has many advantage than traditional e-commerce-information gathering on goods, price settlement and payment, delivery of the goods purchased, and so on. However, due to the security vulnerability that stems from mobile agent's mobility, mobile agents based e-commerce system has additional security problems. Therefore, in order to do e-commerce securely in th system, first of al the security issues on mobile agents must be addressed. It this paper, we propose a mobile agent transfer protocol that provides confidentiality and integrity of mobile agent in transit and mutual authentication for communicating hosts. We further show the security of the protocol against many possible attacks. Also, we suggest the location management mechanism of mobile agents based on the trust center. This mechanism is capable of finding their locations transparently and detecting mobile agent clones.

• 한국화재소방학회논문지
• /
• 제11권2호
• /
• pp.35-44
• /
• 1997

본 논문은 RFC1945의 바탕을 둔 HTTP와 PLC전용프로토콜을 사용하여 시간과 장소에 구애받지 않고 위험상황을 감시할 수 있는 원거리 가스누출 감시 시스댐에 관해 연구하였다. 이를 위하여 인터네 트상에 컴퓨터와 PLC의 접속을 위해 상위네트워크와 하위네트워크를 구성하여 인터네트상의 Web을 통해 위험요소를 감시할 수 있는 원거리 가스누출 감시 시스댐을 구축하였다.