• Journal of Internet Computing and Services
• /
• v.16 no.2
• /
• pp.1-6
• /
• 2015

In this paper, we designed an embedded audio video bridging (AVB) platform based on IEEE 802.1BA for real-time multimedia transmission in smart-car, smart-home, smart-theater, and then evaluated a performance of the implemented platform by analysis of IEEE 802.1AS (time synchronization protocol) and IEEE 802.1Qat (stream reservation protocol). Especially, the AVB Layer-2 protocol of MRP(Multiple Registration Protocol), MMAP(Multicast Address Acquisition Protocol), IEEE 1722, 1722.1 etc. was and implemented by linux based operating system. It is shown by interoperability tests with commercial products that the implemented platform transmits real-time multichannel AV data over AVB networks for Multichannel Multimedia Transmission.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.444-446
• /
• 1998

실시간 멀티미디어 응용의 등장으로 멀티캐스트와 QoS(Quality of Service)필수적인 망 서비스가 부각되고 있다 이에 ATM 기반의 인터넷에서 IP멀티캐스트의 효율적인 처리를 위하여 MARS(Multicast Address Resolution Server)가 제안되었고, 기존의 최선 서비스 기반의 인터넷에서 QoS(Quality of Service)를 지우너하기위하여 RSVP(Resource Reservation Protocol)가 제안되었다. 본 논문에서는 ATM망에서 QoS 가 지원되는 IP 멀티캐스트 서비스를 제공하기위하여 MARS 구조에서 RSVP를 지원하는 방안을 두 가지 제안하고, 시뮬레이션을 통하여 그 성능을 분석하고자 한다. 제안하는 두 가지 방법은 각각 RSVP 전 홉 논드 방식과 MARS서버 방식이라 명명하였다. RSVP전 홉 노드 방식은 송신원으로부터 ATM 망으로 진입하는 노드와 수신원을 향하여 ATM망을 진출하는 노드 간에 각각 일대일 양방향 VC를 설정하여 멀티캐스트 그룹에 속하는 수신원들이 보내는 자원 예약 메시지를 ATM 망에서 전송하는 방안이다. MARS 서버 방식은 MARS서버가 RSVP자원 예약 메시지를 처리하도록 그 기능을 확장함으로써 ATM 망의 제어 VC를 절약할 수 있는 방안이다. 시뮬레이션을 통하여, RSVP흐름의 휴지기간이 짧으면 RSVP전 홉 노드방식이 VC해제율이 낮아져 병목 현상으로 인한 큐잉 지연에 크게 영향을 받고 있는 MARS방식보다 유리함을 볼 수 있었고 RSVP 흐름의 휴지기간이 길 때는 병목 현상이 완화된 MARS방식이 VC설정 지연 단점이 부각된 RSVP 전 홉 노드 방식보다 유리함을 볼 수 있었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.160-162
• /
• 2001

Cyclic-Reservation Multiple-Access(CRMA) is an access scheme for high-speed local and metropolitan area networks based on folded-bus or dual-bus configurations. CRMA provides high throughput and fairness independent of the network speed or distance. This paper describes a simulation-based quantitative analysis of the performance gains obtained by introducing slot reuse in CRMA. Generally, a longer cycle length means a longer access delay and a lower throughput. There-fore, it is desirable to develop a scheme such that the cycle length is the shortest. In this paper, we will study the problem of reducing the total number of empty slots generated within every cycle. However, it has been shown that the problem is NP-complete under the constraint that all empty slots used by a station in a cycle are required to be consecutive. We present the algorithm that improves previous novel approach by using previous node information. We compare our slots reuse scheme with several slot reuse algorithms such as region scheme (FMR), address schemes, novel approach in terms of the following two important performance criteria: average cycle length and average slot utilization ratio. As compared with the one proposed in novel algorithm, the new scheme makes the cycle length much shorter. Besides, the resulting slot utilization and the access delay are better than those of the other two schemes.

• Journal of Advanced Navigation Technology
• /
• v.12 no.6
• /
• pp.554-558
• /
• 2008

In this paper, we show that the SIDMA(Self-organized Time Division Multiple Access) protocol using aviation surveillance data link now, designs to the ICAO DO 9816 documentation sequence. This protocol makes use of the VDL(VHF Data Link) Mode 4 and UAT(Universal Access Transceiver) system's MAC(Media Access Control) layer. We make sure of the simulation result and implementation of STDMA protocol program in accompany with the ICAO documentation sequence. This program operates the slot allocation and reservation with report rate when protocol transmits data and calculates slot address.

• Journal of KIISE:Software and Applications
• /
• v.33 no.1
• /
• pp.17-31
• /
• 2006

Software architecture is the high level model of a software system. It should be specified with ADLs (Architecture Description Languages) for its clarity and preciseness. Most ADLs such as C2SADL have not come into extensive use in industries since ADL users should learn a distinct notation specific to architecture, and ADLs do not address all stakes of the development process that is becoming diversified everyday. On the other hand, UML is a do facto standard general modeling language for software developments. UML provides a consistent notation and various supporting tools during the whole software development cycle. But, UML is a general modeling language and does not provide all concepts that are important to architecture description. UML should be extended in order to precisely model architecture. In this paper, we defined a C2 architecture modeling language as a UML2.0 profile. We applied the defined C2 architecture modeling language to the modeling of a restaurant reservation system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10A
• /
• pp.912-921
• /
• 2005

Optical burst switching(OBS) is a promising solution for building terabit optical routers and realizing If over WDM. Channel scheduling Algorithm for reduce contention is one of the major challenges in OBS. We address the issue of how to provide basic burst channel scheduling in optical burst switched WDM networks with fiber delay lines(FDLs). In OBS networks the control and payload components or a burst are sent separately with a time gap. If CHP arrives to burst switch node, because using scheduling algorithm for data burst, reservation resources such as wavelength and transmit data burst without O/E/O conversion, because contention and void between burst are happened at channel scheduling process for data burst that happened the link utilization and bust drop probability Existent proposed methods are become much research to solve these problems. Propose channel scheduling algorithm that use Release Time of bust to emphasize clearance between data and data dissipation that is happened in data assignment in this treatise and maximize bust drop probability and the resources use rate (RTUC : Release Time Unscheduled Channel). As simulation results, Confirmed that is more superior in terms of data drop and link utilization than scheduling algorithm that is proposed existing. As simulation results, confirmed improved performance than scheduling algorithm that is proposed existing in terms of survival of burst, efficiency resource and delay. However, In case load were less, degradation confirmed than existent scheduling algorithm relatively, and confirmed that is superior in data drop aspect in case of load increased.