• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.6
• /
• pp.19-25
• /
• 2002

A regular virtual topology requires little processing time for routing purposes which may be a desirable property for high-speed networks. Asymmetric bilayered ShuffleNet, proposed by us as a virtual topology, can be more efficient to be used to design a wide-area optical network compared to ShuffleNet. In this paper, asymmetric bilayered ShuffleNet is imbedded on a given physical topology with the objective of minimizing the total message delay.

• Journal of Communications and Networks
• /
• v.18 no.4
• /
• pp.658-669
• /
• 2016

The tremendous increase in mobile data traffic coupled with fierce competition in wireless industry brings about spectrum scarcity and bandwidth fragmentation. This inevitably results in asymmetric-valued long term evolution (LTE) spectrum allocation that stems from different timing for twice improvement in capacity between competing operators, given spectrum allocations today. This motivates us to study the economic effects of asymmetric-valued LTE spectrum allocation. In this paper, we formulate the interactions between operators and users as a hierarchical dynamic game framework, where two spiteful operators simultaneously make spectrum acquisition decisions in the upper-level first-price sealed-bid auction game, and dynamic pricing decisions in the lower-level differential game, taking into account user subscription dynamics. Using backward induction, we derive the equilibrium of the entire game under mild conditions. Through analytical and numerical results, we verify our studies by comparing the latest result of LTE spectrum auction in South Korea, which serves as the benchmark of asymmetric-valued LTE spectrum auction designs.

• Journal of Communications and Networks
• /
• v.10 no.4
• /
• pp.455-464
• /
• 2008

To provide network services consistently under various network failures, enterprise networks increasingly utilize path diversity through multi-homing. As a result, multi-homed non-transit autonomous systems become to surpass single-homed networks in number. In this paper, we address an inevitable problem that occurs when networks with multiple entry points deploy firewalls in their borders. The majority of today's firewalls use stateful inspection that exploits connection state for fine-grained control. However, stateful inspection has a topological restriction such that outgoing and incoming traffic of a connection should pass through a single firewall to execute desired packet filtering operation. Multi-homed networking environments suffer from this restriction and BGP policies provide only coarse control over communication paths. Due to these features and the characteristics of datagram routing, there exists a real possibility of asymmetric routing. This mismatch between the exit and entry firewalls for a connection causes connection establishment failures. In this paper, we formulate this phenomenon into a state-sharing problem among multiple fire walls under asymmetric routing condition. To solve this problem, we propose a stateful inspection protocol that requires very low processing and messaging overhead. Our protocol consists of the following two phases: 1) Generation of a TCP SYN cookie marked with the firewall identification number upon a SYN packet arrival, and 2) state sharing triggered by a SYN/ACK packet arrival in the absence of the trail of its initial SYN packet. We demonstrate that our protocol is scalable, robust, and simple enough to be deployed for high speed networks. It also transparently works under any client-server configurations. Last but not least, we present experimental results through a prototype implementation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3352-3365
• /
• 2012

Group key agreement (GKA) is a cryptographic primitive allowing two or more users to negotiate a shared session key over public networks. Wu et al. recently introduced the concept of asymmetric GKA that allows a group of users to negotiate a common public key, while each user only needs to hold his/her respective private key. However, Wu et al.'s protocol can not resist active attacks, such as fabrication. To solve this problem, Zhang et al. proposed an authenticated asymmetric GKA protocol, where each user is authenticated during the negotiation process, so it can resist active attacks. Whereas, Zhang et al.'s protocol needs a partially trusted certificate authority to issue certificates, which brings a heavy certificate management burden. To eliminate such cost, Zhang et al. constructed another protocol in identity-based setting. Unfortunately, it suffers from the so-called key escrow problem. In this paper, we propose the certificateless authenticated asymmetric group key agreement protocol which does not have certificate management burden and key escrow problem. Besides, our protocol achieves known-key security, unknown key-share security, key-compromise impersonation security, and key control security. Our simulation based on the pairing-based cryptography (PBC) library shows that this protocol is efficient and practical.

• Journal of Contemporary Eastern Asia
• /
• v.20 no.2
• /
• pp.157-173
• /
• 2021

In the transition to a multipolar international system, the literature has focused on great power competition while little attention has been given to the strategic possibilities of smaller states. However, as a result of globalization, states are so closely interconnected that the primary strategies of even major powers are not to achieve zero-sum solutions but to create asymmetric dependency through which they can influence the behavior of other states and non-state actors. States are assisted in this effort by a variety of tools, including setting up institutions, direct economic influence and through building different forms of infrastructure connectivity networks. By discussing asymmetric dependency situations from the perspective of the great powers, the literature presents smaller states primarily as passive actors, paralyzed by their dependence on great powers. Our paper argues that interdependence allows smaller states to effectively influence larger actors and examines strategies from which smaller states can choose in order to influence the behavior of larger states. Despite an extremely asymmetric relationship between Myanmar and China, actors in Myanmar have sought to influence China's Myanmar policy. We examine a case study of the Myitsone Dam, including Myanmar's strategic aims, chosen strategy and limitations in maneuvering space. Semi-structured interviews with local decision-makers and stakeholders are conducted in order to portray the full picture. Our study concludes that further research on the influencing strategies of small states in response to asymmetric dependence can contribute to a better understanding of the interdependence of states.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.466-474
• /
• 2007

Asymmetric networks that the downlink bandwidth is larger than the uplink bandwidth may cause the degradation of the TCP performance due to the uplink congestion. In order to solve this problem, this paper designs and implements the Dynamic Segment Size Control mechanism which offers a suitable segment size for current networks. The proposed mechanism does not require any changes in customer premises but suppress the number of ACKs using segment reassembly technique to avoid the uplink congestion. The gateway which adapted the Dynamic Segment Size Control mechanism, detects the uplink congestion condition and dynamically measures the bandwidth asymmetric ratio and the packet loss ratio. The gateway reassembles some of segments received from the server into a large segment and transmits it to the client. This reduces the number of corresponding ACKs. In this mechanism, the SACK option is used when occurs the bit error during the transmission. Based on the simulation in the GEO satellite network environment, we analyzed the performance of the Dynamic Segment Size Control mechanism.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.9
• /
• pp.1209-1218
• /
• 2001

In this dissertation, we propose a dynamic source routing protocol supporting asymmetric path for mobile ad hoc networks. At present, the existing dynamic source routing protocol supports only symmetric path for routing. However, in fact, there can exist unidirectional links due to asymmetric property of mobile termenals or current wireless environment. Thus, we implement a mobile ad hoc routing protocol supporting asymmetric routing path, which is fit for more general wireless environment. Especially, the proposed protocol uses an improved multipath maintenance method in order to perform rapid route reconfiguration when route error due to mobility is detected.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5361-5374
• /
• 2016

Combining channel coding and network coding in a physical layer in a fading channel, generalized joint channel-network coding (G-JCNC) is proved to highly perform in a two-way relay channel (TWRC). However, most relevant discussions are restricted to symmetric networks. This paper investigates the G-JCNC protocols in an asymmetric TWRC (A-TWRC). A newly designed encoder used by source nodes that is dedicated to correlate codewords with different orders is presented. Moreover, the capability of a simple common non-binary decoder at a relay node is verified. The effects of a power match under various numbers of iteration and code lengths are also analyzed. The simulation results give the optimum power match ratio and demonstrate that the designed scheme based on G-JCNC in an A-TWRC has excellent bit error rate performance under an appropriate power match ratio.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3131-3149
• /
• 2016

In-band Full-duplex (IBFD) wireless communication allows improved throughput for wireless networks. The current Half-duplex (HD) medium access mechanism Request to Send/Clear to Send (RTS/CTS) has been directly applied to IBFD wireless networks. However, this is only able to support a symmetric dual link, and does not provide the full advantages of IBFD. To increase network throughput in a superior way to the HD mechanism, a novel three-way handshaking access mechanism RTS/SRTS (Second Request to Send)/CTS is proposed for point to multipoint (PMP) IBFD wireless networks, which can support both symmetric dual link and asymmetric dual link communication. In this approach, IBFD wireless communication only requires one channel access for two-way simultaneous packet transmissions. We first describe the RTS/SRTS/CTS mechanism and the symmetric/asymmetric dual link transmission procedure and then provide a theoretical analysis of network throughput and delay using a Markov model. Using simulations, we demonstrate that the RTS/SRTS/CTS access mechanism shows improved performance relative to that of the RTS/CTS HD access mechanism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5B
• /
• pp.771-776
• /
• 2010

In this paper, we present an efficient centralized dynamic bandwidth allocation scheme with multicasting for asymmetric 10G-Ethernet Passive Optical Networks (10G-EPONs). The proposed scheme is based on multicast-burst polling and provides quality of service (QoS) with class of service (CoS) to different lasses of packets. It is shown that a well-known conventional interleaved polling scheme severely decreases downstream channel capacity for user traffic when the upstream network load is low (avalanche gate frequency). To overcome this problem, we have proposed a multicast burst polling scheme which shows impressively lower downstream bandwidth consumption compare to IPACT and moreover it did not show the light load penalty problem. Simulation results using an OPNET tool show that the multicast burst polling effectively eliminates light-load penalty and minimizes downstream bandwidth consumption under avalanche gate frequencies.